The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods
Diagonally-implicit multi-stage integration methods
Applied Numerical Mathematics
A general class of two-step Runge-Kutta methods for ordinary differential equations
SIAM Journal on Numerical Analysis
Applied Numerical Mathematics
Implementation of two-step Runge-Kutta methods for ordinary differential equations
Journal of Computational and Applied Mathematics
A nonlinear optimization approach to the construction of general linear methods of high order
Journal of Computational and Applied Mathematics
SIAM Journal on Numerical Analysis
Applied Numerical Mathematics
Elementary Numerical Analysis: An Algorithmic Approach
Elementary Numerical Analysis: An Algorithmic Approach
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Construction of two-step Runge--Kutta methods with large regions of absolute stability
Journal of Computational and Applied Mathematics
Error propagation of general linear methods for ordinary differential equations
Journal of Complexity
Explicit two-step peer methods
Computers & Mathematics with Applications
Superconvergent explicit two-step peer methods
Journal of Computational and Applied Mathematics
Parameter optimization for explicit parallel peer two-step methods
Applied Numerical Mathematics
Nordsieck representation of two-step Runge--Kutta methods for ordinary differential equations
Applied Numerical Mathematics
Two-step Runge-Kutta Methods with Quadratic Stability Functions
Journal of Scientific Computing
Partially implicit peer methods for the compressible Euler equations
Journal of Computational Physics
Mathematics and Computers in Simulation
Explicit Nordsieck methods with quadratic stability
Numerical Algorithms
Hi-index | 7.29 |
We analyze implicit general linear methods with s internal stages and r=s+1 external stages of order p=s+1 and stage order q=s or q=s+1. These methods might eventually lead to more efficient formulas than the class of DIMSIMs and the class of general linear methods with inherent Runge-Kutta stability. We analyze also error propagation and estimation of local discretization errors. Examples of such methods which are A- and L-stable are derived up to the stage order q=3 or q=4 and order p=4.