Computation of a Few Small Eigenvalues of a Large Matrix with Application to Liquid Crystal Modeling

Journal of Computational Physics

Volumn 146, Issue 1, 1998, Pages 203-226

  Baglama, J ^a   Calvetti, D ^b   Reichel, L ^c   Ruttan, A ^c  

^a TEXAS TECH UNIVERSITY   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

^c KENT STATE UNIVERSITY   (United States)

Author keywords

Bifurcation; Block Lanczos method; Continuation method; Equilibrium configuration; Polynomial acceleration

Indexed keywords

BIFURCATION (MATHEMATICS); CONVERGENCE OF NUMERICAL METHODS; FREE ENERGY; LIQUID CRYSTALS; MATRIX ALGEBRA;

BIFURCATION; BLOCK LANCZOS METHOD; CONTINUATION METHOD; EIGEN-VALUE; EQUILIBRIUM CONFIGURATION; LIQUID-CRYSTALS; NULL SPACE; POLYNOMIAL ACCELERATION; SMALLEST EIGENVALUE; SPARSE SYMMETRIC MATRIXES;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0005532228     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.1998.6064     Document Type: Article

References (36)

1. Allgower E. L., Chien C.-S., Georg K., Wang C.-F. Conjugate gradient methods for continuation problems. J. Comput. Appl. Math. 38:1991;1.
2. Baglama J. Krylov Subspace Methods with Application to Liquid Crystal Modeling. 1997.
3. Baglama J., Calvetti D., Reichel L. Iterative methods for the computation of a few eigenvalues of a large symmetric matrix. BIT. 36:1996;400.
4. Bai Z., Demmel J. On a block implementation of Hessenberg QR iteration. Int'l J. High Speed Comput. 1:1989;97.
5. Björck Å. Numerics of Gram-Schmidt orthogonalization. Linear Algebra Appl. 197:1994;297.
6. Calvetti D., Reichel L., Sorensen D. C. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Elec. Trans. Numer. Anal. 2:1994;1.
7. Chatelin F. Eigenvalues of Matrices. 1993.
8. Davidson E. R. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comput. Phys. 17:1975;87.
9. T. A. Davis, E. G. Gartland, jr. Finite element analysis of the Landau-de Gennes minimization problem for liquid crystals, SIAM J. Numer. Anal.
10. Dubrulle A. A., Golub G. H. A multishift QR iteration without computation of the shifts. Numer. Algorithms. 7:1994;173.
11. Ericsson T., Ruhe A. The spectral transformation Lanczos method for the solution of large sparse symmetric generalized eigenvalue problems. Math. Comp. 35:1980;1251.
12. Farrell P. A., Ruttan A., Zeller R. R. Finite difference minimization of the Landau-de Gennes free energy for liquid crystals in rectangular regions. Comput. Appl. Math., I. 1992;137.
13. Flanders D. A., Shortley G. Numerical determination of fundamental modes. J. Appl. Phys. 21:1950;1326.
14. G. H. Golub, R. Underwood, The block Lanczos method for computing eigenvalues, Mathematical Software III, J. R. Rice, Academic Press, New York, 1977, 361.
15. Grimes R. G., Lewis J. L., Simon H. D. A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM J. Matrix Anal. 15:1994;228.
16. Huitfeldt J. Nonlinear Eigenvalue Problems - Prediction of Bifurcation Points and Branch Switching. 1991.
17. Keller H. B. Lectures on Numerical Methods in Bifurcation Problems. 1987.
18. Lehoucq R. B. Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration. 1995.
19. R. B. Lehoucq, K. J. Maschhoff, Implicitly Re-started Block Arnoldi Methods.
20. Lehoucq R. B., Sorensen D. C. Deflation techniques for an implicitly restarted Arnoldi iteration. SIAM J. Matrix Anal. Appl. 17:1996;789.
21. R. B. Lehoucq, D. C. Sorensen, P. A. Vu, C. Wang, ARPACK: An Implementation of an Implicitly Restarted Arnoldi Method for Computing Some of the Eigenvalues and Eigenvectors of a Large Sparse Matrix, 1996.
22. Leja F. Sur certaines suits liées aux ensemble plan et leur application à la representation conforme. Ann. Polon. Math. 4:1957;8.
23. Morgan R. B. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Math. Comp. 65:1996;1213.
24. Morgan R. B., Scott D. S. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Stat. Comput. 7:1986;817.
25. Murray C. R., Racine S. C., Davidson E. R. Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices. J. Comput. Phys. 103:1992;382.
26. Parlett B. N., Scott D. S. The Lanczos algorithm with selective orthogonalization. Math. Comp. 33:1979;311.
27. Priestly E. B., Wojyowicz P. J., Sheng P. Introduction to Liquid Crystals. 1975.
28. Reichel L., Gragg W. B. Algorithm 686: FORTRAN subroutines for updating the QR decomposition of a matrix. ACM Trans. Math. Software. 16:1990;369.
29. Ruhe A. Implementation aspect of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Math. Comp. 33:1979;680.
30. Saad Y. Numerical Methods for Large Eigenvalue Problems. 1992.
31. D. S. Scott, LASO2-FORTRAN Implementation of the Lanczos Process with Selective Orthogonalization.
32. Sleijpen G. L. G., van der Vorst H. A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17:1996;401.
33. Sorensen D. C. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13:1992;357.
34. Stoer J., Bulirsch R. Introduction to Numerical Analysis. 1993.
35. Virga E. G. Variational Theories for Liquid Crystals. 1994.
36. Zeller R. Parallel Numerical Solutions of the Landau-de Gennes Minimization Problem for Liquid Crystals in a Slab Geometry. 1993.