Stability of block algorithms with fast level-3 BLAS

DOI10.1145/131766.131769MaRDI QIDQ4371803zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas J. Higham, James 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/

zbMATH Keywords

numerical stabilityfast matrix multiplicationiterative refinementLAPACKblock algorithms\(LU\) factorizationlevel-3 BLASbackward error analyses

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Roundoff error (65G50)

Recommendations

• The block-P\(^{3}\)M algorithm
• scientific article; zbMATH DE number 434526
• Exploiting fast matrix multiplication within the level 3 BLAS
• Block Gram-Schmidt algorithms and their stability properties
• Using Level 3 BLAS in Rotation-Based Algorithms
• On parallel block algorithms for exact triangularizations
• A parallel block implementation of Level-3 BLAS for MIMD vector processors
• Stability of block LU factorization for block tridiagonal matrices
• scientific article; zbMATH DE number 1136274
• Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm

Cited in

(19)

• An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
• Stability of Block LU-Decompositions of Matrices Arising from BVP
• Stability of block LU factorization for block tridiagonal block H-matrices
• Stability of block LU factorization for block tridiagonal matrices
• Fast linear algebra is stable
• Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification
• Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems
• Fast matrix multiplication is stable
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
• Solving block low-rank linear systems by LU factorization is numerically stable
• Stability analysis of block factorization for complex symmetric block tridiagonal matrices
• Generalized elimination method and its applications to matrix factorizations
• Fast eigensolver for dense real-symmetric matrices
• A scalable parallel factorization of finite element matrices with distributed Schur complements.
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
• Goal-oriented and modular stability analysis
• Block conjugate gradient algorithms for least squares problems
• Modified ST algorithms and numerical experiments
• Faster numerical algorithms via exception handling

Describes a project that uses

Uses Software

• Algorithm 694
• Algorithm 679
• BLAS
• LAPACK

This page was built for publication: Stability of block algorithms with fast level-3 BLAS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371803)