An efficient implementation of the block Gram--Schmidt method

DOI10.21914/ANZIAMJ.V54I0.6327MaRDI QIDQ4638435zbMATH OpenOpenAlexFDO

Authors Yoichi Matsuo, Takashi Nodera

Publication date 8 May 2018

Published in ANZIAM Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21914/anziamj.v54i0.6327

zbMATH Keywords

block Gram-Schmidt algorithmoptimal block sizeparallel computing

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25)

Recommendations

• Block Gram-Schmidt algorithms and their stability properties
• Block Modified Gram--Schmidt Algorithms and Their Analysis
• scientific article; zbMATH DE number 2098219
• Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
• Block Gram-Schmidt orthogonalization
• A numerically stable block modified Gram-Schmidt algorithm solving stiff weighted least squares problems
• Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
• Block classical Gram–Schmidt-based block updating in low-rank matrix approximation
• Efficient block implementation of exact sequential least-squares problems
• Modified Gram-Schmidt-based methods for block downdating the Cholesky factorization

Cited in

(6)

• Block Gram-Schmidt downdating
• Numerical analysis of parallel implementation of the reorthogonalized ABS methods
• Rapid error reduction for block Gauss-Seidel based onp-hierarchical basis
• Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
• Block Modified Gram--Schmidt Algorithms and Their Analysis
• Block symplectic Gram-Schmidt method

This page was built for publication: An efficient implementation of the block Gram--Schmidt method

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