On some discretization methods for solving a linear matrix ordinary differential equation
DOI10.1007/s10910-010-9794-zzbMath1306.65226OpenAlexW2031364150WikidataQ115382717 ScholiaQ115382717MaRDI QIDQ537975
Publication date: 23 May 2011
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-010-9794-z
convergenceerror estimatesnumerical examplesordinary differential equationsCrank-Nicolson schemebackward Euler methoddiscretization methods
Stability and convergence of numerical methods for ordinary differential equations (65L20) Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Error bounds for numerical methods for ordinary differential equations (65L70) Finite difference and finite volume methods for ordinary differential equations (65L12)
Related Items (2)
Cites Work
- Solutions to linear matrix ordinary differential equations via minimal, regular, and excessive space extension based universalization. Perturbative matrix splines, convergence and error estimate issues for polynomial coefficients in the homogeneous case
- Solutions to linear matrix ordinary differential equations via minimal, regular, and excessive space extension based universalization. Convergence and error estimates for truncation approximants in the homogeneous case with premultiplying polynomial coefficient matrix
- Solving Ordinary Differential Equations I
- Theoretical Numerical Analysis
- Geometric Numerical Integration
- Numerical Methods for Ordinary Differential Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On some discretization methods for solving a linear matrix ordinary differential equation