Hypercube implementations of parallel shooting

DOI10.1016/0096-3003(89)90140-9MaRDI QIDQ1119354zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1989

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(89)90140-9

zbMATH Keywords

column decompositiondomain decompositionefficiencyhypercubeparallel shooting methodsseparated boundary conditions

Mathematics Subject Classification ID

Linear boundary value problems for ordinary differential equations (34B05) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Parallel numerical computation (65Y05)

Review text

This paper is concerned with parallel shooting methods for the numerical solution of linear two-point boundary value problems with separated boundary conditions upon a hypercube. By a hypercube the authors mean a distributed memory computer with communication between processors by message passing via a communication network having the topology of an n- dimensional cube, where the vertices are considered as processors and the edges as communication links. In this context, the aim of the authors is to present two strategies to associate the tasks onto the processors of a hypercube. In the first technique referred to as the domain decomposition each processor has the responsibility for the computations associated to one subinterval between two consecutive shooting points. In the second technique, called the column decomposition, each processor is assigned the computations corresponding to certain columns of the fundamental matrices associated with each shooting interval. Finally under some assumptions the efficiency of the two strategies is compared in terms of several parameters. However, due to the large number of assumptions and the fact that some of them can be easily violated in practice, the conclusions are not clearly applicable.

Recommendations

• Publication:4729261
• Solution of Linear Systems of Ordinary Differential Equations on an INTEL Hypercube
• A parallel version of the cyclic reduction algorithm on a hypercube
• Hypercube Algorithms and Implementations
• Parallel solution of almost block diagonal systems on a hypercube

Cites work

• Accurate Difference Methods for Linear Ordinary Differential Systems Subject to Linear Constraints
• Alternate Row and Column Elimination for Solving Certain Linear Systems
• An Efficient Algorithm for Solving General Linear Two-Point BVP
• Collocation Software for Boundary-Value ODEs
• FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination
• scientific article; zbMATH DE number 41473 (Why is no real title available?)
• scientific article; zbMATH DE number 193145 (Why is no real title available?)
• scientific article; zbMATH DE number 3274421 (Why is no real title available?)
• Hypercube Algorithms and Implementations
• On solving almost block diagonal (staircase) linear systems
• On the Solution of Block-Tridiagonal Systems Arising from Certain Finite-Difference Equations

Cited in

(4)

• Parallel computation of two-point boundary-value problems via particular solutions
• A multilevel Schwarz shooting method for the solution of the Poisson equation in two dimensional incompressible flow simulations
• Performance of parallel shooting method for closed loop guidance of an optimal launch vehicle trajectory
• scientific article; zbMATH DE number 4113885 (Why is no real title available?)

Describes a project that uses

Uses Software

• COLSYS
• COLROW
• ARCELO

This page was built for publication: Hypercube implementations of parallel shooting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119354)