A Parallel Algorithm for Solving the Toeplitz Least Squares Problem

  • Authors:
  • Pedro Alonso;José M. Badía;Antonio M. Vidal

  • Affiliations:
  • -;-;-

  • Venue:
  • VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a parallel algorithm that solves the Toeplitz Least Squares Problem. We exploit the displacement structure of Toeplitz matrices and parallelize the Generalized Schur method. The stability problems of the method are solved by using a correction process based on the Corrected Semi-Normal Equations [10]. Other problems arising in the parallelization of the method, such as the data dependencies and high communication cost, have been addressed with an optimized distribution of the data, rearrangement of the computations, and with the design of new basic parallel subroutines. We have used standard tools like the ScaLAPACK library based on the MPI environment. Experimental results have been obtained in a cluster of personal computers with a high performance interconnection network.