Successive overrelaxation methods for solving the rank deficient linear least squares problem
From MaRDI portal
Publication:578850
DOI10.1016/0024-3795(87)90124-8zbMath0624.65033OpenAlexW2010166196MaRDI QIDQ578850
Valerie A. Miller, Michael Neumann
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90124-8
least squares solution of minimal normrank deficient linear least squares problemsuccessive overrelaxation methods
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items
USSOR methods for solving the rank deficient linear least squares problem, The Drazin inverse of a semilinear transformation and its matrix representation, Determination of the optimal value of relaxation parameter in symmetric SOR method for rectangular coefficient matrices, A necessary and sufficient condition for semiconvergence and optimal parameter of the SSOR method for solving the rank deficient linear least squares problem, Comments on ``Symmetric successive overrelaxation methods for rank deficient linear systems, Accelerate overrelaxation methods for rank deficient linear systems, Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem, Orders in rings based on the core-nilpotent decomposition, AOR iterative methods for rank deficient least squares problems, Symmetric block-SOR methods for rank-deficient least squares problems, Symmetric successive overrelaxation methods for rank deficient linear systems, On accelerate overrelaxation methods for rank deficient linear systems, Block SOR methods for the solution of indefinite least squares problems, Preconditioned conjugate gradient method for rank deficient least-squares problems, Successive matrix squaring algorithm for computing the Drazin inverse, Block SOR methods for rank-deficient least-squares problems, Symmetric successive overrelaxation methods for solving the rank deficient linear least squares problem, Properties of core-EP order in rings with involution, On an iterative method for solving the least squares problem of rank-deficient systems, A note on the optimal parameters of USSOR method for solving linear least squares problems, On some orders in ∗-rings based on the core-EP decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block-iterative methods for consistent and inconsistent linear equations
- Convergence of block iterative methods applied to sparse least-squares problems
- Convergence of a direct-iterative method for large-scale least-squares problems
- Characterization of linear stationary iterative processes for solving a singular system of linear equations
- Subproper splitting for rectangular matrices
- Computational methods for generalized inverse matrices arising from proper splittings
- On computing the best least squares solutions in Hilbert space
- Projection method for solving a singular system of linear equations and its applications
- Proper Splittings of Rectangular Matrices
- Consistency and Splittings
- Note on the Generalized Inverse of a Matrix Product
- A Method for Computing the Generalized Inverse of a Matrix
- Inverses of Rank Invariant Powers of a Matrix
- A Note on the Solution of Rectangular Linear Systems by Iteration
- Cones and Iterative Methods for Best Least Squares Solutions of Linear Systems