Stability and boundedness in the numerical solution of initial value problems

@article{Spijker2017StabilityAB,
  title={Stability and boundedness in the numerical solution of initial value problems},
  author={Marc Nico Spijker},
  journal={Math. Comput.},
  year={2017},
  volume={86},
  pages={2777-2798}
}
Abstract. This paper concerns the theoretical analysis of step-by-step meth-ods for solving initial value problems in ordinary and partial differential equa-tions.The main theorem of the paper answers a natural question arising in thelinear stability analysis of such methods. It guarantees a (strong) version ofnumerical stability—under a stepsize restriction related to the stability regionof the numerical method and to a circle condition on the differential equation.The theorem also settles an… 
1 Citations
Optimal subsets in the stability regions of multistep methods
TLDR
This work describes a simple procedure to exactly calculate the stability angle α in the definition of A ( α )-stability by representing the root locus curve of the multistep method as an implicit algebraic curve, and demonstrates how some Schur–Cohn-type theorems of recursive nature and not relying on the root Locus curve method can be used to exactly solve some optimization problems within infinite parametric families ofMultistep methods.

References

SHOWING 1-10 OF 47 REFERENCES
Linear stability analysis in the numerical solution of initial value problems
This article addresses the general problem of establishing upper bounds for the norms of the nth powers of square matrices. The focus is on upper bounds that grow only moderately (or stay constant)
Analysis of Error Growth Via Stability Regions in Numerical Initial Value Problems
This paper concerns the stability analysis of numerical methods for solving time dependent ordinary and partial differential equations. In the literature stability estimates for such methods were
Special boundedness properties in numerical initial value problems
For Runge-Kutta methods, linear multistep methods and other classes of general linear methods much attention has been paid in the literature to important nonlinear stability properties known as
Monotonicity and boundedness in implicit Runge-Kutta methods
TLDR
This paper provides necessary conditions for monotonicity and boundedness of a method by using the important concept of algebraic stability and will also be related to the concept of contractivity (B-stability) and to a weakened version ofcontractivity.
Contractivity in the numerical solution of initial value problems
SummaryConsider a linear autonomous system of ordinary differential equations with the property that the norm |U(t)| of each solutionU(t) satisfies |U(t)|≦|U(0)| (t≧0). We call a numerical process
Stepsize restrictions for stability of one-step methods in the numerical solution of initial value problems
This paper deals with the analysis of general one-step methods for the numerical solution of initial (-boundary) value problems for stiff ordinary and partial differential equations. Restrictions on
Stability of the method of lines
SummaryIt is well known that a necessary condition for the Lax-stability of the method of lines is that the eigenvalues of the spatial discretization operator, scaled by the time stepk, lie within a
On Strong Stability Preserving Time Discretization Methods
TLDR
Monotonicity issues for arbitrary norms and linear and nonlinear problems are considered and some known results are related with the ones obtained in the SSP context.
...
...