Alternating Anderson-Uzawa method for solving the indefinite least squares problem
From MaRDI portal
Cites work
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
- Accelerating the Uzawa algorithm
- Algorithms for indefinite linear least squares problems
- Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems
- An Analysis of the Total Least Squares Problem
- Anderson acceleration for fixed-point iterations
- Backward error and condition number analysis for the indefinite linear least squares problem
- Block SOR methods for the solution of indefinite least squares problems
- Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems
- Iterative Procedures for Nonlinear Integral Equations
- Matrix Analysis
- On the partial condition numbers for the indefinite least squares problem
- Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
- Splitting-based randomized iterative methods for solving indefinite least squares problem
- Two classes of multisecant methods for nonlinear acceleration
- USSOR method for solving the indefinite least squares problem
- Variable parameter Uzawa method for solving the indefinite least squares problem
This page was built for publication: Alternating Anderson-Uzawa method for solving the indefinite least squares problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894990)