Numerical solution of 2 × 2 block linear systems by block Gram–Schmidt methods
From MaRDI portal
Publication:4976341
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
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Note on Preconditioning for Indefinite Linear Systems
- Gram-Schmidt orthogonalization: 100 years and more
- Iterative refinement techniques for solving block linear systems of equations
- Modified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Numerical solution of saddle point problems
- On Solving Block-Structured Indefinite Linear Systems
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Reorthogonalized block classical Gram-Schmidt
- Round off error analysis for Gram-Schmidt method and solution of linear least squares problems
- Stability of block LU factorization
- The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
Cited in
(3)
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)