We construct explicit single step discretizations of linear, non-homogeneous initial boundary value problems. These methods use polynomial approximations for the time discretization. The order reduction phenomenon, present when a fully discrete Runge-Kutta is used, is avoided and the maximum expecte
Rational methods with optimal order of convergence for partial differential equations
✍ Scribed by Isaías Alonso-Mallo
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 218 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0168-9274
No coin nor oath required. For personal study only.
✦ Synopsis
We construct rational approximations to linear, non-homogeneous initial boundary value problems. They are based on A-acceptable rational approximations to the exponential for the time discretization. The order reduction phenomenon is avoided and the optimal order of convergence in time is achieved. The theoretical results are illustrated numerically.
📜 SIMILAR VOLUMES
Approximations where the derivatives are corrected so as to satisfy linear completeness on the derivatives are investigated. These techniques are used in particle methods and other mesh-free methods. The basic approximation is a Shepard interpolant which possesses only constant completeness. The der
## Abstract This paper reports on an experimental study of the effectiveness of high order numerical methods applied to linear elliptic partial differential equations whose solutions have singularities or similar difficulties (e.g. boundary layers, sharp peaks). Three specific hypotheses are establ
## Abstract In this paper numerical methods for solving first‐order hyperbolic partial differential equations are developed. These methods are developed by approximating the first‐order spatial derivative by third‐order finite‐difference approximations and a matrix exponential function by a third‐o