Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
From MaRDI portal
Publication:5317830
DOI10.1002/NLA.246zbMATH Open1071.65516OpenAlexW2142184851MaRDI QIDQ5317830FDOQ5317830
Authors: Yvan Notay 
Publication date: 21 September 2005
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.246
Recommendations
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Controlling inner iterations in the Jacobi-Davidson method
- The Jacobi-Davidson method
- Preconditioned inexact Jacobi-Davidson method for large symmetric eigenvalue problems
Cites Work
- Templates for the Solution of Algebraic Eigenvalue Problems
- Title not available (Why is that?)
- The Geometry of Algorithms with Orthogonality Constraints
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Title not available (Why is that?)
- A class of first order factorization methods
- Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
- Title not available (Why is that?)
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Upper eigenvalue bounds for pencils of matrices
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- The Davidson Method
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Inexact inverse iteration for generalized eigenvalue problems
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Title not available (Why is that?)
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- Subspace iterative methods for eigenvalue problems
- Optimal Order Preconditioning of Finite Difference Matrices
Cited In (43)
- Jacobi-Davidson method on low-rank matrix manifolds
- Efficient computation of matrix power-vector products: application for space-fractional diffusion problems
- Title not available (Why is that?)
- Generalized Block Tuned Preconditioners for SPD Eigensolvers
- A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods
- Computing the smallest eigenpairs of the graph Laplacian
- A Rayleigh-Ritz style method for large-scale discriminant analysis
- On the positivity of the coefficients of a certain polynomial defined by two positive definite matrices
- 3-D nested eigenanalysis on finite element grids
- A Jacobi--Davidson Method for Solving Complex Symmetric Eigenvalue Problems
- Cluster robustness of preconditioned gradient subspace iteration eigensolvers
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Jacobi Correction Equation, Line Search, and Conjugate Gradients in Hermitian Eigenvalue Computation II: Computing Several Extreme Eigenvalues
- Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation
- An extended basis inexact shift-invert Lanczos for the efficient solution of large-scale generalized eigenproblems
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
- A sequential subspace projection method for linear symmetric eigenvalue problem
- A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- Deflation by restriction for the inverse-free preconditioned Krylov subspace method
- On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model
- On global convergence of subspace projection methods for Hermitian eigenvalue problems
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- An out-of-core eigen-solver with OpenMP parallel scheme for large spare damped system
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
- Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- A new justification of the Jacobi-Davidson method for large eigenproblems
- The Jacobi-Davidson method
- A solution procedure for constrained eigenvalue problems and its application within the structural finite-element code NOSA-ITACA
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- On local quadratic convergence of inexact simplified Jacobi-Davidson method
- Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations
- Jacobi algorithm for symmetric eigenvalue problem and integrable gradient system of Lax form
- A truncated-CG style method for symmetric generalized eigenvalue problems
Uses Software
This page was built for publication: Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317830)
