An efficient algorithm for solving general linear two-point BVP

R.M.M. Mattheij, G.W.M. Staarink

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Downloads (Pure)


    A new method is described to compute the solutions of linear BVP in an efficient and stable way. The stability is achieved by decoupling the multiple shooting recursion; this means that the choice of output points can be made virtually without regard to restrictions. By fixing the number of integration steps per "shooting" interval and assembling as many of them as is needed to fit the user’s requirements, high efficiency is gained. Apart from a mathematical description, we also give a stability analysis of the method. A large number of numerical examples confirm this analysis and illustrate the possibilities of the algorithm.
    Original languageEnglish
    Pages (from-to)745-763
    JournalSIAM Journal on Scientific and Statistical Computing
    Issue number4
    Publication statusPublished - 1984


    Dive into the research topics of 'An efficient algorithm for solving general linear two-point BVP'. Together they form a unique fingerprint.

    Cite this