摘要
Consider solving an overdetermined system of linear algebraic equations by both the least squares method (LS) and the total least squares method (TLS). Extensive published computational evidence shows that when the original system is consistent. one often obtains more accurate solutions by using the TLS method rather than the LS method. These numerical observations contrast with existing analytic perturbation theories for the LS and TLS methods which show that the upper bounds for the LS solution are always smaller than the corresponding upper bounds for the TLS solutions. In this paper we derive a new upper bound for the TLS solution and indicate when the TLS method can be more accurate than the LS method.Many applied problems in signal processing lead to overdetermined systems of linear equations where the matrix and right hand side are determined by the experimental observations (usually in the form of a lime series). It often happens that as the number of columns of the matrix becomes larger, the
Consider solving an overdetermined system of linear algebraic equations by both the least squares method (LS) and the total least squares method (TLS). Extensive published computational evidence shows that when the original system is consistent. one often obtains more accurate solutions by using the TLS method rather than the LS method. These numerical observations contrast with existing analytic perturbation theories for the LS and TLS methods which show that the upper bounds for the LS solution are always smaller than the corresponding upper bounds for the TLS solutions. In this paper we derive a new upper bound for the TLS solution and indicate when the TLS method can be more accurate than the LS method.Many applied problems in signal processing lead to overdetermined systems of linear equations where the matrix and right hand side are determined by the experimental observations (usually in the form of a lime series). It often happens that as the number of columns of the matrix becomes larger, the rank of the matrix increases until it reaches a finite integer p. Increasing columns of the matrix beyond the value p results in a rank deficient matrix. Intuitively, one might believe that using more observations than the full rank of the matrix would not be useful. However, extensive computational evidence shows that it is better to overdetermine the data matrix beyond the full rank; the solution of the overdetermined, rank deficient system by either the LS or the TLS method produces more accurate results than when one solves the linear system with the number of columns exactly equal to p. In this paper we also present an explanation for these numerical observations by comparing the upper error bounds.
基金
This author was supported by the National Natural Sciences Foundation,PRC.
This author was supported by the Air Force Office of Scientific Research, USA, Grant No. AFOSR-91-0309