A Comparison of Factorization-Free Eigensolvers with Application to Cavity Resonators
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Algorithm 845: EIGIFP: a MATLAB program for solving large symmetric generalized eigenvalue problems
ACM Transactions on Mathematical Software (TOMS)
Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Journal of Computational Physics
Journal of Computational Physics
International Journal of Computational Science and Engineering
State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
Journal of Computational Physics
Accelerating configuration interaction calculations for nuclear structure
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
Journal of Computational Physics
KSSOLV—a MATLAB toolbox for solving the Kohn-Sham equations
ACM Transactions on Mathematical Software (TOMS)
High Performance Computing for Computational Science - VECPAR 2008
Anasazi software for the numerical solution of large-scale eigenvalue problems
ACM Transactions on Mathematical Software (TOMS)
Journal of Computational Physics
Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
ACM Transactions on Mathematical Software (TOMS)
Journal of Computational and Applied Mathematics
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Journal of Computational Physics
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
PRIMME: preconditioned iterative multimethod eigensolver—methods and software description
ACM Transactions on Mathematical Software (TOMS)
Journal of Computational Physics
Deflated block Krylov subspace methods for large scale eigenvalue problems
Journal of Computational and Applied Mathematics
Fast large-scale spectral clustering by sequential shrinkage optimization
ECIR'07 Proceedings of the 29th European conference on IR research
International Journal of High Performance Computing Applications
A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
Journal of Computational Physics
SIAM Journal on Scientific Computing
On the modification of an eigenvalue problem that preserves an eigenspace
Journal of Computational and Applied Mathematics
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Journal of Computational Physics
Fast spectral clustering of data using sequential matrix compression
ECML'06 Proceedings of the 17th European conference on Machine Learning
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
An implicit riemannian trust-region method for the symmetric generalized eigenproblem
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Nonrigid embeddings for dimensionality reduction
ECML'05 Proceedings of the 16th European conference on Machine Learning
Towards a dynamic data driven application system for wildfire simulation
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Experience in developing an open source scalable software infrastructure in japan
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
An h-adaptive finite element solver for the calculations of the electronic structures
Journal of Computational Physics
SIAM Journal on Numerical Analysis
Original Article: Adaptive BDDC in three dimensions
Mathematics and Computers in Simulation
Banded target matrices and recursive FSAI for parallel preconditioning
Numerical Algorithms
Computers & Mathematics with Applications
Exploring the future of out-of-core computing with compute-local non-volatile memory
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
ACM Transactions on Mathematical Software (TOMS)
A Rayleigh-Ritz style method for large-scale discriminant analysis
Pattern Recognition
Hi-index | 0.05 |
We describe new algorithms of the locally optimal block preconditioned conjugate gradient (LOBPCG) method for symmetric eigenvalue problems, based on a local optimization of a three-term recurrence, and suggest several other new methods. To be able to compare numerically different methods in the class, with different preconditioners, we propose a common system of model tests, using random preconditioners and initial guesses. As the "ideal" control algorithm, we advocate the standard preconditioned conjugate gradient method for finding an eigenvector as an element of the null-space of the corresponding homogeneous system of linear equations under the assumption that the eigenvalue is known. We recommend that every new preconditioned eigensolver be compared with this "ideal" algorithm on our model test problems in terms of the speed of convergence, costs of every iteration, and memory requirements. We provide such comparison for our LOBPCG method. Numerical results establish that our algorithm is practically as efficient as the ``ideal'' algorithm when the same preconditioner is used in both methods. We also show numerically that the LOBPCG method provides approximations to first eigenpairs of about the same quality as those by the much more expensive global optimization method on the same generalized block Krylov subspace. We propose a new version of block Davidson's method as a generalization of the LOBPCG method. Finally, direct numerical comparisons with the Jacobi--Davidson method show that our method is more robust and converges almost two times faster.