Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problem

Author： Lemmerling Philippe   Mastronardi Nicola   Van Huffel Sabine  

Publisher： Springer Publishing Company

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.23, Iss.4, 2000-07, pp. : 371-392

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An algorithm for solving the indefinite least squares problem with equality constraints

By Mastronardi Nicola   Dooren Paul  

Bit Numerical Mathematics, Vol. 54, Iss. 1, 2014-03 ,pp. : 201-218

Springer Publishing Company

Access to resources Recommend Favorite

On an iterative method for solving the least squares problem of rank-deficient systems

By  

International Journal of Computer Mathematics, Vol. 92, Iss. 3, 2015-03 ,pp. : 532-541

Taylor & Francis Ltd

Access to resources Recommend Favorite

Regularized Total Least Squares Based on Quadratic Eigenvalue Problem Solvers

By Sima Diana  

Bit Numerical Mathematics, Vol. 44, Iss. 4, 2004-12 ,pp. : 793-812

Springer Publishing Company

Access to resources Recommend Favorite

An Algorithm for Least Squares

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 97-1421, Iss. 1, 1947-04 ,pp. : 120-132

John Wiley & Sons Inc

Access to resources Recommend Favorite

An Algorithm for Least Squares

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 26, Iss. 1, 1947-04 ,pp. : 120-132

John Wiley & Sons Inc

Access to resources Recommend Favorite