𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Parallel Matrix Inversion on Interconnection Networks

✍ Scribed by Andreas Schikarski; Dorothea Wagner

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
273 KB
Volume
34
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient implementation of the finit
An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm
✍ Umesh D. Navsariwala; Stephen D. Gedney πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges

Solving elliptic boundary-value problems
Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
✍ Elias A. Lipitakis πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 836 KB

Approximate inverse matrix semi-direct methods for solving numerically linear systems on parallel processors are presented. The derived first and second order iterative methods possessing a high level of parallelism are based on the multiple explicit Jacobi iteration and originated by the approximat