Invariant imbedding and the method of lines for parallel computers
algorithmasynchronous relaxationinvariant imbeddingmethod of linesNCUBE/ten hypercubeOperation countsparallel computation
Linear boundary value problems for ordinary differential equations (34B05) Boundary value problems for second-order elliptic equations (35J25) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Method of lines for boundary value problems involving PDEs (65N40) Parallel numerical computation (65Y05)
The imbedding method allows the solution of a linear two-point boundary value problem to be expressed in terms of the solution of initial value problems. They can be solved independently over subintervals of the given interval and then combined using stable recursion. This ability to compute in parallel over subintervals makes invariant imbedding an attractive method for parallel computation. The parallel implementation of invariant imbedding can be used in conjunction with the method of lines to solve partial differential equations. The problem of assigning lines to processors to minimize communication delays and the effect of asynchronous relaxation are considered. Each algorithm is implemented and run on the NCUBE/ten hypercube, and timing data, speedup and normalized speedup are given. Operation counts are also given for each algorithm.
- An invariant-imbedding solution of general linear two-point boundary- value problems
- A modified invariant embedding method and its application for solving linear two-point boundary-value problems
- Parallel implementation of BVM methods
- scientific article; zbMATH DE number 4011827
- scientific article; zbMATH DE number 1014742
This page was built for publication: Invariant imbedding and the method of lines for parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124295)
