Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

DOI10.1016/0024-3795(91)90371-3zbMath0731.65029OpenAlexW1994543177MaRDI QIDQ808173

Douglas James

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90371-3

zbMATH Keywords

convergenceiterative methodsconjugate gradient algorithmsuccessive overrelaxationNumerical experimentsleast-squares problemsblock accelerated overrelaxation

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items

Numerical methods for generalized least squares problems

Uses Software

• LINPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(p\)-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
• An algorithm to compute a sparse basis of the null space
• Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices
• An iterative substructuring algorithm for equilibrium equations
• Convergence of a direct-iterative method for large-scale least-squares problems
• A note on two block-SOR methods for sparse least squares problems
• Optimality relationships for p-cyclic SOR
• Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
• A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis
• Iterative Methods for Equality-Constrained Least Squares Problems
• Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
• Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
• Accelerated Overrelaxation Method
• A Framework for Equilibrium Equations
• Iterative Methods for Solving Partial Difference Equations of Elliptic Type