Abstract
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that combines the bisection technique with a fast root-finding procedure to obtain each eigenvalue. We design a parallel algorithm that applies a static distribution of the calculations among processors and three algorithms that use the farming technique to dynamically balance the load. All the algorithms have been implemented on a Multicomputer based on a network of transputers. We also present a study of the experimental performances and compare the different algorithms. The results obtained are in many cases very near to the maximum theoretical performances we can expect.
Partially supported by the ESPRIT III Basic Research Programm of the EC under contract No. 9072 (Project GEPPCOM), and partially supported by Spanish CICYT project TIC-91-1157-C03-02
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Badía, J. M. & Vidal, A. M., “Divide and Conquer Algorithms to solve the Eigenproblem of Symmetric Toeplitz Matrices on Multicomputers”, DSIC-II/2/94 Dpt. Sistemas Informátions y Computación. U.P.V. (1994).
Bernstein, H. J. & Goldstein, M., “Parallel Implementation of Bisection for the Calculation of Eigenvalues of Tridiagonal Symmetric Matrices.”, Computing, no. 37. pp. 85–91 (1986).
Golub, G. H. & Van Loan, C. F., “Matrix Computations.”, Johns Hopkins University Press, Eds., (1989).
Heinig, G.; Jankowski, P. & Rost, K., “Fast Inversion Algorithms of Toeplitz-plus-Hankel Matrices.”, Numer. Math., no. 52. pp. 665–682 (1988).
INMOS, “Occam 2. Reference Manual.”, Prentice Hall International Eds., Series in Computer Science 1989.
Kalamboukis, T. Z., “The Symmetric Tridiagonal Eigenvalue Problem on a Transputer Network.”, Parallel Computing, no. 15. pp. 101–106 (1990).
Ljung, S., “Fast algorithms for integral equations and least square identification problem”, Diss. 93, Linköp Stud. Sc. Tech. (1983).
Merchant, G. A. & Parks, T. W., “Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equation.”, IEEE Trans, on Acoust. Speech Sign. Process, vol. 30. no. 1. pp. 40–44 (1982).
PARSYS, “Hardware Reference for the Parsys SN1000 series 1989.
Pereyra, V. & Scherer, G., “Eigenvalues of Symmetric Tridiagonal Matrices: A Fast, Accurate and Reliable Algorithm.”, J. Inst. Math. Applies, no. 12. pp. 209–222 (1973).
Ralha, R. M. S., “Parallel Solution of the Symmetric Tridiagonal Eigenvalue Problem on a Transputer Network”, SEMNI 93, La Coruña, Spain, 1993, vol. 2, pp. 1026–1033.
Trench, W. F., “Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices.”, SIAM J. Matrix Anal. Appl., vol. 10. no. 2. pp. 135–146 (1989).
Trench, W. F., “Numerical Solution of the Eigenvalue Problem for Efficiently Structured Hermitian Matrices.”, Linear Algebra and its Applications, no. 154–156. pp. 415–432 (1991).
Trench, W. F., “A Note on Computing Eigenvalues of Banded Hermitian Toeplitz Matrices.”, SIAM J. Sci. Stat. Comput, vol. 14. no. 2. pp. (1993).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badía, J.M., Vidal, A.M. (1994). Parallel computation of the eigenstructure of Toeplitz-plus-Hankel matrices on Multicomputers. In: Dongarra, J., Waśniewski, J. (eds) Parallel Scientific Computing. PARA 1994. Lecture Notes in Computer Science, vol 879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030133
Download citation
DOI: https://doi.org/10.1007/BFb0030133
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58712-5
Online ISBN: 978-3-540-49050-0
eBook Packages: Springer Book Archive