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.
Background/objectives: To study the motion equation under all perturbations effect for Low Earth Orbit (LEO) satellite. Predicting a satellite’s orbit is an important part of mission exploration. Methodology: Using 4th order Runge–Kutta’s method this equation was integrated numerically. In this study, the accurate perturbed value of orbital elements was calculated by using sub-steps number m during one revolution, also different step numbers nnn during 400 revolutions. The predication algorithm was applied and orbital elements changing were analyzed. The satellite in LEO influences by drag more than other perturbations regardless nnn through semi-major axis and eccentricity reducing. Findings and novelty/improvement: The results demo
... Show MoreIn 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 condense study was done to compare between the ordinary estimators. In particular the maximum likelihood estimator and the robust estimator, to estimate the parameters of the mixed model of order one, namely ARMA(1,1) model.
Simulation study was done for a varieties the model. using: small, moderate and large sample sizes, were some new results were obtained. MAPE was used as a statistical criterion for comparison.
The aim of this paper is to introduce the concepts of asymptotically p-contractive and asymptotically severe accretive mappings. Also, we give an iterative methods (two step-three step) for finite family of asymptotically p-contractive and asymptotically severe accretive mappings to solve types of equations.
The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
In 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 MoreIn the present work, we use the Adomian Decomposition method to find the approximate solution for some cases of the Newell whitehead segel nonlinear differential equation which was solved previously with exact solution by the Homotopy perturbation and the Iteration methods, then we compared the results.
A new efficient Two Derivative Runge-Kutta method (TDRK) of order five is developed for the numerical solution of the special first order ordinary differential equations (ODEs). The new method is derived using the property of First Same As Last (FSAL). We analyzed the stability of our method. The numerical results are presented to illustrate the efficiency of the new method in comparison with some well-known RK methods.