An algorithm for solving multi-point boundary value problems (Q1082048)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for solving multi-point boundary value problems |
scientific article; zbMATH DE number 3972111
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for solving multi-point boundary value problems |
scientific article; zbMATH DE number 3972111 |
Statements
An algorithm for solving multi-point boundary value problems (English)
0 references
1987
0 references
We describe a method for computing solutions of multi-point boundary value problems, where the polychotomic structure of the underlying solution space is specifically exploited. After the system is integrated in a multiple shooting way, the resulting linear system is solved by a special decoupling algorithm that takes into account the fact that the dichotomy on each interval is potentially different (in contrast to the two point case). A number of examples sustains the theory.
0 references
multiple shooting
0 references
decoupling algorithm
0 references
dichotomy
0 references
polychotomy
0 references
numerical examples
0 references
0.9498463
0 references
0.94405264
0 references
0.94295746
0 references
0.92455614
0 references