On Some Connections Between Well‐Posedness and General Properties of Numerical Methods
From MaRDI portal
Publication:4847478
Recommendations
- Problem solving with well posedness analysis. I.
- All well-posed problems have uniformly stable and convergent discretizations
- Four fundamental spaces of numerical analysis
- Well-posedness of parabolic difference equations. Transl. from the Russian by A. Iacob
- Conditionally well-posed and generalized well-posed problems
Cites work
- A General Theory of Convergence for Numerical Methods
- A unified framework for the discretization of nonlinear operator equations
- Actual Order of Convergence of Runge–Kutta Methods on Differential Equations with Discontinuities
- An extension of the Lax-Richtmyer theory
- Discrete Closure and Asymptotic (Quasi-) Regularity in Discretization Algorithms
- Equivalence Theorems for Incomplete Spaces: An Appraisal
- scientific article; zbMATH DE number 3951900 (Why is no real title available?)
- scientific article; zbMATH DE number 53859 (Why is no real title available?)
- scientific article; zbMATH DE number 3434988 (Why is no real title available?)
- scientific article; zbMATH DE number 3438283 (Why is no real title available?)
- scientific article; zbMATH DE number 3992881 (Why is no real title available?)
- Stability and Convergence for Non-Linear Difference Schemes are Equivalent
- Studies in Numerical Nonlinear Instability I. Why do Leapfrog Schemes Go Unstable?
- Survey of the stability of linear finite difference equations
- Well-Posed Problems and Stable Difference Operators
- Zur Frage der Verallgemeinerung des Äquivalenzsatzes von Lax
- Zur Struktur gewisser Konvergenzkriterien bei der numerischen Lösung von Anfangswertaufgaben. (On the structure of some convergence criterious for numerical solving of certain initial value problems)
Cited in
(5)- On regularity at \(t=0\) for semilinear ADEs and its numerical applications
- Elastodynamic parameters for dynamic interface fracture mechanics
- Convergence analysis of the semi-implicit euler method for abstract evolution equations
- All well-posed problems have uniformly stable and convergent discretizations
- Problem solving with well posedness analysis. I.
This page was built for publication: On Some Connections Between Well‐Posedness and General Properties of Numerical Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847478)