Parallel QR Factorization of Block-Tridiagonal Matrices
From MaRDI portal
Publication:5146680
DOI10.1137/19M1306166zbMath1457.65018OpenAlexW2990529725MaRDI QIDQ5146680
Alfredo Buttari, Costy Kodsi, Søren Hauberg
Publication date: 26 January 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1306166
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of sparse linear least squares problems using Givens rotations
- On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
- Direct Methods for Sparse Matrices
- Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Algorithm 915, SuiteSparseQR
- Direct Methods for Sparse Linear Systems
- The Role of Elimination Trees in Sparse Factorization
- On General Row Merging Schemes for Sparse Givens Transformations
- Algorithmic Aspects of Vertex Elimination on Graphs
- On Stable Parallel Linear System Solvers
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
- Nested Dissection of a Regular Finite Element Mesh
This page was built for publication: Parallel QR Factorization of Block-Tridiagonal Matrices