Block Gram–Schmidt Orthogonalization

DOI10.1137/070682563zbMath1185.65069OpenAlexW2014724759MaRDI QIDQ5189691

G. W. Stewart

Publication date: 10 March 2010

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

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

zbMATH Keywords

numerical examplesorthogonalizationQR factorizationGram-Schmidt algorithmblocked algorithm

Mathematics Subject Classification ID

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

Related Items (11)

GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ Reorthogonalized block classical Gram-Schmidt ⋮ Block conjugate gradient algorithms for least squares problems ⋮ Block classical Gram–Schmidt-based block updating in low-rank matrix approximation ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations ⋮ Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction ⋮ Block Modified Gram--Schmidt Algorithms and Their Analysis

Uses Software

• BLAS

This page was built for publication: Block Gram–Schmidt Orthogonalization