Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
From MaRDI portal
Publication:2855667
DOI10.1137/110846427zbMath1362.65031OpenAlexW2118341515MaRDI QIDQ2855667
Publication date: 28 October 2013
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110846427
sparse linear systemsmultifrontal methodmulticore processors\(QR\) factorizationasynchronous parallelism
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)
Related Items
A regularized interior-point method for constrained linear least squares ⋮ SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Numerical recovery strategies for parallel resilient Krylov linear solvers ⋮ Experiments with sparse Cholesky using a sequential task-flow implementation ⋮ Parallel QR Factorization of Block-Tridiagonal Matrices ⋮ Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations ⋮ A survey of direct methods for sparse linear systems ⋮ Discrete least-squares finite element methods ⋮ Extensions of the Augmented Block Cimmino Method to the Solution of Full Rank Rectangular Systems ⋮ A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling ⋮ Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems ⋮ Hierarchical Orthogonal Factorization: Sparse Square Matrices
Uses Software
