CALU: A Communication Optimal LU Factorization Algorithm
From MaRDI portal
Publication:3225540
DOI10.1137/100788926zbMath1242.65089OpenAlexW2163688235MaRDI QIDQ3225540
Laura Grigori, Hua Xiang, James W. Demmel
Publication date: 21 March 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100788926
numerical examplesparallel computationrandom matricesnumerical stabilityLU factorizationcommunication optimal algorithmtournament pivoting scheme
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (10)
A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic ⋮ Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions ⋮ A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers ⋮ Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Linear algebra software for large-scale accelerated multicore computing ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ CALU ⋮ Numerical algorithms for high-performance computational science ⋮ Communication Avoiding ILU0 Preconditioner
Uses Software
This page was built for publication: CALU: A Communication Optimal LU Factorization Algorithm
