TY - JOUR
T1 - Exact optimal values of step-size coefficients for boundedness of linear multistep methods
AU - Loczi, Lajos
N1 - KAUST Repository Item: Exported on 2022-06-03
Acknowledgements: This work was supported by the King Abdullah University of Science and Technology (KAUST), 4700 Thuwal, 23955-6900, Saudi Arabia. The author was also supported by the Department of Numerical Analysis, Eotvos Lorand University (ELTE), and the Department of Differential Equations, Budapest University of Technology and Economics (BME), Hungary.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2017/6/7
Y1 - 2017/6/7
N2 - 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). An 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 positive 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 1 ≤ k ≤ 6 steps) and in the Adams–Bashforth family (with 1 ≤ k ≤ 3 steps).
AB - 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). An 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 positive 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 1 ≤ k ≤ 6 steps) and in the Adams–Bashforth family (with 1 ≤ k ≤ 3 steps).
UR - http://hdl.handle.net/10754/678533
UR - http://link.springer.com/10.1007/s11075-017-0354-5
UR - http://www.scopus.com/inward/record.url?scp=85020278935&partnerID=8YFLogxK
U2 - 10.1007/s11075-017-0354-5
DO - 10.1007/s11075-017-0354-5
M3 - Article
SN - 1572-9265
VL - 77
SP - 1093
EP - 1116
JO - Numerical Algorithms
JF - Numerical Algorithms
IS - 4
ER -