Picard iteration algorithm combined with Gauss-Seidel technique for initial value problems
DOI10.1016/j.amc.2007.01.058zbMath1122.65369OpenAlexW2024709048MaRDI QIDQ2383762
Ismail K. Youssef, Hassan A. M. El-Arabawy
Publication date: 19 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.01.058
convergencenumerical examplesinitial value problemsTaylor seriesPicard iterationcomputer algebra systemRunge Kutta method
Symbolic computation and algebraic computation (68W30) Nonlinear ordinary differential equations and systems (34A34) Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)
Related Items (7)
Uses Software
Cites Work
- An iterative method for solving nonlinear functional equations
- Revised Adomian decomposition method for solving systems of ordinary and fractional differential equations
- Solution of the system of ordinary differential equations by Adomian decomposition method.
- Comparing numerical methods for the solutions of systems of ordinary differential equations.
- An adaptive \(N\)-body algorithm of optimal order.
- A reliable method for the numerical solution of the kinetics problems
- On the numerical solution of stiff systems
- 𝐶^{𝑟} convergence of Picard’s successive approximations
- A Technique for the Numerical Verification of Asymptotic Expansions
- Comparing Numerical Methods for Ordinary Differential Equations
- A Picard-Maclaurin theorem for initial value PDEs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Picard iteration algorithm combined with Gauss-Seidel technique for initial value problems