Special boundedness properties in numerical initial value problems
initial value problemslinear multistepmethod of linesmonotonicityRunge-Kutta methodsstrong stability preservingtotal-variation diminishingtotal-variation-bounded
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)
This paper is concerned with the analysis of some nonlinear stability properties of discretization methods for the numerical solution of initial value problems (IVPs) for differential systems. The proposed theory allows the authors to deal with standard classes of discretization methods for IVPs such as linear multistep and Runge-Kutta methods in connection with many stability properties studied along the last three decades for different classes of problems such as total-variation diminishing, strong stability preservation and boundedness. The authors consider general IVPs in a vector space \(\mathbf{V}\) with the form (1) \(\dot{u} (t) = F(t, u(t)),\) \( t \geq 0\), \( u(0)= u_0 \in \mathbf{V}\), and discretization methods that can be written as \((2) y_i = \sum_{j=1}^l \sigma_{ij} x_j + \Delta t \; \sum_{j=1}^m \tau_{ij} F( \overline{t}_j, y_j)\), \( i=1, \dots ,m\), where \( x_j \in \mathbf{V}\), \(j=1, \dots ,l\) are the input vectors with the information on the solution in the current step, \( \Delta t\) the step size, \( y_j \simeq u ( \overline{t}_j)\), \(j=1, \dots ,m\) are approximations to the solution at the time levels \( \overline{t}_j\) and \( S = ( \sigma_{ij})\), \( T = ( \tau_{ij})\) real matrices that define the method. As remarked most standard methods can be written in the form (2) with suitable \(S\) and \(T\) matrices. In this setting, assuming that for given \( \tau_0 >0\), the inequality \( \| v + \tau_0 \; F( \overline{t}_j, v) \| \leq \| v \| \) holds for \( j=1, \dots, m\) and and all \( v \in \mathbf{V}\) the authors derive conditions on the step size guaranteeing bounds on the solution of (2) of type \( \| y_i \| \leq \mu_i \max_{j=1, \dots ,l} \| x_j \|\), \((i=1, \dots ,m)\) and \( \| y_i \| \leq \sum_{j=1}^l \mu_{ij} \| x_j \|\), \((i=1, \dots ,m)\) for non negative coefficients \( \mu_i\) and \( \mu_{ij}\) where the functional \( \| \cdot \| \) can be a seminorm or even more general sublinear functionals. Among the most relevant conclusions of the theoretical stability analysis presented here we may mention the following ones: 1) The theory provides a unified framework to deal with a variety of monotonicity results given in the literature for seminorms or convex functionals. 2) In addition this theory goes further by considering also sublinear functionals. 3) Optimal bounds on the step size have been derived at least in general functionals that can be checked more easily. 4) Some proofs of earlier monotonicity results turn out to be surprisingly simple. 5) Finally, the remarks on section 4 on the two step Adams method provide a deep view of many aspects of this theory.
- Stability and boundedness in the numerical solution of initial value problems
- Stepsize restrictions for boundedness and monotonicity of multistep methods
- Stepsize Conditions for Boundedness in Numerical Initial Value Problems
- On monotonicity and boundedness properties of linear multistep methods
- Boundedness and strong stability of Runge-Kutta methods
- Contractivity in the numerical solution of initial value problems
- Efficient implementation of essentially nonoscillatory shock-capturing schemes
- Finite Volume Methods for Hyperbolic Problems
- High order strong stability preserving time discretizations
- High-order linear multistep methods with general monotonicity and boundedness properties
- scientific article; zbMATH DE number 4041188 (Why is no real title available?)
- scientific article; zbMATH DE number 1967777 (Why is no real title available?)
- scientific article; zbMATH DE number 2006091 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 3999169 (Why is no real title available?)
- Monotonicity-Preserving Linear Multistep Methods
- On monotonicity and boundedness properties of linear multistep methods
- On strong stability preserving time discretization methods
- On the Convergence of Numerical Solutions to Ordinary Differential Equations
- Representations of Runge--Kutta Methods and Strong Stability Preserving Methods
- Stepsize Conditions for Boundedness in Numerical Initial Value Problems
- Stepsize Conditions for General Monotonicity in Numerical Initial Value Problems
- Stepsize Restrictions for the Total-Variation-Diminishing Property in General Runge--Kutta Methods
- Strong stability preserving hybrid methods
- Strong stability-preserving high-order time discretization methods
- Exact optimal values of step-size coefficients for boundedness of linear multistep methods
- High-order linear multistep methods with general monotonicity and boundedness properties
- Stepsize Conditions for Boundedness in Numerical Initial Value Problems
- Boundedness and strong stability of Runge-Kutta methods
- On monotonicity and boundedness properties of linear multistep methods
- Stepsize Conditions for General Monotonicity in Numerical Initial Value Problems
- Stepsize restrictions for boundedness and monotonicity of multistep methods
- Numerical precision for differential inclusions with uniqueness
- Comparison of boundedness and monotonicity properties of one-leg and linear multistep methods
- Unconditionally strong stability preserving extensions of the TR-BDF2 method
- Stability and boundedness in the numerical solution of initial value problems
- Efficient Stability-Preserving Numerical Methods for Nonlinear Coercive Problems in Vector Space
This page was built for publication: Special boundedness properties in numerical initial value problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657892)
