A fast algorithm for solving regularized total least squares problems
From MaRDI portal
Publication:836782
zbMath1171.15305MaRDI QIDQ836782
Publication date: 8 September 2009
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130564
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (13)
Projected nonstationary iterated Tikhonov regularization ⋮ On the choice of solution subspace for nonstationary iterated Tikhonov regularization ⋮ Perturbation analysis and condition numbers for the Tikhonov regularization of total least squares problem and their statistical estimation ⋮ Detecting hyperbolic and definite matrix polynomials ⋮ Two projection methods for regularized total least squares approximation ⋮ Large-scale Tikhonov regularization via reduction by orthogonal projection ⋮ Discrete ill-posed least-squares problems with a solution norm constraint ⋮ Implementations of range restricted iterative methods for linear discrete ill-posed problems ⋮ Combining approximate solutions for linear discrete ill-posed problems ⋮ Efficient determination of the hyperparameter in regularized total least squares problems ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ A method for computing a few eigenpairs of large generalized eigenvalue problems ⋮ An efficient Gauss-Newton algorithm for solving regularized total least squares problems
Uses Software
This page was built for publication: A fast algorithm for solving regularized total least squares problems
