A note on parallel matrix inversion

DOI10.1137/S1064827598345679MaRDI QIDQ2706467zbMATH OpenOpenAlexFDO

Authors Enrique S. Quintana, Gregorio Quintana, Xiaobai Sun, Robert A. van de Geijn

Publication date 19 March 2001

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1064827598345679

zbMATH Keywords

algorithmsGauss-Jordan eliminationmatrix inversionparallel computationsperformance

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Review text

Parallel inversion algorithms, based on Gauss-Jordan elimination, for general and symmetric positive definite \((n\times n)\) matrices are presented. Additionally parallel implementation issues are discussed. These algorithms maintain the same arithmetic cost and numerical properties of conventional inversion algorithms. The performance of the parallel Gauss-Jordan elimination inversion algorithm for general matrices and of the one-sweep inversion algorithm for symmetric positive definite matrices is presented, for distributed memory parallel computers, such as Cray T3E-600 and a Beowulf cluster.

Recommendations

• Parallel experience on the inverse matrix computation
• A recursive partitioning algorithm for matrix inversion on parallel computers
• The role of arithmetic in fast parallel matrix inversion
• scientific article; zbMATH DE number 3956317
• scientific article; zbMATH DE number 2051076
• scientific article; zbMATH DE number 3965444
• Parallel matrix inversion on a subcube-grid
• Fast parallel algorithms for matrix inversion and linear systems solution

Cited in

(23)

• Parallel experience on the inverse matrix computation
• An improved parallel algorithm for computing the generalized inverse A^ +
• Parallel matrix inversion on a subcube-grid
• A parallel adaptive Gauss-Jordan algorithm
• Solving matrix equations on multi-core and many-core architectures
• Tensorized multi-view subspace representation learning
• A new class of decomposition for inverting asymmetric and indefinite matrices
• Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function
• Solving stable Sylvester equations via rational iterative schemes
• Partial stabilization of descriptor systems using spectral projectors
• Towards an efficient tile matrix inversion of symmetric positive definite matrices on multicore architectures
• \texttt{Pselinv} -- a distributed memory parallel algorithm for selected inversion, the symmetric case
• scientific article; zbMATH DE number 4178633 (Why is no real title available?)
• Parallel Exact and Approximate Arrow-Type Inverses on Symmetric Multiprocessor Systems
• scientific article; zbMATH DE number 139846 (Why is no real title available?)
• scientific article; zbMATH DE number 1305042 (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?)
• Parallel computation of entries of \({A}^{-1}\)
• Householder QR factorization with randomization for column pivoting (HQRRP)
• The role of arithmetic in fast parallel matrix inversion
• Hybrid Ikebe-Newton's iteration for inverting general nonsingular Hessenberg matrices
• An iterative block matrix inversion (IBMI) algorithm for symmetric positive definite matrices with applications to covariance matrices

This page was built for publication: A note on parallel matrix inversion

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