A note on the scaled total least squares problem (Q2465315): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yi-Min Wei / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Tzvetan Semerdjiev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2007.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034819163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the least squares distance using scaled total least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaled total least squares fundamentals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic relations between the total least squares and least squares problems with more than one solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis for the Total Least Squares Problem with More Than One Solution / rank
 
Normal rank

Latest revision as of 14:37, 27 June 2024

scientific article
Language Label Description Also known as
English
A note on the scaled total least squares problem
scientific article

    Statements

    A note on the scaled total least squares problem (English)
    0 references
    0 references
    0 references
    0 references
    3 January 2008
    0 references
    Two results on the scaled total least squares (STLS) problem are presented. First, quantitative relations between the STLS and least squares solutions and residuals are considered. An upper bound is derived for difference between the STLS solution and the least square solution. A quantitative relation between the STLS residual and the least square residual is established. A particular theorem is proven to show that in some conditions the two solutions and two residuals are equal. Second, a perturbation analysis of the STLS problem is performed. It is shown that the solution of the perturbed problem is close to the original problem if the perturbation is small and the expected errors are small. Finally, numerical experiments are provided to demonstrate that the derived bounds are competitive with existing bounds.
    0 references
    0 references
    overdetermined systems
    0 references
    least squares
    0 references
    scaled total least squares
    0 references
    perturbation analysis
    0 references
    numerical experiments
    0 references
    0 references