A decoupled direct method for the solution of ordinary boundary value problems (Q1312684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Difference Methods and Deferred Corrections for Ordinary Boundary Value Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locally parameterized continuation process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the behaviour of a thin sheet of moving liquid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution of a differential equation in fluid mechanics / rank
 
Normal rank

Latest revision as of 11:49, 22 May 2024

scientific article
Language Label Description Also known as
English
A decoupled direct method for the solution of ordinary boundary value problems
scientific article

    Statements

    A decoupled direct method for the solution of ordinary boundary value problems (English)
    0 references
    7 February 1994
    0 references
    The problem of numerical resolution of a general nonlinear two point boundary value problem for ordinary differential equations is considered. The author proposes to apply the so-called shooting method, coupled with Newton's algorithm for resolution of the resulting nonlinear, nondifferential system of equations. The shooting method when applied the Newton's process consists in an iterative resolution of a sequence of initial value problems for an extended system composed by the original equation and an auxiliary system -- its derivative. This auxiliary system is needed in order to compute the Jacobi matrix of the resulting nonlinear, nondifferential system of equations (to be solved by Newton's process). The number of equations in the auxiliary system is in general much greater than this of the original system. The author observes that a great precision while computing the Jacobi matrix for the Newton process is not so important as in computing the solution of the original system: it may influence the order of the iterative process and not the precision of the final result. This observation leads to the following proposition concerning the implementation of the algorithm: -- apply the semiimplicit three-level Runge-Kutta method (strongly \(A\)- stable!) for integration of the original equation; -- apply the two level implicit Runge-Kutta method (less expensive!) for integration of the auxiliary system. The paper contains numerical examples and a discussion comparing the proposed algorithm with the finite difference method.
    0 references
    nonlinear two point boundary value problem
    0 references
    shooting method
    0 references
    Newton's algorithm
    0 references
    semiimplicit three-level Runge-Kutta method
    0 references
    numerical examples
    0 references
    finite difference method
    0 references

    Identifiers