هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة لن يكون صفرا أبدا أو أن يكون له قيمة عقدية بسبب اختيارالعقد المحددة لمتغيري النواة الوحيدين. مع متعددات حدود برنولي من الدرجة 4 و 8 كمثال على ذلك، يوفر النهج الحالي حلا قريبا جدا من الحل الدقيق في أمثلة الاختبار. بينما. يثبت الحجم المتواضع جدا للأخطاء في أمثلة الاختبار فعالية الاستراتيجية الحالية. أيضا ، فإن السهولة التي يمكن بها تنفيذ برنامج الكمبيوتر تجعل هذه التقنية فعالة للغاية. هدف آخر هو تحديد كفاءة الطريقة المقترحة من خلال مقارنتها بأساليب مختلفة. يظهر أن الحل التقريبي للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة يتقارب بشدة مع الحل المضبوط للمعادلات باستخدام متعددة حدود برنولي وهو متفوق على تلك الموجودة في الأساليب الأخرى المذكورة. هذا يضمن الأصالة والدقة العالية للطريقة المقترحة. كذلك تمت مناقشة تقارب الحل. تم تنفيذ البرامج باستخدام برنامج ال MATLAB النسخة 2018a .
The aim of this paper is to present the numerical method for solving linear system of Fredholm integral equations, based on the Haar wavelet approach. Many test problems, for which the exact solution is known, are considered. Compare the results of suggested method with the results of another method (Trapezoidal method). Algorithm and program is written by Matlab vergion 7.
In this paper, the exact solutions of the Schlömilch’s integral equation and its linear and non-linear generalized formulas with application are solved by using two efficient iterative methods. The Schlömilch’s integral equations have many applications in atmospheric, terrestrial physics and ionospheric problems. They describe the density profile of electrons from the ionospheric for awry occurrence of the quasi-transverse approximations. The paper aims to discuss these issues.
First, the authors apply a regularization meth
In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.
A novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio
... Show MoreA novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solu
... Show MoreThe aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point osculatory interpolation. The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems. A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects
... Show MoreIn this paper, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those methods i
... Show MoreIn this paper, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those
... Show MoreComputer vision seeks to mimic the human visual system and plays an essential role in artificial intelligence. It is based on different signal reprocessing techniques; therefore, developing efficient techniques becomes essential to achieving fast and reliable processing. Various signal preprocessing operations have been used for computer vision, including smoothing techniques, signal analyzing, resizing, sharpening, and enhancement, to reduce reluctant falsifications, segmentation, and image feature improvement. For example, to reduce the noise in a disturbed signal, smoothing kernels can be effectively used. This is achievedby convolving the distributed signal with smoothing kernels. In addition, orthogonal moments (OMs) are a cruc
... Show More