Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
From MaRDI portal
Publication:4637194
DOI10.1007/978-3-319-49631-3_4zbMath1443.65032OpenAlexW2744381675MaRDI QIDQ4637194
Publication date: 18 April 2018
Published in: Computational Mathematics, Numerical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49631-3_4
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- s-step iterative methods for symmetric linear systems
- The block conjugate gradient algorithm and related methods
- A theory of pseudoskeleton approximations
- On the existence and computation of rank-revealing LU factorizations
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Strong rank revealing LU factorizations
- Communication lower bounds for distributed-memory matrix multiplication
- A parallel GMRES version for general sparse matrices
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Numerical methods for solving linear least squares problems
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
- LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Numerical Methods for Large Eigenvalue Problems
- Minimizing Communication in Numerical Linear Algebra
- Randomized Algorithms for Matrices and Data
- Cache-Oblivious Algorithms
- CALU: A Communication Optimal LU Factorization Algorithm
- Solution of Simultaneous Linear Equations using a Magnetic-Tape Store
- Analysis of Pairwise Pivoting in Gaussian Elimination
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- Average-Case Stability of Gaussian Elimination
- New Fast and Accurate Jacobi SVD Algorithm. I
- New Fast and Accurate Jacobi SVD Algorithm. II
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- LAPACK Users' Guide
- Error Analysis of Direct Methods of Matrix Inversion
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Some Applications of the Rank Revealing QR Factorization
- ScaLAPACK Users' Guide
- Locality of Reference in LU Decomposition with Partial Pivoting
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- Large Growth Factors in Gaussian Elimination with Pivoting
- Accuracy and Stability of Numerical Algorithms
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- A Basis-Kernel Representation of Orthogonal Matrices
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
- Graph expansion and communication costs of fast matrix multiplication
- The least squares problem and pseudo-inverses
- Numerical Linear Algebra
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
