The <i>A</i>-Contractive Second-Order Multistep Formulas with Variable Steps (Q3327650)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3860315
Language Label Description Also known as
default for all languages
No label defined
    English
    The <i>A</i>-Contractive Second-Order Multistep Formulas with Variable Steps
    scientific article; zbMATH DE number 3860315

      Statements

      The <i>A</i>-Contractive Second-Order Multistep Formulas with Variable Steps (English)
      0 references
      1983
      0 references
      variable steps
      0 references
      time-varying problems
      0 references
      stiff nonlinear problems
      0 references
      second order multistep methods
      0 references
      second order A-contractive methods
      0 references
      one-leg methods
      0 references
      0 references
      This paper investigates the A-contractivity in the maximum norm of second order multistep methods \[ \sum^{k}_{i=0}a_ ix_{n-i}=(t_ n- t_{n-1})\sum^{k}_{i=0}b_ i\dot x_{n-i} \] with arbitrarily variable steps. The principal result is the derivation of values \(b_ 0,b_ 1,...,b_ k\) to give a unique A-contractive second order method for any choice of non-positive \(a_ 1,a_ 2,...,a_ k\) with \(a_ 0=- \sum^{k}_{i=1}a_ i\). In this complete characterisation of second order A-contractive methods, the extreme cases in which \(a_ i=0\) (\(i\neq 0,i\neq j)\) are simply the trapezoidal rules \(x_ n-x_{n-j}=1/2(t_ n- t_{n-j})(\dot x_ n+\dot x_{n-j}).\) Results concerning contractivity apply not only to linear multistep methods but also to the corresponding one-leg methods and it is the development of stable and accurate algorithms of this type that motivates the work.
      0 references

      Identifiers