Stability and convergence at the PDE/stiff ode interface
Applied Numerical MathematicsPublished 1 February 1989
J. M. Sanz‐Serna, J.G. Verwer
Citations41
SJR quartileQ1
SJR score0.94
SNIP1.31
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This is an expository paper showing the interplay between the analysis of numerical methods for evolutionary partial differential equations and some developments in the stiff ordinary differential equation literature. The notions of contractivity, one-sided Lipschitz conditions, logarithmic norms, B-convergence and order reduction are of particular importance.
Keywords
Computer ScienceMathematicsEngineering
Physics Today<i>Difference Methods for Initial-Value Problems</i>
3,227 Citations1959Robert D. Richtmyer, E. H. Dill
Physics Today<i>Analysis of Numerical Methods</i>
2,290 Citations1967Eugene Isaacson, Herbert B. Keller +1 more
BIT Numerical MathematicsA stability property of implicit Runge-Kutta methods
177 Citations1975J. C. Butcher
A class of implicit Runge-Kutta methods is shown to possess a stability property which is a natural extension of the notion of A-stability for non-linear systems.
SIAM Journal on Numerical AnalysisOn Rational Approximations of Semigroups
154 Citations1979Philip Brenner, Vidar Thomée
Numerische MathematikContractivity in the numerical solution of initial value problems
121 Citations1983M. N. Spijker
Numerische MathematikConvergence and order reduction of Runge-Kutta schemes applied to evolutionary problems in partial differential equations
115 Citations1986J. M. Sanz‐Serna, J.G. Verwer +1 more
It is proved that, under certain conditions, the order in time of the fully discrete scheme equals the conventional order of the Runge-Kutta formula being used, which indicates that explicit discretizations are most appealing in this area.
SIAM Journal on Numerical AnalysisThe Concept of B-Convergence
110 Citations1981Reinhard Frank, J. Schneid +1 more
ComputingConvergence of method of lines approximations to partial differential equations
108 Citations1984J.G. Verwer, J. M. Sanz‐Serna
The main purpose is to set up a general framework for a convergence analysis applicable to nonlinear problems, and important concepts are the logarithmic matrix norm and C-stability.
SIAM Journal on Numerical AnalysisOrder Results for Implicit Runge–Kutta Methods Applied to Stiff Systems
106 Citations1985Reinhard Frank, J. Schneid +1 more
RAIRO Analyse numériqueSingle step methods for inhomogeneous linear differential equations in Banach space
93 Citations1982Philip Brenner, Michel Crouzeix +1 more
SIAM Journal on Numerical AnalysisStability Properties of Implicit Runge–Kutta Methods
85 Citations1985Reinhard Frank, J. Schneid +1 more
Several classes of implicit Runge–Kutta methods are shown to be $BS$-stable: Gauss, Radau IA and Radau IIA schemes.
ComputingA study of B-convergence of Runge-Kutta methods
61 Citations1986Kevin Burrage, Willem Hundsdorfer +1 more
A criterion is developed which determines whether the order of optimalB-convergence is at least equal to the stage order or one order higher.
BIT Numerical MathematicsOn the stability of semi-implicit methods for ordinary differential equations
54 Citations1982E. Hairer, G. Bader +1 more
Conditions for the parameters of a semi-implicit method imply that the method produces contractive numerical solutions over a large class of nonlinear problems for sufficiently smallh, but the restriction on the stepsize does not depend on the stiffness of the differential equation.
Mathematics of ComputationA general equivalence theorem in the theory of discretization methods
46 Citations1985J. M. Sanz‐Serna, César Palencia
Mathematics of ComputationStepsize restrictions for stability of one-step methods in the numerical solution of initial value problems
43 Citations1985M. N. Spijker
Numerische MathematikAn extension of the Lax-Richtmyer theory
25 Citations1984C. Palencia, J. M. Sanz‐Serna
BIT Numerical MathematicsThe order ofB-convergence of algebraically stable Runge-Kutta methods
22 Citations1987Kevin Burrage, Willem Hundsdorfer
It is shown that for a class of semi-linear problems many high order Runge-Kutta methods have order of optimalB-convergence one higher than the stage order and that such methods have at most classical order 3.
IMA Journal of Numerical AnalysisEquivalence Theorems for Incomplete Spaces: An Appraisal
20 Citations1984C. Palencia, J. M. Sanz‐Serna
Applied Mathematics and ComputationConvergence analysis of one-step schemes in the method of lines
11 Citations1989J. M. Sanz‐Serna, J.G. Verwer
BIT Numerical MathematicsInstability in Runge-Kutta schemes for simulation of oil recovery
2 Citations1984Peter H. Sammon, Peter Forsyth
A rigorous stability analysis for a Buckley-Leverett problem shows that this claim that anm-stage method will increase the real stability boundary bym2 is false, and that previous stabilized IMPES schemes are never more efficient than ordinary IMPES.