A Comparison of Solvers for Large Eigenvalue Problems Occuring in the Design of Resonant Cavities

Numerical Linear Algebra with Applications

Volumn 6, Issue 1, 1999, Pages 3-16

  Arbenz, Peter ^a   Geus, Roman ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Cavity resonator; Jacobi Davidson algorithm; Lanczos algorithm; Large sparse eigenvalue problem; Maxwell equations; Restarted Lanczos algorithm; Subspace iteration

Indexed keywords

EID: 0033472157     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199901/02)6:1<3::AID-NLA142>3.0.CO;2-I     Document Type: Article

References (33)

1. S. Adam, P. Arbenz and R. Geus. A comparison of solvers for large eigenvalue problems originating from Maxwell's equations. In M. Bubak and J. Mościński, editors, High Performance Computing on Hewlett-Packard Systems (HiPer '97), pages 235-244, Academic Computer Center, Cyfronet-Krakow, 1997.
2. S. Adam, P. Arbenz and R. Geus. Eigenvalue solvers for electromagnetic fields in cavities. Technical Report 275, ETH Zürich, Computer Science Department, October 1997. (Available at URL http://www.inf.ethz.ch/publications/).
3. P. Arbenz and R. Geus. Parallel solvers for large eigenvalue problems originating from Maxwell's equations. In D. Pritchard and J. Reeve, editors, Euro-Par '98: Parallel Processing, vol. 1470 of 'Lecture Notes in Computer Science', pages 771-779, Springer, Berlin, 1998.
4. P. Arbenz and R. Geus. Eigenvalue solvers for electromagnetic fields in cavities. In H.-J. Bungartz, F. Durst and Chr. Zenger, editors, High Performance Scientific and Engineering Computing, 'Lecture Notes in Computational Science and Engineering', pages 363-373, Springer, Berlin, 1999.
5. C. Ashcraft and R. Grimes. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Softw., 15, 291-309, 1989.
6. J. Baglama, D. Calvetti and L. Reichel. Iterative methods for the computation of a few eigenvalues of a large symmetric matrix. BIT, 36, 400-421, 1996.
7. R. Barret, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994. (Available from Netlib at URL http://www.netlib.org/templates/index.html).
8. S. C. Brenner. Preconditioning complicated finite elements by simple finite elements. SIAM J. Sci. Comput., 17, 1269-1274, 1996.
9. F. Brezzi and M. Fortin. Mixed and Hybrid Finite Element Methods. Springer Series in Computational Mathematics. Springer-Verlag, New York, 1991.
10. D. Calvetti, L. Reichel and D. C. Sorensen. An implicitely restarted Lanczos method for large symmetric eigenvalue problems. Electronic Trans. Numer. Anal., 2, 1-21, 1994.
11. P. G. Ciarlet. The Finite Element Method for Elliptic Problems, Studies in Mathematics and its Applications, North-Holland, Amsterdam, 1978.
12. T. Ericsson. Implementation and applications of the spectral transformation Lanczos algorithm. In B. Kågström and A. Ruhe, editors, Matrix Pencils, Vol. 973 of Lecture Notes in Mathematics, pages 177-188, Springer, Berlin, 1983.
13. D. R. Fokkema, G. L. G. Sleijpen and H. A. van der Vorst. Generalized conjugate gradient squared. J. Comput. Appl. Math., 71, 125-146, 1996.
14. D. R. Fokkema, G. L. G. Sleijpen and H. A. van der Vorst. Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils. SIAM J. Sci. Comput., 20, 94-125, 1998.
15. V. Girault and P.-A. Raviart. Finite Element Methods for the Navier-Stokes Equations. Springer Series in Computational Mathematics. Vol. 5 of Springer-Verlag, Berlin, 1986.
16. R. Grimes, J. G. Lewis and H. Simon. A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM J. Matrix Anal. Appl., 15, 228-272, 1994.
17. HP MLIB VECLIB User's Guide, 2nd edition, Hewlett-Packard Company, Document No. B5649-90003, Convex Division, Richardson, TX. January 1997. Title of first edition: ConvexMLIB User's Guide: VECLIB.
18. J. D. Jackson. Classical Electrodynamics, 2nd edition, Wiley, New York, 1975.
19. J. Jin. The Finite Element Method in Electromagnetics. Wiley, New York, 1993.
20. F. Kikuchi. Mixed and penalty formulations for finite element analysis of an eigenvalue problem in electromagnetism. Comput. Methods Appl. Mech. Eng., 64, 509-521, 1987.
21. R. B. Lehoucq and J. A. Scott. An evaluation of software for computing eigenvalues of sparse nonsymmetric matrices. Preprint MCS-P547-1195, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, January 1996. (Available at URL ftp://info.mcs.anl.gov/pub/tech_reports/reports/P547.ps.Z).
22. R. B. Lehoucq, D. C. Sorensen and C. Yang. ARPA CK Users' Guide: Solution of Large Scale Eigenvalue Problems by Implicitely Restarted Arnoldi Methods, Department of Mathematical Sciences, Rice University, Houston TX, October 1997. (The software and this guide are available at URL ftp://ftp.caam.rice.edu/pub/software/ARPACK/).
23. R. Leis. Zur Theorie elektromagnetischer Schwingungen in anisotropen Medien. Math. Z., 106, 213-224, 1968.
24. K. Meerbergen and D. Roose. Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems. IMA J. Numer. Anal., 16, 297-346, 1996.
25. 3. Numer. Math., 35, 315-341, 1980.
26. B. Nour-Omid, B. N. Parlett, T. Ericsson and P. S. Jensen. How to implement the spectral transformation. Math. Comp., 48(178), 663-673, 1987.
27. C. C. Paige and M. A. Saunders. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal., 12, 617-629, 1975.
28. B. N. Parlett. The Symmetric Eigenvalue Problem, Prentice Hall, Englewood Cliffs, NJ, 1980.
29. H. Rutishauser. Simultaneous iteration method for symmetric matrices. Numer. Math., 16, 205-223, 1970. Reprinted in: J. H. Wilkinson and C. Reinsch, editors, Linear Algebra, pages 284-301, Springer, Berlin, 1971.
30. H. Rutishauser. Simultaneous iteration method for symmetric matrices. Numer. Math., 16, 205-223, 1970. Reprinted in: J. H. Wilkinson and C. Reinsch, editors, Linear Algebra, pages 284-301, Springer, Berlin, 1971.
31. G. L. G. Sleijpen, A. G. L. Booten, D. R. Fokkema and H. A. van der Vorst. Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT, 36, 595-633, 1996.
32. G. L. G. Sleijpen and H. A. van der Vorst. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl., 17, 401-425, 1995.
33. D. Sorensen. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl., 13, 357-385, 1992.