An efficient and stable parallel solution for non-symmetric toeplitz linear systems

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

  • Affiliations:
  • Universidad Politécnica de Valencia, Valencia, Spain;Universitat Jaume I, Castellón de la Plana, Spain;Universidad Politécnica de Valencia, Valencia, Spain

  • Venue:
  • VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we parallelize a new algorithm for solving non-symmetric Toeplitz linear systems. This algorithm embeds the Toeplitz matrix in a larger structured matrix, then transforms it into an embedded Cauchy-like matrix by means of trigonometric modifications. Finally, the algorithm applies a modified QR transformation to triangularize the augmented matrix. The algorithm combines e.ciency and stability. It has been implemented using standard tools and libraries, thereby producing a portable code. An extensive experimental analysis has been performed on a cluster of personal computers. Experimental results show that we can obtain efficiencies that are similar to other fast parallel algorithms, while obtaining more accurate results with only one iterative refinement step in the solution.