A General Theory of Convergence for Numerical Methods

DOI10.1137/0709043zbMath0248.65044OpenAlexW2039370228MaRDI QIDQ5661090

Bruce A. Chartres, Robert S. Stepleman

Publication date: 1972

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical solution of boundary value problems involving ordinary differential equations (65L10)

Related Items (17)

Convergence analysis of the semi-implicit euler method for abstract evolution equations ⋮ On Some Connections Between Well‐Posedness and General Properties of Numerical Methods ⋮ On the concepts of convergence, consistency, and stability in connection with some numerical methods ⋮ Subset simulation for probabilistic computer models ⋮ The non-linear sewing lemma III: stability and generic properties ⋮ A method for the computation of bounds with convergence of arbitrary order for ordinary linear boundary value problems ⋮ On the stability of the Ritz procedure for nonlinear problems ⋮ Weak stability and weak discrete convergence of continuous mappings ⋮ Alternative forms with orders of the Lax equivalence theorem in Banach spaces ⋮ Convergence of linear multistep methods for differential equations with discontinuities ⋮ Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures ⋮ Stability and convergence of monotonic algorithms ⋮ On the Lax equivalence theorem equipped with orders ⋮ One-step methods of any order for ordinary differential equations with discontinuous right-hand sides ⋮ On the convergence of multistep methods for the Cauchy problem for ordinary differential equations ⋮ Round-off error for retarded ordinary differential equations: A priori bounds and estimates ⋮ Approximation for age-structured population models using projection methods

This page was built for publication: A General Theory of Convergence for Numerical Methods