Block conjugate gradient algorithms for least squares problems
From MaRDI portal
Recommendations
- Retooling the method of block conjugate gradients
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems
Cites work
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Deflated Version of the Conjugate Gradient Algorithm
- A Restarted GMRES Method Augmented with Eigenvectors
- A Stabilized QMR Version of Block BiCG
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- A framework for deflated and augmented Krylov subspace methods
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- Block GMRES method with inexact breakdowns and deflated restarting
- Block Gram-Schmidt orthogonalization
- Conjugate gradient method with preconditioning by projector
- Deflated and augmented Krylov subspace methods: A framework for deflated BiCG and related solvers
- Deflation of Conjugate Gradients with Applications to Boundary Value Problems
- Eigenvalue translation based preconditioners for the GMRES(k) method
- Exact and inexact breakdowns in the block GMRES method
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Methods of conjugate gradients for solving linear systems
- Multi-objective optimization using evolutionary algorithms
- Nested Krylov methods based on GCR
- Parallel implementation of the block conjugate gradient algorithm
- Restarted GMRES preconditioned by deflation
- Solution of Sparse Indefinite Systems of Linear Equations
- Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
- Stability of block algorithms with fast level-3 BLAS
- The N‐Step Iteration Procedures
- The University of Florida sparse matrix collection
- The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
- The block conjugate gradient algorithm and related methods
- The block grade of a block Krylov space
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
Cited in
(9)- Parallel Processing and Applied Mathematics
- On block minimal residual methods
- Projection method for eigenvalue problems of linear nonsquare matrix pencils
- CGLS-GCV: A hybrid algorithm for low-rank-deficient problems.
- Block implementation of a recursive least squares estimation algorithm
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
- Conjugate gradients for symmetric positive semidefinite least-squares problems
- Efficient algorithms for block downdating of least squares solutions
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
This page was built for publication: Block conjugate gradient algorithms for least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507984)
