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.

     The method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as  increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives  a good agreement.

This article introduces a novel procedure to detect an approximate solution to Fredholm fractional integro-differential equations with linear type (LFFIDE) defined using Caputo fractional derivative. The new procedure approximates the solution using three types of polynomials: Laguerre polynomials, Hermite polynomials, and Legendre polynomials, thereafter transforming the problem into a linear programming problem. The approximate solutions are compared using testing examples to examine the efficiency of the suggested approach. Also, a comparison with the other methods using the same polynomials illustrates The effectiveness and consistency of the proposed technique. Finally, the error analysis of the proposed technique and convergent are di

In this paper the oscillation criterion was investigated for all solutions of the third-order half linear neutral differential equations. Some necessary and sufficient conditions are established for every solution of (a(t)[(x(t)±p(t)x(?(t) ) )^'' ]^? )^'+q(t) x^? (?(t) )=0, t?t_0, to be oscillatory. Examples are given to illustrate our main results.

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

This paper presents seven modified Adomian Decomposition Method (ADM) techniques for efficiently solving initial value problems, especially those involving non-homogeneous and nonlinear differential equations. While the classical ADM is effective for linear homogeneous cases, it has difficulties solving more complex problems. The proposed modifications—from MADM1 to MLADM—include Maclaurin and Taylor expansions, Laplace transforms, and single-step iterations.• These modifications enhance convergence, reduce complexity, and improve accuracy.• Each method offers specific advantages, such as accelerating convergence (MADM2, RADM4), simplifying computation (TSADM5), and achieving higher accuracy (MLADM).• Numerical examples confirm th

Many numerical approaches have been suggested to solve nonlinear problems. In this paper, we suggest a new two-step iterative method for solving nonlinear equations. This iterative method has cubic convergence. Several numerical examples to illustrate the efficiency of this method by Comparison with other similar methods is given.

For many problems in Physics and Computational Fluid Dynamics (CFD), providing an accurate approximation of derivatives is a challenging task. This paper presents a class of high order numerical schemes for approximating the first derivative. These approximations are derived based on solving a special system of equations with some unknown coefficients. The construction method provides numerous types of schemes with different orders of accuracy. The accuracy of each scheme is analyzed by using Fourier analysis, which illustrates the dispersion and dissipation of the scheme. The polynomial technique is used to verify the order of accuracy of the proposed schemes by obtaining the error terms. Dispersion and dissipation errors are calculated