هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة

Chemical 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.

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

The dependence of the energy losses or the stopping power for the ion contribution in D- T hot plasma fuels upon the corresponding energies and the related penetrating factorare arrive by using by a theoretical approximation models. In this work we reach a compatible agreement between our results and the corresponding experimental results.

The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).