This paper follows several previous papers written by the authors and coworkers on the subject of peer methods for initial value problem. Here, the authors resume earlier work by considering the case of FSAL methods (first same as last), where the first stage of the current step is equal to the last stage from the previous step. Actually, peer two-step methods combine the advantages of one-step and multi-step methods without most disadvantages and provide in a natural way a dense and continuous output. New peer methods with FSAL property are derived and compared with existing methods in the case of explicit parallel methods and implicit sequential methods. Many remarkable numerical examples are provided.
- Doubly quasi-consistent parallel explicit peer methods with built-in global error estimation
- Explicit two-step peer methods
- High-order linearly implicit two-step peer - finite element methods for time-dependent PDEs
- scientific article; zbMATH DE number 5713618 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Implicit parallel peer methods for stiff initial value problems
- Implicit peer methods for large stiff ODE systems
- Multi-implicit peer two-step W-methods for parallel time integration
- On the derivation of explicit two-step peer methods
- Parallel start for explicit parallel two-step peer methods
- Parallel Two-Step W-Methods with Peer Variables
- Parameter optimization for explicit parallel peer two-step methods
- Rosenbrock-type `peer' two-step methods
- Solving Ordinary Differential Equations I
- Solving ordinary differential equations. II: Stiff and differential-algebraic problems.
- Superconvergent explicit two-step peer methods
- Strong stability preserving explicit peer methods for discontinuous Galerkin discretizations
- Optimally zero stable explicit peer methods with variable nodes
- Exponentially fitted two-step peer methods for oscillatory problems
- Reprint of: Peer methods with improved embedded sensitivities for parameter-dependent ODEs
- Efficient A-stable peer two-step methods
- Explicit two-step peer methods with reused stages
- On the implementation of explicit two-step peer methods with Runge-Kutta stability
- On the derivation of explicit two-step peer methods
- On the construction of diagonally implicit two-step peer methods with RK stability
- Implicit peer triplets in gradient-based solution algorithms for ODE constrained optimal control
- Implicit-explicit two-step peer methods with RK stability for implicit part
- Strong stability preserving explicit peer methods
This page was built for publication: Two-step peer methods with continuous output
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q369402)