Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods

DOI10.1080/00207160.2016.1226287zbMath1369.65060OpenAlexW2511777204MaRDI QIDQ4976341

Felicja Okulicka, Alicja Smoktunowicz

Publication date: 28 July 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2016.1226287

zbMATH Keywords

numerical examplecondition numbernumerical stabilityGMRES algorithmsaddle-point problemHouseholder transformationBlock Q-R factorization

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Numerical behaviour of the modified Gram-Schmidt GMRES implementation
• Reorthogonalized block classical Gram-Schmidt
• Iterative refinement techniques for solving block linear systems of equations
• Gram-Schmidt orthogonalization: 100 years and more
• Numerical solution of saddle point problems
• On Solving Block-Structured Indefinite Linear Systems
• A Note on Preconditioning for Indefinite Linear Systems
• Stability of block LU factorization
• On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
• The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
• Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
• Round off error analysis for Gram-Schmidt method and solution of linear least squares problems

This page was built for publication: Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods