Minimizing Communication in Numerical Linear Algebra
From MaRDI portal
Publication:3112398
DOI10.1137/090769156zbMath1246.68128arXiv0905.2485OpenAlexW2104373803MaRDI QIDQ3112398
Grey Ballard, Oded Schwartz, O. V. Holtz, James W. Demmel
Publication date: 16 January 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.2485
lower boundLU factorizationsparse Cholesky factorizationQR factorizationmatrix multiplicationcommunication costlinear algebra algorithmsload and store operations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (29)
L-sweeps: a scalable, parallel preconditioner for the high-frequency Helmholtz equation ⋮ A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic ⋮ Minimizing synchronizations in sparse iterative solvers for distributed supercomputers ⋮ Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ Distributed-memory hierarchical interpolative factorization ⋮ Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing ⋮ Randomized QR with Column Pivoting ⋮ A direct solver for variable coefficient elliptic PDEs discretized via a composite spectral collocation method ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices ⋮ A generalization of \(s\)-step variants of gradient methods ⋮ Simultaneous band reduction of two symmetric matrices ⋮ Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting ⋮ Aligning the representation and reality of computation with asynchronous logic automata ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Algorithm 953 ⋮ Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Towards dense linear algebra for hybrid GPU accelerated manycore systems ⋮ The swept rule for breaking the latency barrier in time advancing PDEs ⋮ The method of polarized traces for the 2D Helmholtz equation ⋮ An Input/Output Efficient Algorithm for Hessenberg Reduction ⋮ A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm ⋮ On the cost of iterative computations ⋮ Numerical algorithms for high-performance computational science ⋮ High-performance statistical computing in the computing environments of the 2020s ⋮ Communication Avoiding ILU0 Preconditioner
Uses Software
This page was built for publication: Minimizing Communication in Numerical Linear Algebra
