Numerical methods for generalized least squares problems
From MaRDI portal
Publication:1919405
DOI10.1016/0377-0427(95)00167-0zbMath0858.65043OpenAlexW2009379438MaRDI QIDQ1919405
Publication date: 11 March 1997
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(95)00167-0
numerical experimentsgeneralized least squares problemspreconditioned block successive overrelaxation type methodspreconditioned conjugate gradient type methods
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Related Items
A class of modified GSS preconditioners for complex symmetric linear systems ⋮ On Uzawa-SSI method for non-Hermitian saddle point problems ⋮ Accelerated SOR-like method for augmented linear systems ⋮ A high-order integral algorithm for highly singular PDE solutions in Lipschitz domains ⋮ Modified preconditioned GAOR methods for systems of linear equations ⋮ Preconditioned iterative methods for solving weighted linear least squares problems ⋮ On semi-convergence of a class of relaxation methods for singular saddle point problems ⋮ Backward and Forward Modified SOR Iteration Methods for Solving Standard Saddle-Point Problems ⋮ Fast solving of weighted pairing least-squares systems ⋮ Preconditioned generalized mixed-type splitting iterative method for solving weighted least-squares problems ⋮ Some new preconditioned generalized AOR methods for solving weighted linear least squares problems ⋮ A parameterized shift-splitting preconditioner for saddle point problems ⋮ Symmetric SOR method for augmented systems ⋮ Solution of large‐scale weighted least‐squares problems ⋮ Semi-convergence analysis of GMSSOR methods for singular saddle point problems ⋮ A parallel balance scheme for banded linear systems ⋮ Cosine-modulated multitone for very-high-speed digital subscriber lines ⋮ Scattered data approximation on the bisphere and application to texture analysis ⋮ Some results on preconditioned GAOR methods ⋮ A modified SOR-like method for the augmented systems ⋮ Two new preconditioned GAOR methods for weighted linear least squares problems ⋮ A note on preconditioning for the \(3\times 3\) block saddle point problem ⋮ A class of new extended shift-splitting preconditioners for saddle point problems ⋮ A block triangular preconditioner for a class of three-by-three block saddle point problems ⋮ A modified alternating positive semidefinite splitting preconditioner for block three-by-three saddle point problems ⋮ Convergence of a generalized MSSOR method for augmented systems ⋮ Two block preconditioners for a class of double saddle point linear systems ⋮ Convergence of relaxation iterative methods for saddle point problem ⋮ Combination of augmented Lagrangian technique and ST preconditioner for saddle point problems ⋮ A modified symmetric successive overrelaxation method for augmented systems ⋮ SOR-like Methods with Optimization Model for Augmented Linear Systems ⋮ New preconditioners based on symmetric-triangular decomposition for saddle point problems ⋮ Comparison of mathematical methods of potential modeling ⋮ Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition ⋮ Evaluation of ST preconditioners for saddle point problems ⋮ Convergence of the GAOR method for one subclass of \(H\)-matrix ⋮ Generalization: One technique of computational and applied mathematical methodology ⋮ Some new preconditioned generalized AOR methods for generalized least-squares problems ⋮ A robust parametric technique for multipath channel estimation in the uplink of a DS-CDMA system ⋮ Some new preconditioned generalized AOR methods for generalized least-squares problems ⋮ Unnamed Item ⋮ Variants of the Uzawa method for three-order block saddle point problem ⋮ Modified Uzawa methods for saddle point problems ⋮ Comparison results on the preconditioned GAOR method for generalized least squares problems ⋮ Solving two-stage stochastic programming problems with level decomposition ⋮ Convergence of generalized AOR iterative method for linear systems with strictly diagonally dominant matrices ⋮ Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem ⋮ Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems ⋮ Convergence of GAOR method for doubly diagonally dominant matrices ⋮ Comparison results on preconditioned GAOR methods for weighted linear least squares problems ⋮ An accelerated symmetric SOR-like method for augmented systems ⋮ Evaluating the Effects of Local Search in Genetic Programming ⋮ On convergence of the generalized AOR method for linear systems with diagonally dominant coefficient matrices ⋮ Convergences of splitting iterative methods for symmetric indefinite linear systems ⋮ Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison ⋮ Realization of a spatially multiplexed MIMO system ⋮ Block triangular preconditioners based on symmetric-triangular decomposition for generalized saddle point problems ⋮ Generalized ASOR and modified ASOR methods for saddle point problems ⋮ Preconditioned GAOR methods for solving weighted linear least squares problems ⋮ A general Uzawa-type method for a class of \(2\times 2\) block structure linear system ⋮ A modified SSOR iterative method for augmented systems ⋮ Multipole fast algorithm for the least-squares approach of the method of fundamental solutions for three-dimensional harmonic problems ⋮ Discrete least-squares finite element methods ⋮ Two Parameter Iteration Methods for Coupled Sylvester Matrix Equations ⋮ Preconditioned SOR methods for generalized least-squares problems ⋮ A new block-diagonal preconditioner for a class of \(3\times 3\) block saddle point problems ⋮ Modified incomplete orthogonal factorization methods using Givens rotations ⋮ Generalized fast shift-splitting preconditioner for nonsymmetric saddle-point problems ⋮ Convergence of the generalized AOR method ⋮ A modified ASOR-like method for augmented linear systems ⋮ ON THE UPSS METHOD FOR NON-HERMITIAN SINGULAR SADDLE POINT PROBLEMS ⋮ A generalized shift-splitting preconditioner for saddle point problems ⋮ A new modified SSOR iteration method for solving augmented linear systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(p\)-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
- A note on two block-SOR methods for sparse least squares problems
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- Preconditioned conjugate gradient method for generalized least squares problems
- Iterative Methods for Equality-Constrained Least Squares Problems
- Numerical solution of sparse singular systems of equations arising from ergodic markov chains
- Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
- Solution of Sparse Indefinite Systems of Linear Equations
- Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
- Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems
- On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Methods of conjugate gradients for solving linear systems
