An efficient algorithm for solving general linear two-point BVP

R.M.M. Mattheij; G.W.M. Staarink

doi:10.1137/0905053

An efficient algorithm for solving general linear two-point BVP

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

Research output: Contribution to journal › Article › Academic › peer-review

1 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	745-763
Journal	SIAM Journal on Scientific and Statistical Computing
Volume	5
Issue number	4
DOIs	https://doi.org/10.1137/0905053
Publication status	Published - 1984

Access to Document

10.1137/0905053

Cite this

@article{66246786957b459e946fa7f673638f07,

title = "An efficient algorithm for solving general linear two-point BVP",

abstract = "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{\textquoteright}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.",

author = "R.M.M. Mattheij and G.W.M. Staarink",

year = "1984",

doi = "10.1137/0905053",

language = "English",

volume = "5",

pages = "745--763",

journal = "SIAM Journal on Scientific and Statistical Computing",

issn = "0196-5204",

number = "4",

}

TY - JOUR

T1 - An efficient algorithm for solving general linear two-point BVP

AU - Mattheij, R.M.M.

AU - Staarink, G.W.M.

PY - 1984

Y1 - 1984

N2 - 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.

AB - 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.

U2 - 10.1137/0905053

DO - 10.1137/0905053

M3 - Article

VL - 5

SP - 745

EP - 763

JO - SIAM Journal on Scientific and Statistical Computing

JF - SIAM Journal on Scientific and Statistical Computing

SN - 0196-5204

IS - 4

ER -