Parallel multiple shooting for the solution of initial value problems

Authors:
M. Kiehl
Affiliations:
-
Venue:
Parallel Computing
Year:
1994

Citing 6
Cited 2

Adaptation of a two-point boundary value problem solver to a vector-multiprocessor

SIAM Journal on Scientific and Statistical Computing
Parallel iteration of high-order Runge-Kutta methods with stepsize control

Journal of Computational and Applied Mathematics
On parallel methods for boundary value ODEs

Computing - Special issue on archives for informatics and numerical computation
Iterated Runge-Kutta methods on parallel computers

SIAM Journal on Scientific and Statistical Computing
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Parallel ODE-solvers with stepsize control

Journal of Computational and Applied Mathematics

Parallel implementation of the Kronecker product technique for numerical solution of parabolic partial differential equations

Parallel Computing
Parallelization in time of numerical simulations of fully-developed plasma turbulence using the parareal algorithm

Journal of Computational Physics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computing time for the numerical solution of initial-value problems is closely related to the number of evaluations of the right-hand side. In general this number can only be reduced slightly on parallel computers, even if simultaneous evaluations of right-hand side are counted as one evaluation. For special problems, however, it is possible to construct special methods which show a remarkable speedup 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.