The least-squares solution of overdetermined linear systems with Toeplitz- or Cauchy like structure is studied with an “augmented matrix” approach. A fast algorithm for the computation of the pseudoinverse in the full-rank case is developed, based on the displacement properties of the matrices involved, and the parameters on which the algorithm depends are determined optimally. Finally, the performance of the method is tested through numerical experimentation.
Fast solution of Toeplitz- and Cauchy-like least squares problems
RODRIGUEZ, GIUSEPPE
2006-01-01
Abstract
The least-squares solution of overdetermined linear systems with Toeplitz- or Cauchy like structure is studied with an “augmented matrix” approach. A fast algorithm for the computation of the pseudoinverse in the full-rank case is developed, based on the displacement properties of the matrices involved, and the parameters on which the algorithm depends are determined optimally. Finally, the performance of the method is tested through numerical experimentation.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.