×

A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. (English) Zbl 0791.65020

We describe a block version of Arnoldi’s method for computing a few eigenvalues with largest or smallest real parts. The method is accelerated via Chebyshev iteration and a procedure is developed to identify the optimal ellipse which encloses the spectrum. A parallel implementation of this method is investigated on the eight processor Alliant FX/80. Numerical results and comparisons with simultaneous iteration on some Harwell-Boeing matrices are reported.

MSC:

65F15 Numerical computation of eigenvalues and eigenvectors of matrices
65Y05 Parallel numerical computation
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Arnoldi, W.E. (1951): The principle of minimized iteration in the solution of matrix eigenvalue problem. Quart. Appl. Math.9, 17-29 · Zbl 0042.12801
[2] Duff, I.S., Grimes, R.G., Lewis, J.G. (1989): Space matrix test problems. ACM Trans. Math. Softw.15, 1-14 · Zbl 0667.65040 · doi:10.1145/62038.62043
[3] Golub, G.H., Van Loan, C.F. (1989): Matrix computations. 2nd edn. The Johns Hopkins University Press, New York · Zbl 0733.65016
[4] Ho, D. (1990): Tchebychev acceleration technique for large scale nonsymmetric matrices. Numer. Math.56, 721-734 · Zbl 0684.65032 · doi:10.1007/BF01405199
[5] Jenning, A., Stewart, W.J. (1981): A simultaneous iteration algorithm for real matrices. ACM, Trans. Math. Software,7, 184-198 · Zbl 0455.65028 · doi:10.1145/355945.355948
[6] Kerner, W. (1989): Large-scale complex eigenvalue problems. Comput. Phys.85, 1-85 · Zbl 0685.65028 · doi:10.1016/0021-9991(89)90200-3
[7] Kuck Inc, A. (1988): Para-Eispack. Kuck and associates, Urbana, IL
[8] Manteuffel, T.A. (1977): The Tchebychev iteration for nonsymmetric linear systems. Numer. Math.28, 307-327 · Zbl 0361.65024 · doi:10.1007/BF01389971
[9] Manteuffel, T.A. (1978): Adaptive procedure for estimation of parameter for the nonsymmetric Tchebychev iteration. Numer. Math.28, 187-208 · Zbl 0413.65032
[10] Parlett, B. N. (1980): The symmetric eigenvalue problem. Prentice-Hall, Englewood Cliffs, NJ · Zbl 0431.65017
[11] Rutishauser, H. (1969): Computational aspect of Bauer’s simultaneous iteration method. Numer. Math.13, 4-13 · Zbl 0182.21304 · doi:10.1007/BF02165269
[12] Saad, Y. (1980): Variations on Arnoldi’s method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl.34, 269-295 · Zbl 0456.65017 · doi:10.1016/0024-3795(80)90169-X
[13] Saad, Y. (1982): Projection method for solving large sparse eigenvalue problems. Matrix pensils. Lect. Notes Math. 973. Springer, Berlin Heidelberg New York, pp. 121-144
[14] Saad, Y. (1984): Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems. Math. Comput.42, 567-588 · Zbl 0539.65013 · doi:10.1090/S0025-5718-1984-0736453-8
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.