Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
equality constrained least squares problemsforce methodimplicit null space methodsiterative algorithmsnormal equationsnumerical resultsorder-reducing algorithmparallel implementationpreconditionerStokes flowstructural engineeringsubstructuring
Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element methods applied to problems in solid mechanics (74S05) Stokes and related (Oseen, etc.) flows (76D07)
- Iterative Methods for Equality-Constrained Least Squares Problems
- An iterative substructuring algorithm for equilibrium equations
- scientific article; zbMATH DE number 31273
- Accuracy and stability of the null space method for solving the equality constrained least squares problem
- scientific article; zbMATH DE number 4056886
- Preconditioned SOR methods for generalized least-squares problems
- Numerical methods for generalized least squares problems
- Preconditioned conjugate gradient method for generalized least squares problems
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- A fast null-space method for the unsteady Stokes equations
- Recursive least squares with linear inequality constraints
- On a direct solver for linear least squares problems
- Iterative Methods for Equality-Constrained Least Squares Problems
- Parameterized eigensolution technique for solving constrained least squares problems∗
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
- An iterative substructuring algorithm for equilibrium equations
This page was built for publication: Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016805)
