Parallel Computation of Entries of ${A}^{-1}$
From MaRDI portal
Publication:5254698
DOI10.1137/120902616zbMath1318.65015MaRDI QIDQ5254698
François-Henry Rouet, Jean-Yves L'Excellent, Iain S. Duff, Patrick R. Amestoy
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
sparse matrices; parallel algorithms; computational efficiency; direct methods for linear system and matrix inversion
65F50: Computational methods for sparse matrices
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers, A survey of direct methods for sparse linear systems, 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, Efficient Covariance Approximations for Large Sparse Precision Matrices
Uses Software
Cites Work
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Task scheduling for parallel sparse Cholesky factorization
- Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
- A probing method for computing the diagonal of a matrix inverse
