Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm

DOI10.1137/0912056zbMath0734.65034OpenAlexW2045635967MaRDI QIDQ3361802

No author found.

Publication date: 1991

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0912056

zbMATH Keywords

performanceerror analysisnumerical stabilityblock algorithmssupercomputersreorthonormalizationALLIANT FX80block Gram-Schmidt orthogonalizationCRAY1

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Orthogonalization in numerical linear algebra (65F25)

Related Items (11)

Rank-\(k\) modification methods for recursive least squares problems ⋮ Unnamed Item ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ Reorthogonalized block classical Gram-Schmidt ⋮ Varying the \(s\) in your \(s\)-step GMRES ⋮ Rounding error analysis of the classical Gram-Schmidt orthogonalization process ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ The Stability of Block Variants of Classical Gram--Schmidt ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Block Modified Gram--Schmidt Algorithms and Their Analysis ⋮ Numerics of Gram-Schmidt orthogonalization

This page was built for publication: Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm