Name
Abstract | ||
|---|---|---|
Finite difference methods for nonlinear boundary value problems (BVP's) in ordinary differential equations involve solving systems of linear equations at an inner iteration. In the typical case of separated boundary conditions, these systems are almost block diagonal (ABD). A new 'tearing' algorithm for the parallel solution of those ABD's is presented here. It is an extension of one proposed by Dongarra and Johnsson [7] for positive definite or strictly diagonally dominant banded systems and it is similar to one proposed by Wright [15] for banded systems. We compare the cost of the new algorithm with costs of other algorithms which might be applied to ABD's. We simulate the use of the algorithm in solving BVP's. The new algorithms is not designed for a specific computer architecture and it is believed that the analysis is sufficiently general to be indicative of performance for most current parallel architectures. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/S0167-8191(05)80101-2 | PARALLEL COMPUTING |
Keywords | Field | DocType |
LINEAR ALGEBRA,ALMOST BLOCK DIAGONAL LINEAR SYSTEMS,NEW TEARING ALGORITHM,COMPARISON WITH OTHER ALGORITHMS,COMPLEXITY ANALYSIS,SIMULATION RESULTS | Applied mathematics,Linear algebra,Boundary value problem,Ordinary differential equation,System of linear equations,Parallel computing,Diagonally dominant matrix,Algorithm,Finite difference method,Mathematics,Block matrix,Newton's method | Journal |
Volume | Issue | ISSN |
17 | 2-3 | 0167-8191 |
Citations | PageRank | References |
6 | 2.61 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcin Paprzyck | 1 | 6 | 2.61 |
| Ian Gladwell | 2 | 66 | 12.63 |