On the numerical Picard iterations with collocations for the initial value problem
From MaRDI portal
Abstract: Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand side of the differential system by Lagrange interpolation polynomials followed by successive approximations. In the case when the number of interpolation point is fixed a convergence result is given. Finally some numerical experiments are reported.
Recommendations
- Solving stiff problems using generalized Picard iterations
- Picard iteration algorithm combined with Gauss-Seidel technique for initial value problems
- Remarks on Picard-Lindelöf iteration
- A method for global approximation of the initial value problem
- Picard iteration-based variable-order integrator with dense output employing algorithmic differentiation
Cited in
(4)- Picard iteration-based variable-order integrator with dense output employing algorithmic differentiation
- Picard iteration algorithm combined with Gauss-Seidel technique for initial value problems
- scientific article; zbMATH DE number 4109996 (Why is no real title available?)
- Solving stiff problems using generalized Picard iterations
This page was built for publication: On the numerical Picard iterations with collocations for the initial value problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4971941)