Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
DOI10.1006/jcph.1998.6064zbMath0922.65026OpenAlexW2027197957MaRDI QIDQ1275165
Arden Ruttan, Daniela Calvetti, Lothar Reichel, James Baglama
Publication date: 17 January 1999
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.1998.6064
numerical examplesdifference schemespreconditionersextreme eigenvaluesimplicitly restarted block Lanczos methodliquid crystals Newton's methodsubspace iterations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Estimates of eigenvalues in context of PDEs (35P15) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical methods in bifurcation problems. Lectures delivered at the Indian Institute of Science, Bangalore, under the T.I.F.R.-I.I.Sc. Programme in Applications of Mathematics. Notes by A. K. Nandakumaran and Mythily Ramaswamy
- Conjugate gradient methods for continuation problems
- Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Numerics of Gram-Schmidt orthogonalization
- A multishift QR iteration without computation of the shifts
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Implicitly Restarted Arnoldi Methods and Subspace Iteration
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATION
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- The Lanczos Algorithm with Selective Orthogonalization
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Algorithm 686: FORTRAN subroutines for updating the QR decomposition
- Finite Element Analysis of the Landau--de Gennes Minimization Problem for Liquid Crystals
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Numerical Determination of Fundamental Modes