Methods for Large Scale Total Least Squares Problems
From MaRDI portal
Publication:2706265
DOI10.1137/S0895479899355414zbMath0974.65037OpenAlexW1982851849MaRDI QIDQ2706265
Pontus Matstoms, Pinar Heggernes, Åke Björck
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479899355414
algorithmconvergencenumerical resultspreconditioningconjugate gradient methodsingular valuestotal least squaresRayleigh quotient iterationlarge sparse matrixLanczos-type algorithms
Related Items
A contribution to perturbation analysis for total least squares problems ⋮ Small sample statistical condition estimation for the total least squares problem ⋮ A note on the condition number of the scaled total least squares problem ⋮ Implicit iterative algorithm for solving regularized total least squares problems ⋮ On condition numbers of the total least squares problem with linear equality constraint ⋮ Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem ⋮ A Gauss-Newton iteration for total least squares problems ⋮ On the condition number of the total least squares problem ⋮ Condition numbers of the mixed least squares-total least squares problem revisited ⋮ On the multivariate total least-squares approach to empirical coordinate transformations. Three algorithms ⋮ Some results on condition numbers of the scaled total least squares problem ⋮ Connections between the total least squares and the correction of an infeasible system of linear inequalities ⋮ A note on constrained total least-squares estimation ⋮ The revisited total least squares problems with linear equality constraint ⋮ Randomized core reduction for discrete ill-posed problem ⋮ Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization ⋮ An efficient Gauss-Newton algorithm for solving regularized total least squares problems
Uses Software
