The inversion of matrices by the double-bordering algorithm on MIMD computers
From MaRDI portal
(Redirected from Publication:1179259)
For the solution of linear systems a double-bordering algorithm is derived and used for matrix inversion in parallel MIMD machines. The experimental results were obtained on a four processor MIMD machine. These results show the superiority of the new method to the Gauss-Jordan algorithm.
Recommendations
- A recursive doubling algorithm for inverting tridiagonal matrices
- Two new algorithms for computing inverse matrix
- Optimal parallelization of a recursive algorithm for triangular matrix inversion on MIMD computers
- A rapid numerical algorithm to compute matrix inversion
- scientific article; zbMATH DE number 2210575
- scientific article; zbMATH DE number 3965444
- scientific article; zbMATH DE number 4176353
- An algorithm for computing inverses of tridiagonal matrices with applications
- scientific article; zbMATH DE number 4211359
Cited in
(10)- Parallel experience on the inverse matrix computation
- Parallel matrix inversion on a subcube-grid
- A direct method for BBD matrix inversion
- scientific article; zbMATH DE number 4126567 (Why is no real title available?)
- A recursive partitioning algorithm for matrix inversion on parallel computers
- scientific article; zbMATH DE number 2051076 (Why is no real title available?)
- scientific article; zbMATH DE number 786560 (Why is no real title available?)
- Round-off analysis of the wz matrix factorisation method*
- ThewwTfactorization of dense and sparse matrices
- Quadrant interlocking factorization algorithm of hourglass matrix from nonsingular matrix
This page was built for publication: The inversion of matrices by the double-bordering algorithm on MIMD computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179259)