Skip to main content

A Parallel Algorithm for Solving the Toeplitz Least Squares Problem

  • Conference paper
  • First Online:
  • 2711 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1981))

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.

Partially funded by the Spanish Government through the project CICYT TIC96- 1062-C03.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pedro Alonso, José M. Badía, and Antonio M. Vidal. Un algoritmo paralelo estable para la resolución de sistemas de ecuaciones toeplitz no simétricos. In Actas del VI Congreso de Matemática Aplicada (CMA), Las Palmas de Gran Canaria, volume II, pages 847–854, 1999.

    Google Scholar 

  2. Pedro Alonso, José M. Badía, and Antonio M. Vidal. Algoritmos paralelos para la resolución de sistemas lineales y del problema de mínimos cuadrados para matrices Toeplitz no simétricas. Technical Report II-DSIC-2/2000, Universidad Politécnica de Valencia, January 2000.

    Google Scholar 

  3. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen. LAPACK Users’ Guide. SIAM, Philadelphia, second edition, 1995.

    Google Scholar 

  4. L. S. Blackford, J. Choi, and A. Cleary. ScaLAPACK Users’ Guide. SIAM, 1997.

    Google Scholar 

  5. Richard P. Brent. Stability of fast algorithms for structured linear systems. In T. Kailath and A. H. Sayed, editors, Fast Reliable Algorithms for Matrices with Structure, pages 103–116. SIAM, 1999.

    Google Scholar 

  6. S. Chandrasekaran and Ali H. Sayed. A fast stable solver for nonsymmetric Toeplitz and quasi-Toeplitz systems of linear equations. SIAM Journal on Matrix Analysis and Applications, 19(1):107–139, January 1998.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Chun, T. Kailath, and H. Lev-Ari. Fast parallel algorithms for QR and triangular factorization. SIAM Journal on Scientific and Statistical Computing, 8(6):899–913, November 1987.

    Article  MATH  MathSciNet  Google Scholar 

  8. Gene H. Golub and Charles F. Van Loan. Matrix Computations, volume 3 of Johns Hopkins Series in the Mathematical Sciences. The Johns Hopkins University Press, Baltimore, MD, USA, second edition, 1989.

    Google Scholar 

  9. Thomas Kailath and Ali H. Sayed. Displacement structure: Theory and applications. SIAM Review, 37(3):297–386, September 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. Haesun Park and Lars Eldén. Schur-type methods for solving least squares problems with Toeplitz structure. SIAM Journal on Scientific Computing, 22(2):406–430, July 2000.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Schur. Über Potenzreihen, die im Innern des Einkeitskreise beschänkt sind. Journal für die reine und angewandte Mathematik, 147:205–232, 1917.

    Article  Google Scholar 

  12. M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI: The complete reference. MIT Press, MA, USA, 1996.

    Google Scholar 

  13. D. R. Sweet. Fast Toeplitz orthogonalization. Numerische Mathematik, 43(1):1–21, 1984.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alonso, P., Badía, J.M., Vidal, A.M. (2001). A Parallel Algorithm for Solving the Toeplitz Least Squares Problem. In: Palma, J.M.L.M., Dongarra, J., Hernández, V. (eds) Vector and Parallel Processing — VECPAR 2000. VECPAR 2000. Lecture Notes in Computer Science, vol 1981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44942-6_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-44942-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41999-0

  • Online ISBN: 978-3-540-44942-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics