Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T07:58:02.125Z Has data issue: false hasContentIssue false
  • English
  • Français

Stable continuous orthonormalisation techniques for linear boundary value problems

Published online by Cambridge University Press:  17 February 2009

P. M. van Loon  and
R. M. M. Mattheij
P. M. van Loon
Affiliation:
Computing Centre, Eindhoven University of Technology, P. O. Box 513, 5600 MB Eindhoven, The Netherlands.
R. M. M. Mattheij
Affiliation:
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

An investigation is made of a hybrid method inspired by Riccati transformations and marching algorithms employing (parts of) orthogonal matrices, both being decoupling algorithms. It is shown that this so-called continuous orthonormalisation is stable and practical as well. Nevertheless, if the problem is stiff and many output points are required the method does not give much gain over, say, multiple shooting.

Type
Research Article
Information
The ANZIAM Journal , Volume 29 , Issue 3 , January 1988 , pp. 282 - 295
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Babuska, I., “The connection between the finite difference like methods and the methods based on initial value problems for ODE”, in Numerical Solutions of Boundary Value Problems for Ordinary Differential Equations (ed. Aziz, A. K.), (Academic Press, New York, 1975).Google Scholar
[2]Coppel, W. A., “Dichotomies in Stability Theory”, Lecture Notes in Mathematics 629 (Springer-Verlag, Berlin, 1978).Google Scholar
[3]Davey, A., “An automatic orthonormalization method for solving stiff BVPs”, J. Comput. Phys. 51 (1983) 343–356.CrossRefGoogle Scholar
[4]Eirola, T., “A study of the Back-and-Forth shooting method”, Ph.D. Thesis, Helsinki University of Technology, Finland, 1985.Google Scholar
[5]Golub, G. H. and van Loan, C. F., Matrix computations (North Oxford Academic, Oxford, 1983).Google Scholar
[6]De Hoog, F. and Mattheij, R. M. M., “On dichotomy and well-conditioning in boundary value problems”, SIAM J. Numer. Anal. 24 (1987) 89–105.CrossRefGoogle Scholar
[7]Keller, H. B. and Lentini, M., “Invariant Imbedding, the Box Scheme and an Equivalence between them”, SIAM J. Numer. Anal. 19 (1982) 942–962.CrossRefGoogle Scholar
[8]Van Loon, P. M., “Riccati transformations: when and how to use?”, in Numerical Boundary Value ODEs (eds. Ascher, U. M. and Russell, R. D.), Progress in Scientific Computing 5 (Birkhäuser, Boston, 1985).Google Scholar
[9]Mattheij, R. M. M., “Decoupling and Stability of Algorithms for Boundary Value Problems”, SIAM Rev. 27 (1985) 1–44.CrossRefGoogle Scholar
[10]Mattheij, R. M. M. and Staarink, G. W. M., “An Efficient Algorithm for solving general linear two point BVP”, SIAM J. Sci. Statist. Comput. 5 (1984) 745–763.CrossRefGoogle Scholar
[11]Meyer, G. H., “Continuous Orthonormalization for Boundary Value Problems”, J. Comput. Phys. 62 (1986) 248–262.CrossRefGoogle Scholar
[12]Osborne, M. R., “The stabilized march is stable”, SIAM J. Numer. Anal. 16 (1979) 923–933.CrossRefGoogle Scholar
[13]Osborne, M. R. and Russell, R. D., “The Riccati Transformation in the Solution of Boundary Value Problems”, Univ of New Mexico Dept. Maths. Rep., Albuquerque, 1985.Google Scholar