Acceleration of implicit schemes for large systems of nonlinear ODEs
The authors study the acceleration of implicit schemes for large systems of nonlinear ordinary differential equations (ODEs). They describe the subspace of approximation and provide estimates for the error between the exact and the approximate solution of the implicit scheme. In view of the line search and trust region algorithm, a method of computing a good descent direction and a good initial guess for each linear system is given. The algorithmic aspect of the proposed approach and the numerical effectiveness on a very stiff problem is given. The generalized minimal residual (GMRES) Krylov subspace method is used in the discussions.
- Acceleration of implicit schemes for large systems of nonlinear differential-algebraic equations
- Acceleration of implicit schemes for large linear systems of differential-algebraic equations
- Improved predictor schemes for large systems of linear ODEs
- Implicit peer methods for large stiff ODE systems
- A note on the efficient implementation of implicit methods for ODEs
- Acceleration of nonlinear solvers for natural convection problems
- Acceleration of implicit schemes for large systems of nonlinear differential-algebraic equations
- Acceleration of implicit schemes for large linear systems of differential-algebraic equations
- Improved predictor schemes for large systems of linear ODEs
- Implicit peer methods for large stiff ODE systems
- Acceleration of implicit schemes for large systems of delay differential equations
- Mixed precision implicit numerical schemes for systems of ordinary differential equations
This page was built for publication: Acceleration of implicit schemes for large systems of nonlinear ODEs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964098)