Efficient sixth order methods for nonlinear oscillation problems (Q1117675): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: High order P-stable formulae for the numerical integration of periodic initial value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-accuracy <i>P</i>-stable Methods for <i>y<sup>″</sup></i> = <i>f(t, y)</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Methods for Second-Order Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Multistip Methods for Periodic Initial Value Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of Implicit Formulas for the Solution of ODE<scp>s</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient fourth order P-stable formulae / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01954909 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031223160 / rank
 
Normal rank

Latest revision as of 09:58, 30 July 2024

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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references