Communication lower bounds and optimal algorithms for numerical linear algebra
From MaRDI portal
Recommendations
- Minimizing communication in numerical linear algebra
- Avoiding communication in numerical linear algebra
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Communication-optimal parallel and sequential Cholesky decomposition
- Communication lower bounds for distributed-memory matrix multiplication
Cites work
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- A Deflated Version of the Conjugate Gradient Algorithm
- A framework for symmetric band reduction
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A Newton basis GMRES implementation
- A note on the error analysis of classical Gram-Schmidt
- A performance model for Krylov subspace methods on mesh-based parallel computers
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods
- A Robust Criterion for the Modified Gram--Schmidt Algorithm with Selective Reorthogonalization
- A set of level 3 basic linear algebra subprograms
- A Storage-Efficient WY Representation for Products of Householder Transformations
- A Theorem on Boolean Matrices
- Accuracy of two three-term and three two-term recurrences for Krylov space solvers
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Algorithm 807
- Algorithm 953: Parallel library software for the multishift QR algorithm with aggressive early deflation
- An efficient nonsymmetric Lanczos method on parallel vector computers
- An extended set of FORTRAN basic linear algebra subprograms
- An inequality related to the isoperimetric inequality
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- An updated set of basic linear algebra subprograms (BLAS)
- Analysis of Pairwise Pivoting in Gaussian Elimination
- Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
- Average-Case Stability of Gaussian Elimination
- Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods
- Basic Linear Algebra Subprograms for Fortran Usage
- Block Gram-Schmidt orthogonalization
- Bulk-synchronous parallel Gaussian elimination
- Cache efficient bidiagonalization using BLAS 2.5 operators
- Cache optimization for structured and unstructured grid multigrid
- CALU: A communication optimal LU factorization algorithm
- Communication avoiding rank revealing QR factorization with column pivoting
- Communication complexity of PRAMs
- Communication efficient matrix multiplication on hypercubes
- Communication lower bounds for distributed-memory matrix multiplication
- Communication-optimal parallel and sequential Cholesky decomposition
- Communication-optimal parallel and sequential QR and LU factorizations
- Complexity Bounds for Regular Finite Difference and Finite Element Grids
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient out-of-core algorithms for linear relaxation using blocking covers
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Evaluating non-square sparse bilinear forms on multiple vector pairs in the I/O-model
- Extending the Hong-Kung model to memory hierarchies
- Fast algorithms for hierarchically semiseparable matrices
- Fast linear algebra is stable
- Fast matrix multiplication is stable
- Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities
- Gaussian elimination is not optimal
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Graph expansion analysis for communication costs of fast rectangular matrix multiplication
- Graph expansion and communication costs of fast matrix multiplication
- scientific article; zbMATH DE number 1696521 (Why is no real title available?)
- scientific article; zbMATH DE number 6691438 (Why is no real title available?)
- scientific article; zbMATH DE number 434530 (Why is no real title available?)
- scientific article; zbMATH DE number 3114657 (Why is no real title available?)
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- scientific article; zbMATH DE number 53686 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1069613 (Why is no real title available?)
- scientific article; zbMATH DE number 2090652 (Why is no real title available?)
- scientific article; zbMATH DE number 780780 (Why is no real title available?)
- scientific article; zbMATH DE number 5937963 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Locality of Reference in LU Decomposition with Partial Pivoting
- Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Memory-efficient matrix multiplication in the BSP model
- Methods of conjugate gradients for solving linear systems
- Minimizing communication in numerical linear algebra
- Modification of the Householder Method Based on the Compact WY Representation
- Multiplying matrices faster than coppersmith-winograd
- Nested Dissection of a Regular Finite Element Mesh
- Newton interpolation at Leja points
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- On the generation of Krylov subspace bases
- On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
- On the reduction of a symmetric matrix to tridiagonal form
- Optimal sparse matrix dense vector multiplication in the I/O-model
- Parallel iterative methods for sparse linear systems
- Parallel iterative S-step methods for unsymmetric linear systems
- Parallel Matrix and Graph Algorithms
- Parallel out-of-core computation and updating of the QR factorization
- Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Partitioned triangular tridiagonalization
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds
- Reliable updated residuals in hybrid Bi-CG methods
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
- s-step iterative methods for symmetric linear systems
- ScaLAPACK Users' Guide
- Size bounds for superconcentrators
- Size-estimation framework with applications to transitive closure and reachability
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
- Templates for the Solution of Algebraic Eigenvalue Problems
- Tensor Decompositions and Applications
- The analysis of a nested dissection algorithm
- The cache complexity of multithreaded cache oblivious algorithms
- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
- The Lanczos and Conjugate Gradient Algorithms
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
- The multishift QR algorithm. II: Aggressive early deflation
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The University of Florida sparse matrix collection
- The WY Representation for Products of Householder Matrices
- Tight bounds for low dimensional star stencils in the external memory model
- When cache blocking of sparse matrix vector multiply works and why
Cited in
(29)- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
- Energy aware performance study for a class of computationally intensive Monte Carlo algorithms
- Block Gram-Schmidt algorithms and their stability properties
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- GMRES algorithms over 35 years
- How bad are Vandermonde matrices?
- Parallel matrix multiplication: a systematic journey
- Minimizing communication in numerical linear algebra
- scientific article; zbMATH DE number 1760022 (Why is no real title available?)
- Fast matrix multiplication and its algebraic neighbourhood
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- A robust and efficient implementation of LOBPCG
- Parallel Algorithms for Tensor Train Arithmetic
- Performance of the low-rank TT-SVD for large dense tensors on modern multicore CPUs
- Predict-and-Recompute Conjugate Gradient Variants
- Communication lower bounds of bilinear algorithms for symmetric tensor contractions
- Communication-optimal parallel and sequential Cholesky decomposition
- Avoiding communication in numerical linear algebra
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Graph expansion and communication costs of fast matrix multiplication
- Limited‐memory polynomial methods for large‐scale matrix functions
- Analytical modeling of matrix–vector multiplication on multicore processors
- Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
- A numerically stable communication-avoiding s-step GMRES algorithm
- On the loss of orthogonality in low-synchronization variants of reorthogonalized block classical Gram-Schmidt
- Reorthogonalized Pythagorean variants of block classical Gram-Schmidt
- High-performance statistical computing (HPSC): challenges, opportunities, and future directions
Describes a project that uses
Uses Software
This page was built for publication: Communication lower bounds and optimal algorithms for numerical linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683913)
