Efficient sixth order methods for nonlinear oscillation problems (Q1117675)

From MaRDI portal
Revision as of 18:33, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q1225722)
scientific article
Language Label Description Also known as
English
Efficient sixth order methods for nonlinear oscillation problems
scientific article

    Statements

    Efficient sixth order methods for nonlinear oscillation problems (English)
    0 references
    0 references
    0 references
    1988
    0 references
    By applying two-step (hybrid) methods to solve initial value problems of the kind (1) \(\ddot x=f(t,x)\), \(x(0)\), \(\dot x(0)\) given with nonlinear f, one has to solve a nonlinear algebraic system at each step. This may be done by a modified Newton iteration scheme. The author derives a class of fourth order, P-stable methods which require only two function evaluation per iteration and one matrix factorization at each step. For a definition of P-stability see \textit{J. D. Lambert} and \textit{I. A. Watson} [J. Inst. Math. Appl. 18, 189-202 (1976; Zbl 0359.65060)]. Furthermore there is propsed an extension to sixth order P-stable methods which require only three function evaluation per iteration. These methods have been implemented on a new variable step, local error controlling code.
    0 references
    two-step (hybrid) methods
    0 references
    Newton iteration
    0 references
    matrix factorization
    0 references
    P- stability
    0 references
    sixth order P-stable methods
    0 references
    variable step, local error controlling code
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references