Greville's method for preconditioning least squares problems
A new method to precondition general least squares problems from the perspective of the approximate Moore-Penrose inverse is presented. Similar to the robust incomplete factorization (RIF) the proposed method also includes an \(A\)-orthogonalization process when the coefficient matrix has full column rank. When \(A\) is rank deficient, the method tries to orthogonalize the linearly independent part in \(A\). A theoretical analysis on the equivalence between the preconditioned problem and the original problem is given. Based on Greville's method, a global algorithm and a vector-wise algorithm for constructing the preconditioner which is an approximate generalized inverse of \(A\) is proposed. It is shown that for a full column rank matrix \(A\), the developed algorithm is similar to the RIF preconditioning algorithm and includes an \(A\)-orthogonalization process. It is proven that under a certain assumption, using the developed preconditioner, the preconditioned problem is equivalent to the original problem, and the generalized minimal residual method (GMRES) can determine a solution to the preconditioned problem before breakdown happens. Some details on the implementation of the developed algorithms are considered, and some numerical results are presented.
- Greville's method for preconditioning least squares problems
- Generalized approximate inverse preconditioners for least squares problems
- Preconditioned GMRES methods for least squares problems
- Preconditioners for least squares problems by LU factorization
- Preconditioning linear least-squares problems by identifying a basis matrix
- A robust incomplete factorization preconditioner for positive definite matrices
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Balanced Incomplete Factorization
- Generalized inverses: theory and computations
- GMRES methods for least squares problems
- GMRES On (Nearly) Singular Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- On the convergence of general stationary iterative methods for range-Hermitian singular linear systems.
- On the Relations between ILUs and Factored Approximate Inverses
- Perturbation theory for pseudo-inverses
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
- Some Applications of the Pseudoinverse of a Matrix
- The Moore--Penrose Generalized Inverse for Sums of Matrices
- The University of Florida sparse matrix collection
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Preconditioner based on the Sherman-Morrison formula for regularized least squares problems
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Preconditioning linear least-squares problems by identifying a basis matrix
- Greville's method for preconditioning least squares problems
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Preconditioners for Krylov subspace methods: An overview
- Preconditioned GMRES methods for least squares problems
This page was built for publication: Greville's method for preconditioning least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652570)
