A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
From MaRDI portal
Publication:4880261
DOI10.1137/S0895479894270427zbMATH Open0860.65023MaRDI QIDQ4880261FDOQ4880261
Authors: Gerard L. G. Sleijpen, Henk A. van der Vorst 
Publication date: 22 August 1996
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
algorithmpreconditionersmallest eigenvaluelarge symmetric matrixJacobi-Davidson iteration methodshift invert iteration
Cited In (only showing first 100 items - show all)
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
- Reducing huge gyroscopic eigenproblems by automated multi-level substructuring
- A survey on variational characterizations for nonlinear eigenvalue problems
- Generalized Block Tuned Preconditioners for SPD Eigensolvers
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- Residuals of refined projection methods for large matrix eigenproblems
- A Newton-type method with nonequivalence deflation for nonlinear eigenvalue problems arising in photonic crystal modeling
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
- Computing the smallest eigenpairs of the graph Laplacian
- A Jacobi-Davidson type method for computing real eigenvalues of the quadratic eigenvalue problem
- On the convergence rate of DGMRES
- Saving flops in LU based shift-and-invert strategy
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
- Nonlinear eigenvalue and frequency response problems in industrial practice
- Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation
- Regularity and hp discontinuous Galerkin finite element approximation of linear elliptic eigenvalue problems with singular potentials
- Eigenvalue perturbation and generalized Krylov subspace method
- Restrictions on implicit filtering techniques for orthogonal projection methods
- Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification
- Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems
- A combination of the fast multipole boundary element method and Krylov subspace recycling solvers
- Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation
- An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
- Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method
- Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations.
- A Jacobi-Davidson type method for the generalized singular value problem
- Exploiting structure in large-scale electrical circuit and power system problems
- Preconditioning constrained eigenvalue problems
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- Deflated BiCG with an application to model reduction
- Convergence of integration-based methods for the solution of standard and generalized Hermitian eigenvalue problems
- Optimal expansion of subspaces for eigenvector approximations
- Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
- A hybrid Jacobi-Davidson method for interior cluster eigenvalues with large null-space in three dimensional lossless drude dispersive metallic photonic crystals
- Quantum field induced strains in nanostructures and prospects for optical actuation
- A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
- An inverse iteration method using multigrid for quantum chemistry
- Instability of time-dependent wind-driven ocean gyres
- Structured Eigenvalue Problems
- Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
- Preconditioned inexact Jacobi-Davidson method for large symmetric eigenvalue problems
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Title not available (Why is that?)
- Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation
- Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix
- A parallel polynomial Jacobi-Davidson approach for dissipative acoustic eigenvalue problems
- Numerical simulation of three dimensional pyramid quantum dot
- On the use of harmonic Ritz pairs in approximating internal eigenpairs
- Title not available (Why is that?)
- Finite element Hartree-Fock calculations in three dimensions for atoms and small molecules
- A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations.
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- Iterative projection methods for computing relevant energy states of a quantum dot
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
- Alternative correction equations in the Jacobi-Davidson method
- Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- Preconditioning eigenvalues and some comparison of solvers
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- Efficient solution of the simplified \(P_N\) equations
- On convergence of iterative projection methods for symmetric eigenvalue problems
- A refined Jacobi-Davidson method and its correction equation
- Solving the vibrational Schrödinger equation on an arbitrary multidimensional potential energy surface by the finite element method
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- Variational calculations of structures and energetics in very floppy trimers: a new computational implementation
- Global infimum of strictly convex quadratic functions with bounded perturbations
- Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
- The nonlinear eigenvalue problem
- On correction equations and domain decomposition for computing invariant subspaces
- Bifurcation analysis of a two-component Bose-Einstein condensate
- Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits
- Eigenmode solution of 2-D and 3-D electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- Computing extremal eigenvalues for three-dimensional photonic crystals with wave vectors near the Brillouin zone center
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Exploiting Multilevel Preconditioning Techniques in Eigenvalue Computations
- Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
- A finite integration method for conformal, structured-grid, electromagnetic simulation
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Is Jacobi--Davidson Faster than Davidson?
- Title not available (Why is that?)
- Subspace iteration methods with preconditioning for eigenvalues of very large matrices
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
- A new justification of the Jacobi-Davidson method for large eigenproblems
- A fully implicit model of the three-dimensional thermohaline ocean circulation
- On the subspace projected approximate matrix method.
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- The Jacobi-Davidson method
- An efficient contour integral based eigensolver for 3D dispersive photonic crystal
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
Uses Software
This page was built for publication: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880261)
