Parallel computation of entries of A^-1

DOI10.1137/120902616MaRDI QIDQ5254698zbMATH OpenOpenAlexFDO

Authors François-Henry Rouet, Iain S. Duff, Patrick R. Amestoy, Jean-Yves L'Excellent

Publication date 10 June 2015

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

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

zbMATH Keywords

computational efficiencydirect methods for linear system and matrix inversionparallel algorithmssparse matrices

Mathematics Subject Classification ID

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

Recommendations

• On computing inverse entries of a sparse matrix in an out-of-core environment
• Optimal Parallel Solution of Sparse Triangular Systems
• A note on parallel matrix inversion
• Parallel inverse arrowhead matrix algorithms on symmetric multiprocessor systems
• High performance inverse preconditioning

Cites work

• A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• A probing method for computing the diagonal of a matrix inverse.
• Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• On computing inverse entries of a sparse matrix in an out-of-core environment
• Task scheduling for parallel sparse Cholesky factorization

Cited in

(13)

• Parallel computation of a Krylov matrix for a sparse and structured input
• An efficient high-order multiscale finite element method for frequency-domain elastic wave modeling
• Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
• Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
• A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
• On computing inverse entries of a sparse matrix in an out-of-core environment
• \texttt{Pselinv} -- a distributed memory parallel algorithm for selected inversion, the symmetric case
• Efficient Covariance Approximations for Large Sparse Precision Matrices
• scientific article; zbMATH DE number 5627530 (Why is no real title available?)
• On exploiting sparsity of multiple right-hand sides in sparse direct solvers
• A survey of direct methods for sparse linear systems
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
• Combinatorial and recurrent approaches for efficient matrix inversion: sub-cubic algorithms leveraging fast matrix products

Describes a project that uses

Uses Software

• MUMPS

This page was built for publication: Parallel computation of entries of \({A}^{-1}\)

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