Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems. (English) Zbl 0859.65031
It is proposed that eigenvalues of a large non-Hermitian matrix are computed by first applying an \(r^*r\) block Arnoldi algorithm, and then using the computed Ritz values to determine an ellipse that has those eigenvalues sought on its outside. Then this ellipse is used to determine a Chebyshev acceleration that is applied to the \(r\) leading Ritz vectors obtained from Arnoldi. The technique is tested on 2 applied problems, an Orr-Sommerfeld operator and one of the test matrices from the Harwell-Boeing collection.
Reviewer: A.Ruhe (Göteborg)
MSC:
| 65F15 | Numerical computation of eigenvalues and eigenvectors of matrices |
Keywords:
eigenvalues; large non-Hermitian matrix; block Arnoldi algorithm; Ritz values; Chebyshev acceleration; Ritz vectors; Orr-Sommerfeld operator; Harwell-Boeing collectionReferences:
| [1] | Chatelin, F., Ho, D., and Bennani, M.Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices. Mathematical Modelling and Numerical Analysis1 (1990), pp. 53–65. · Zbl 0695.65020 |
| [2] | Duff, I. S., Grimes, R. G., and Lewis, J. G.Sparse matrix test problems. ACM Trans. Math. Softw.15 (1989), pp. 1–14. · Zbl 0667.65040 · doi:10.1145/62038.62043 |
| [3] | Fischer, B. and Freund, R.Chebyshev polynomials are not always optimal. J. Approximation Theory65 (1991), pp. 261–273. · Zbl 0738.41027 · doi:10.1016/0021-9045(91)90091-N |
| [4] | Heuveline, V.Polynomial acceleration in the complex plane. Technical report, Irisa/Inria, 1995. |
| [5] | Ho, D.Tchebychev acceleration technique for large scale nonsymmetric matrices. Numer. Math.56 (1990), pp. 721–734. · Zbl 0684.65032 · doi:10.1007/BF01405199 |
| [6] | Kerner, W.Large-scale complex eigenvalue problems. J. Comp. Phys.85 (1989), pp. 1–85. · Zbl 0685.65028 · doi:10.1016/0021-9991(89)90200-3 |
| [7] | Manteuffel, T. A.The Tchebychev iteration for nonsymmetric linear system. Numer. Math.28 (1977), pp. 307–327. · Zbl 0361.65024 · doi:10.1007/BF01389971 |
| [8] | Manteuffel, T. A.Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration. Numer. Math.31 (1978), pp. 183–208. · Zbl 0413.65032 · doi:10.1007/BF01397475 |
| [9] | Moler, C. B. and Stewart, G. W.An algorithm for generalized matrix eigenvalue problems. SIAM J. Num. Anal.10 (1973), pp. 241–256. · Zbl 0253.65019 · doi:10.1137/0710024 |
| [10] | Rivlin, T. J.The Chebyshev polynomials: from approximation theory to algebra and number theory. J. Wiley and Sons Inc., New-York, 1990. · Zbl 0734.41029 |
| [11] | Saad, Y.Numerical methods for large eigenvalue problems. Algorithms and architectures for advanced scientific computing. Manchester University Press, Manchester, 1992. |
| [12] | Sadkane, M.A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Numer. Math.64 (1993), pp. 181–193. · Zbl 0791.65020 · doi:10.1007/BF01388686 |
| [13] | Yamamoto, Y. and Ohtsubo, H.Subspace iteration accelerated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices. Int. J. Numer. Methods Eng.10 (1976), pp. 935–944. · Zbl 0325.65017 · doi:10.1002/nme.1620100418 |
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.
