Parameterized eigensolution technique for solving constrained least squares problems∗

DOI10.1080/00207160008804999zbMath0969.65035OpenAlexW2073738680MaRDI QIDQ4521953

Mohammedi R. Abdel-Aziz

Publication date: 25 September 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804999

zbMATH Keywords

algorithmrational interpolationconstrained least squares problemsuperlinear convergenceimplicit restarted Lanczos methodparametrized eigenproblems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regularization of projection methods for solving ill-posed problems
• Least squares with a quadratic constraint
• Quadratically constrained least squares and quadratic problems
• An implicit shift bidiagonalization algorithm for ill-posed systems
• Computing a Trust Region Step
• On the Method of Weighting for Equality-Constrained Least-Squares Problems
• Newton’s Method with a Model Trust Region Modification
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems