Stability of block algorithms with fast level-3 BLAS
From MaRDI portal
Publication:4371803
DOI10.1145/131766.131769zbMath0892.65016OpenAlexW2061397794WikidataQ56998997 ScholiaQ56998997MaRDI QIDQ4371803
Nicholas J. Higham, James W. Demmel
Publication date: 9 February 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1992-18/
numerical stabilityblock algorithmsfast matrix multiplicationiterative refinementLAPACK\(LU\) factorizationlevel-3 BLASbackward error analyses
Related Items
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Fast matrix multiplication is stable, An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices, Stability of block \(LU\) factorization for block tridiagonal block \(H\)-matrices, A scalable parallel factorization of finite element matrices with distributed Schur complements, Stability analysis of block factorization for complex symmetric block tridiagonal matrices, Modified ST algorithms and numerical experiments, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems, Fast linear algebra is stable, Block conjugate gradient algorithms for least squares problems, Fast eigensolver for dense real-symmetric matrices, Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification, Stability of block LU factorization for block tridiagonal matrices
Uses Software
