Arnoldi-Faber method for large non hermitian eigenvalue problems

Electronic Transactions on Numerical Analysis

Volumn 5, Issue , 1997, Pages 62-76

  Heuveline, Vincent ^a   Sadkane, Miloud ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITÉ DE BRETAGNE OCCIDENTALE   (France)

Author keywords

Block Arnoldi; Faber polynomials; Krylov space; Schwarz Christoffel

Indexed keywords

EID: 1642387280     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. A. J. CLAYTON, Further results on polynomials having least maximum modulus over an ellipse in the complex plane, UKAEA Memorandum, AEEW, 1963.
3. T. K. DELILLO AND A. R. ELCRAT, Numerical conformal mapping methods for exterior regions with corners, J. Comput. Phys., 108 (1993), pp. 199-208.
4. T. A. DRISCOLL, A Matlab toolbox for Schwarz-Christoffel mapping, ACM Trans. Math. Software, 22 (1996), pp. 168-186.
5. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
6. M. EIERMANN, On semiiterative methods generated by Faber polynomials, Numer. Math., 56 (1989), pp. 139-156.
7. G. FABER, Über polynomische Entwicklungen, Math. Ann., 57 (1903), pp. 389-408.
8. B. FISCHER AND J. MODERSITZKI, An algorithm for complex linear approximation based on semi-infinite programming, in Algorithms for Approximation 5, M.G. Cox et al., eds, J. C. Baltzer AG, 1993, pp. 287-297.
9. B. FISCHER AND R. W. FREUND, Chebyshev polynomials are not always optimal, J. Approx. Theory, 65 (1991), pp. 261-272.
10. J. M. FLORYAN AND C. ZEMACH, Schwarz-Christoffel mappings: A general approach, J. Comput. Phys., 72 (1987), pp. 347-371.
11. K. GLASHOFF AND K. ROLEFF, A new method for Chebyshev approximation of complex-valued functions, Math. Comp., 36 (1981), pp. 233-239.
12. G. H. GOLUB AND C. F. VAN LOAN, Matrix computations, 2nd ed., The Johns Hopkins University Press, Baltimore, 1989.
13. U. GROTHKOPF AND G. OPFER, Complex Chebyshev polynomials on circular sectors with degree six or less, Math, of Comp., 39 (1982), pp. 599-615.
14. D. HO, F. CHATELIN, AND M. BENNANI, Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices, RAIRO Modél. Math. Anal. Numér, 24 (1990), pp. 53-65.
15. P. HENRICI, Applied and computational complex analysis III, Wiley, New York London Sydney Toronto, 1986.
16. D. HO, Tchebychev acceleration technique for large scale nonsymmetric matrices, Numer. Math., 86 (1990), pp. 721-734.
17. V. HEUVELINE AND M. SADKANE, Chebyshev acceleration techniques for large complex non hermitian eigenvalue problems, Reliab. Comput, 2 (1996), pp. 111-118.
18. L. H. HOWELL AND L. N. TREFETHEN, A modified Schwarz-Christoffel transformation for elongated regions, SIAM J. Sci. Stat. Comput., 11 (1990), pp. 928-949.
19. W. KERNER, Large-scale complex eigenvalue problems, J. Comput. Phys., 85 (1989), pp. 1-85.
20. R. B. LEHOUCQ, D. C. SORENSEN AND C. YANG, ARPACK Users Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods, 1996. Available from netlib@ornl.gov under the directory scalapack.
21. A. I. MARKUSHEVICH, Theory of functions of a complex variable I Prentice-Hall, 1965.
22. A. I. MARKUSHEVICH, Theory of functions of a complex variable III, Prentice-Hall, 1965.
23. K. MEERBERGEN AND D. ROOSE, Matrix transformations for computing rightmost eigenvalues of large nonsymmetric matrices, IMA J. Numer. Anal., 16 (1996), pp. 297-346.
24. S. O'DONNELL AND V. ROHKLIN, A fast algorithm for the numerical evaluation of conformal mapping, SIAM J. Sci. Stat. Comput., 10 (1989), pp. 475-487.
25. G. OPFER AND G. SCHOBER, Richardson's iteration for nonsymmetric matrices, Linear Algebra Appl., 58 (1984), pp. 343-361.
26. N. Papamichael, C. Kokkinos, and M. Warby. Numerical techniques for conformal mapping onto a rectangle, J. Comput. Appl. Math., 20 (1987), pp. 349-358.
27. M. J. D. POWELL, A Fortran subroutine for solving systems of non-linear algebraic equations, AERE-R 5947, Harwell, England, 1968.
28. Y. SAAD, Projection method for solving large sparse eigenvalue problems, in Matrix Pencils, Lect. Notes Math., B. Kågström and A. Ruhe, eds., Springer-Verlag, 973 (1982), pp. 121-144.
29. Y. SAAD, Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems, Math. Comp., 42 (1984), pp. 567-588.
30. Y. SAAD, Numerical methods for large eigenvalue problems, Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press, Manchester, UK, 1992.
31. M. SADKANE, A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices, Numer. Math., 64 (1993), pp. 181-193.
32. D.C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
33. G. STARKE, R. S. VARGA, A hybrid Arnoldi-Faber method for nonsymmetric systems of linear equations, Numer. Math., 64 (1993), pp. 213-240.
34. L. N. TREFETHEN, Numerical computation of the Schwarz-Christoffel transformation, SIAM J. Sci. Stat. Comput., 1 (1980), pp. 82-101.
35. L. N. TREFETHEN, SCPACK user's guide, Technical Report 89-2, MIT Numerical Analysis Report, 1989.