هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة لن يكون صفرا أبدا أو أن يكون له قيمة عقدية بسبب اختيارالعقد المحددة لمتغيري النواة الوحيدين. مع متعددات حدود برنولي من الدرجة 4 و 8 كمثال على ذلك، يوفر النهج الحالي حلا قريبا جدا من الحل الدقيق في أمثلة الاختبار. بينما. يثبت الحجم المتواضع جدا للأخطاء في أمثلة الاختبار فعالية الاستراتيجية الحالية. أيضا ، فإن السهولة التي يمكن بها تنفيذ برنامج الكمبيوتر تجعل هذه التقنية فعالة للغاية. هدف آخر هو تحديد كفاءة الطريقة المقترحة من خلال مقارنتها بأساليب مختلفة. يظهر أن الحل التقريبي للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة يتقارب بشدة مع الحل المضبوط للمعادلات باستخدام متعددة حدود برنولي وهو متفوق على تلك الموجودة في الأساليب الأخرى المذكورة. هذا يضمن الأصالة والدقة العالية للطريقة المقترحة. كذلك تمت مناقشة تقارب الحل. تم تنفيذ البرامج باستخدام برنامج ال MATLAB النسخة 2018a .
Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show MoreChemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.
In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.
A new panel method had been developed to account for unsteady nonlinear subsonic flow. Two boundary conditions were used to solve the potential flow about complex configurations of airplanes. Dirichlet boundary condition and Neumann formulation are frequently applied to the configurations that have thick and thin surfaces respectively. Mixed boundary conditions were used in the present work to simulate the connection between thick fuselage and thin wing surfaces. The matrix of linear equations was solved every time step in a marching technique with Kelvin's theorem for the unsteady wake modeling. To make the method closer to the experimental data, a Nonlinear stripe theory which is based on a two-dimensional viscous-inviscid interac
... Show MoreThe extracting of personal sprite from the whole image faced many problems in separating the sprite edge from the unneeded parts, some image software try to automate this process, but usually they couldn't find the edge or have false result. In this paper, the authors have made an enhancement on the use of Canny edge detection to locate the sprite from the whole image by adding some enhancement steps by using MATLAB. Moreover, remove all the non-relevant information from the image by selecting only the sprite and place it in a transparent background. The results of comparing the Canny edge detection with the proposed method shows improvement in the edge detection.
The author obtain results on the asymptotic behavior of the nonoscillatory solutions of first order nonlinear neutral differential equations. Keywords. Neutral differential equations, Oscillatory and Nonoscillatory solutions.