Scaled total least squares fundamentals

DOI10.1007/S002110100314zbMATH Open0998.65046OpenAlexW2035741281MaRDI QIDQ1597698FDOQ1597698

Authors: Christopher C. Paige, Zdeněk Strakoš 

Publication date: 30 May 2002

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110100314

Recommendations

• A note on the scaled total least squares problem
• Overview of total least-squares methods
• Bounds for the least squares distance using scaled total least squares
• Backward perturbation analysis for scaled total least-squares problems
• Perturbation analysis and condition numbers of scaled total least squares problems

zbMATH Keywords

algorithmslarge sparse systemsoverdetermined linear systemsscaled total least squares problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cited In (32)

• Error bounds for computed least squares estimators
• Linearization estimates of the backward errors for least squares problems.
• Empirical distribution function under heteroscedasticity
• A Note on Inexact Inner Products in GMRES
• Backward perturbation analysis for scaled total least-squares problems
• Implicitly-weighted total least squares
• Data-driven model reduction by two-sided moment matching
• A note on the condition number of the scaled total least squares problem
• On TLS formulation and core reduction for data fitting with generalized models
• Perturbation analysis and condition numbers of mixed least squares-scaled total least squares problem
• A new error in variables model for solving positive definite linear system using orthogonal matrix decompositions
• Lanczos tridiagonalization and core problems
• Title not available (Why is that?)
• Inexact GMRES for singular linear systems
• Perturbation analysis and condition numbers of scaled total least squares problems
• Accuracy of the Lanczos process for the eigenproblem and solution of equations
• Characterizing Matrices That Are Consistent with Given Solutions
• Determination of regularization parameter via solving a multi-objective optimization problem
• A Gauss-Newton iteration for total least squares problems
• TLS formulation and core reduction for problems with structured right-hand sides
• Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem
• A contribution to the conditioning of the mixed least-squares scaled total least-squares problem
• A note on the scaled total least squares problem
• Title not available (Why is that?)
• Bounds for the least squares distance using scaled total least squares
• Title not available (Why is that?)
• The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
• A note on the matrix-scaled total least squares problems with multiple solutions
• On the condition number of the total least squares problem
• Some results on condition numbers of the scaled total least squares problem
• Analyzing vector orthogonalization algorithms
• Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework

This page was built for publication: Scaled total least squares fundamentals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597698)