Convergence of a direct-iterative method for large-scale least-squares problems

DOI10.1016/0024-3795(85)90073-4zbMath0576.65026OpenAlexW2022838819MaRDI QIDQ1064737

Robert J. Plemmons, Michael Neumann, Thomas L. Markham

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0024-3795(85)90073-4

zbMATH Keywords

parameter asymptotic successive overrelaxation convergence factor least-squares problems 2-cyclic block SOR method combined direct-iterative method optimum SOR

Mathematics Subject Classification ID

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

Related Items

A note on two block-SOR methods for sparse least squares problems, Extrapolated Gauss-Seidel I and SOR methods for least-squares problems, Stepsize restrictions for stability in the numerical solution of ordinary and partial differential equations, A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques, Superior convergence domains for a \(p\)-cyclic SSOR majorizer, Exact SOR convergence regions for a general class of \(p\)-cyclic matrices, On the equivalence of the k-step iterative Euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices, An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems, Optimal \(p\)-cyclic SOR for complex spectra, Numerical aspects of the generalized CG-method applied to least squares problems, Precise domains of convergence for the block SSOR method associated with p-cyclic matrices, A note on the SOR and CG methods for large least squares problems, The theoretical aspects of the generalized conjugate gradient method pplied to least squares problems, A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis, Sor method andp-cyclic matrices (I), Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation, Sor and related methods forp-cyclic systems, Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm, Application of the Schur-Cohn theorem to the precise convergence domain for a \(p\)-cyclic SOR iteration matrix, Accuracy of preconditioned CG-type methods for least squares problems., Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices, An iterative substructuring algorithm for equilibrium equations, Block Gauss elimination followed by a classical iterative method for the solution of linear systems., A parallelizable SOR-like method: Systems with plus-shaped and linear spectra, Generalization: One technique of computational and applied mathematical methodology, Chebyshev polynomial acceleration for block SOR methods for solving the rank-deficient least-squares problem, The convergence of the two-block SAOR method for least-squares problems, \(p\)-cyclic SOR for BVPs with periodic boundary conditions, Minimization of \(\ell_2\)-norms of the SOR and MSOR operators, The SOR-kmethod for linear systems withp-cyclic matrices, Successive overrelaxation methods for solving the rank deficient linear least squares problem, Preconditioned conjugate gradient method for rank deficient least-squares problems, Optimality relationships for p-cyclic SOR, A generalized successive overrelaxation method for least squares problems, Convergence domains of the SSOR method for a class of generalized consistently ordered matrices, Block SOR methods for rank-deficient least-squares problems, Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999, Dedication to Robert J. Plemmons, A Young-Eidson's type algorithm for complex \(p\)-cyclic SOR spectra, Successive overrelaxation (SOR) and related methods, Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

Uses Software

Cites Work