A Study of Strong and Weak Stability in Discretization Algorithms

DOI10.1137/0702021MaRDI QIDQ5514023zbMATH OpenOpenAlexFDO

Authors Hans J. Stetter

Publication date 1965

Published in Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0702021

zbMATH Keywords

numerical analysis

Cited in

(11)

• Consistency, convergence and stability of general discretizations of the initial value problem
• Improved absolute stability of predictor-corrector schemes
• Instability and non-monotonicity phenomena in discretizations to boundary value problems
• Über die Koerzitivität gewöhnlicher Differenzenoperatoren und die Konvergenz von Mehrschrittverfahren
• Symmetric two-step algorithms for ordinary differential equations
• Properties of certain rational approximations toe −z
• A Note on the Effect of Conditionally Stable Correctors
• On the structure of error estimates for finite-difference methods
• On the structure of error estimates for finite-difference methods
• Vienna contributions to the development of RK-methods
• The influence of parasitic modes on stable lattice Boltzmann schemes and weakly unstable multi-step finite difference schemes

This page was built for publication: A Study of Strong and Weak Stability in Discretization Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514023)