هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة لن يكون صفرا أبدا أو أن يكون له قيمة عقدية بسبب اختيارالعقد المحددة لمتغيري النواة الوحيدين. مع متعددات حدود برنولي من الدرجة 4 و 8 كمثال على ذلك، يوفر النهج الحالي حلا قريبا جدا من الحل الدقيق في أمثلة الاختبار. بينما. يثبت الحجم المتواضع جدا للأخطاء في أمثلة الاختبار فعالية الاستراتيجية الحالية. أيضا ، فإن السهولة التي يمكن بها تنفيذ برنامج الكمبيوتر تجعل هذه التقنية فعالة للغاية. هدف آخر هو تحديد كفاءة الطريقة المقترحة من خلال مقارنتها بأساليب مختلفة. يظهر أن الحل التقريبي للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة يتقارب بشدة مع الحل المضبوط للمعادلات باستخدام متعددة حدود برنولي وهو متفوق على تلك الموجودة في الأساليب الأخرى المذكورة. هذا يضمن الأصالة والدقة العالية للطريقة المقترحة. كذلك تمت مناقشة تقارب الحل. تم تنفيذ البرامج باستخدام برنامج ال MATLAB النسخة 2018a .
The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample
... Show MoreWatermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD
... Show MoreMany of the elementary transformations of determinants which are used in their evaluation and in the solution of linear equations may by expressed in the notation of matrices. In this paper, some new interesting formulas of special matrices are introduced and proved that the determinants of these special matrices have the values zero. All formulation has been coded in MATLAB 7.
Copula modeling is widely used in modern statistics. The boundary bias problem is one of the problems faced when estimating by nonparametric methods, as kernel estimators are the most common in nonparametric estimation. In this paper, the copula density function was estimated using the probit transformation nonparametric method in order to get rid of the boundary bias problem that the kernel estimators suffer from. Using simulation for three nonparametric methods to estimate the copula density function and we proposed a new method that is better than the rest of the methods by five types of copulas with different sample sizes and different levels of correlation between the copula variables and the different parameters for the function. The
... Show MoreIn this work, the fractional damped Burger's equation (FDBE) formula = 0,
In this work, the fractional damped Burger's equation (FDBE) formula = 0,
Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app
... Show MoreThis paper is concerned with the oscillation of all solutions of the n-th order delay differential equation . The necessary and sufficient conditions for oscillatory solutions are obtained and other conditions for nonoscillatory solution to converge to zero are established.