Parallel multiple shooting for the solution of initial value problems:

Abstract: "The computing time for the numerical solution of initial-value problems y'(x) = f(x, Y), y(x₀) = y₀, is closely related to the number of evaluations of f. In general this number can only be reduced slightly on parallel computers, even if simultaneous evaluations of f are counted...

Full description

Saved in:
Bibliographic Details
Main Author: Kiehl, Martin (Author)
Format: Book
Language:English
Published: München 1993
Series:Technische Universität <München>: TUM-MATH 9309
Subjects:
Summary:Abstract: "The computing time for the numerical solution of initial-value problems y'(x) = f(x, Y), y(x₀) = y₀, is closely related to the number of evaluations of f. In general this number can only be reduced slightly on parallel computers, even if simultaneous evaluations of f are counted as one evaluation. For special problems, however, it is possible to construct special methods which show a remarkable speed-up close to 100 on parallel computers. Multiple shooting, a method for boundary-value problems with an inherent parallelism, can also be applied efficiently to linear initial-value problems and to non-linear initial- value problems if good approximations are available."
Physical Description:20 S. graph. Darst.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!