Block SOR methods for the solution of indefinite least squares problems
DOI10.1007/S10092-013-0090-8zbMATH Open1314.65059OpenAlexW2089178448MaRDI QIDQ2017963FDOQ2017963
Publication date: 23 March 2015
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-013-0090-8
convergencenumerical experimentsuccessive overrelaxation (SOR)QR factorizationindefinite least squares problemsblock SOR methodsoptimal SOR parameter
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Direct Methods for Sparse Linear Systems
- Block SOR methods for rank-deficient least-squares problems
- Convergence of block iterative methods applied to sparse least-squares problems
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
- Symmetric block-SOR methods for rank-deficient least squares problems
- Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem
- Successive overrelaxation methods for solving the rank deficient linear least squares problem
- Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
- A note on two block-SOR methods for sparse least squares problems
Cited In (16)
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- On the partial condition numbers for the indefinite least squares problem
- An accelerated symmetric SOR-like method for augmented systems
- USSOR method for solving the indefinite least squares problem
- HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS
- On semi-convergence of parameterized SHSS method for a class of singular complex symmetric linear systems
- Preconditioned Richardson iteration for augmented linear systems
- Solutions to matrix equations \(X - AXB = CY + R\) and \(X - A\hat{X}B = CY + R\)
- Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
- Symmetric block-SOR methods for rank-deficient least squares problems
- A note on two block-SOR methods for sparse least squares problems
- Backward error and condition number analysis for the indefinite linear least squares problem
- Block-splitting preconditioners for indefinite least squares problem
- Splitting-based randomized iterative methods for solving indefinite least squares problem
- On Euler preconditioned SHSS iterative method for a class of complex symmetric linear systems
- A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations
Uses Software
This page was built for publication: Block SOR methods for the solution of indefinite least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017963)
