Convergence of block iterative methods applied to sparse least-squares problems
DOI10.1016/0024-3795(84)90218-0zbMath0565.65019OpenAlexW2089979798MaRDI QIDQ1058819
Richard S. Varga, John De Pillis, Wilhelm Niethammer
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90218-0
successive overrelaxationconvergence domainoverdetermined systemsleast squares solutionsoptimal relaxation factorconsistently ordered matrixblock-Jacobi iterative methodblock-SOR iterative methodgeodetical networkweakly cyclic
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items (43)
Cites Work
- \(p\)-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- The analysis of k-step iterative methods for linear systems from summability theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence of block iterative methods applied to sparse least-squares problems