Implicit Nullspace Iterative Methods for Constrained Least Squares Problems

DOI10.1137/0613058zbMath0760.65045OpenAlexW2036172929MaRDI QIDQ4016805

Douglas James

Publication date: 16 January 1993

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0613058

zbMATH Keywords

numerical resultsStokes flowiterative algorithmspreconditionerparallel implementationnormal equationssubstructuringforce methodstructural engineeringequality constrained least squares problemsimplicit null space methodsorder-reducing algorithm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Finite element methods applied to problems in solid mechanics (74S05) Stokes and related (Oseen, etc.) flows (76D07) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (8)

Recursive least squares with linear inequality constraints ⋮ Parameterized eigensolution technique for solving constrained least squares problems^∗ ⋮ A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ Numerical methods for generalized least squares problems ⋮ Preconditioned conjugate gradient method for generalized least squares problems ⋮ A fast null-space method for the unsteady Stokes equations ⋮ Preconditioned SOR methods for generalized least-squares problems ⋮ Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

This page was built for publication: Implicit Nullspace Iterative Methods for Constrained Least Squares Problems