Exact optimal values of step-size coefficients for boundedness of linear multistep methods
From MaRDI portal
(Redirected from Publication:1744041)
Abstract: Linear multistep methods (LMMs) applied to approximate the solution of initial value problems---typically arising from method-of-lines semidiscretizations of partial differential equations---are often required to have certain monotonicity or boundedness properties (e.g. strong-stability-preserving, total-variation-diminishing or total-variation-boundedness properties). These properties can be guaranteed by imposing step-size restrictions on the methods. To qualitatively describe the step-size restrictions, one introduces the concept of step-size coefficient for monotonicity (SCM, also referred to as the strong-stability-preserving (SSP) coefficient) or its generalization, the step-size coefficient for boundedness (SCB). A LMM with larger SCM or SCB is more efficient, and the computation of the maximum SCM for a particular LMM is now straightforward. However, it is more challenging to decide whether a positive SCB exists, or determine if a given positive number is a SCB. Theorems involving sign conditions on certain linear recursions associated to the LMM have been proposed in the literature that allow us to answer the above questions: the difficulty with these theorems is that there are in general infinitely many sign conditions to be verified. In this work we present methods to rigorously check the sign conditions. As an illustration, we confirm some recent numerical investigations concerning the existence of SCBs in the BDF and in the extrapolated BDF (EBDF) families. As a stronger result, we determine the optimal values of the SCBs as exact algebraic numbers in the BDF family (with steps) and in the Adams--Bashforth family (with steps).
Recommendations
- The existence of stepsize-coefficients for boundedness of linear multistep methods
- Stepsize restrictions for boundedness and monotonicity of multistep methods
- On monotonicity and boundedness properties of linear multistep methods
- Special boundedness properties in numerical initial value problems
- Stepsize Conditions for Boundedness in Numerical Initial Value Problems
Cites work
- scientific article; zbMATH DE number 5688205 (Why is no real title available?)
- Absolute monotonicity of rational functions occurring in the numerical solution of initial value problems
- Boundedness and strong stability of Runge-Kutta methods
- Decision problems for linear recurrence sequences
- High-order linear multistep methods with general monotonicity and boundedness properties
- Monotonicity-Preserving Linear Multistep Methods
- On monotonicity and boundedness properties of linear multistep methods
- On the positivity problem for simple linear recurrence sequences
- One-sided power sum and cosine inequalities
- Positivity problems for low-order linear recurrence sequences
- Rational functions with maximal radius of absolute monotonicity
- Solving ordinary differential equations. II: Stiff and differential-algebraic problems.
- Special boundedness properties in numerical initial value problems
- Stepsize restrictions for boundedness and monotonicity of multistep methods
- The existence of stepsize-coefficients for boundedness of linear multistep methods
- Ultimate positivity is decidable for simple linear recurrence sequences
Cited in
(7)- scientific article; zbMATH DE number 4039165 (Why is no real title available?)
- The existence of stepsize-coefficients for boundedness of linear multistep methods
- scientific article; zbMATH DE number 409754 (Why is no real title available?)
- Optimal subsets in the stability regions of multistep methods
- Stepsize Conditions for Boundedness in Numerical Initial Value Problems
- Numerical aspects of the coefficient computation for LMMs
- scientific article; zbMATH DE number 4109995 (Why is no real title available?)
This page was built for publication: Exact optimal values of step-size coefficients for boundedness of linear multistep methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744041)