Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
DOI10.1080/00207160.2016.1226287zbMATH Open1369.65060OpenAlexW2511777204MaRDI QIDQ4976341FDOQ4976341
Authors: 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
Recommendations
- An efficient implementation of the block Gram--Schmidt method
- Solving linear equations over GF(2): Block Lanczos algorithm
- A new iterative method for solving a class of two-by-two block complex linear systems
- A block alternating splitting iteration method for a class of block two-by-two complex linear systems
- Block Gram-Schmidt algorithms and their stability properties
- A numerical algorithm on solving block tridiagonal linear systems
- scientific article; zbMATH DE number 1735430
- A new preconditioner for a class of \(2\times 2\) block linear systems
- Block preconditioners for complex symmetric linear system with two-by-two block form
- The block Lanczos method for linear systems with multiple right-hand sides
condition numbernumerical examplenumerical stabilityHouseholder transformationsaddle-point problemGMRES algorithmBlock Q-R factorization
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Title not available (Why is that?)
- Numerical solution of saddle point problems
- On Solving Block-Structured Indefinite Linear Systems
- A Note on Preconditioning for Indefinite Linear Systems
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
- Stability of block LU factorization
- Gram-Schmidt orthogonalization: 100 years and more
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Reorthogonalized block classical Gram-Schmidt
- The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
- Iterative refinement techniques for solving block linear systems of equations
Cited In (3)
Uses Software
This page was built for publication: Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976341)
