Skip to main content

and
  1. No Access

    Article

    An efficient Total Least Squares algorithm based on a rank-revealing two-sided orthogonal decomposition

    Solving Total Least Squares (TLS) problemsAX≈B requires the computation of the noise subspace of the data matrix [A;B]. The widely used tool for doing this is the Singular Value Decomposition (SVD). However, the ...

    Sabine Van Huffel, Hongyuan Zha in Numerical Algorithms (1993)