Iterative Methods for Equality-Constrained Least Squares Problems
From MaRDI portal
Publication:3809125
DOI10.1137/0909061zbMath0659.65040OpenAlexW2041303285MaRDI QIDQ3809125
Robert J. Plemmons, Jesse L. Barlow, Nancy K. Nichols
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909061
numerical exampleslinear constraintspreconditioned conjugate gradient methodfinite element modellinear least squares problemKuhn-Tucker equationsblock successive overrelaxation scheme
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Finite element methods applied to problems in solid mechanics (74S05) Iterative numerical methods for linear systems (65F10)
Related Items
Recursive least squares with linear inequality constraints, Algorithms and experiments for structural mechanics on high-performance architectures, A note on two block-SOR methods for sparse least squares problems, Self-scaling fast rotations for stiff and equality-constrained linear least squares problems, SSOR-like methods for saddle point problems, Numerical methods for generalized least squares problems, Preconditioned conjugate gradient method for generalized least squares problems, Partial condition number for the equality constrained linear least squares problem, An iterative substructuring algorithm for equilibrium equations, Generalized QR factorization and its applications, Condition numbers for a linear function of the solution of the linear least squares problem with equality constraints, On the condition number theory of the equality constrained indefinite least squares problem, Preconditioned SOR methods for generalized 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, Condition numbers for the K-weighted pseudoinverse and their statistical estimation, Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
