Pages that link to "Item:Q4880261"

The following pages link to A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems (Q4880261):

Displaying 50 items.

• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems (Q966098) (← links)
• Saving flops in LU based shift-and-invert strategy (Q989130) (← links)
• Reducing huge gyroscopic eigenproblems by automated multi-level substructuring (Q1020250) (← links)
• Exploiting structure in large-scale electrical circuit and power system problems (Q1025851) (← links)
• Preconditioning constrained eigenvalue problems (Q1025859) (← links)
• An SVD-approach to Jacobi-Davidson solution of nonlinear Helmholtz eigenvalue problems (Q1025863) (← links)
• A Jacobi-Davidson type method for the generalized singular value problem (Q1025866) (← links)
• On correction equations and domain decomposition for computing invariant subspaces (Q1033447) (← links)
• A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem (Q1042819) (← links)
• Quantum field induced strains in nanostructures and prospects for optical actuation (Q1043429) (← links)
• Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling (Q1275165) (← links)
• Finite difference schemes and block Rayleigh quotient iteration for electronic structure calculations on composite grids (Q1282381) (← links)
• Eigenvalue perturbation and generalized Krylov subspace method (Q1294463) (← links)
• Restrictions on implicit filtering techniques for orthogonal projection methods (Q1301271) (← links)
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (Q1301301) (← links)
• Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method (Q1383040) (← links)
• Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices (Q1399640) (← links)
• Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix. (Q1406278) (← links)
• A projection method for generalized eigenvalue problems using numerical integration. (Q1410848) (← links)
• New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem (Q1578093) (← links)
• Composite orthogonal projection methods for large matrix eigenproblems (Q1585577) (← links)
• Eigenvalue computation in the 20th century (Q1591174) (← links)
• Preconditioning eigenvalues and some comparison of solvers (Q1591177) (← links)
• The trace minimization method for the symmetric generalized eigenvalue problem (Q1591180) (← links)
• A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient (Q1595116) (← links)
• The Sylvester equation and approximate balanced reduction (Q1611928) (← links)
• Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation (Q1643856) (← links)
• A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems (Q1651310) (← links)
• A combination of the fast multipole boundary element method and Krylov subspace recycling solvers (Q1655001) (← links)
• Some progress on parallel modal and vibration analysis using the JAUMIN framework (Q1665097) (← links)
• Deflated BiCG with an application to model reduction (Q1665503) (← links)
• Convergence of integration-based methods for the solution of standard and generalized Hermitian eigenvalue problems (Q1670229) (← links)
• The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence (Q1677471) (← links)
• Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation (Q1682522) (← links)
• A hybrid Jacobi-Davidson method for interior cluster eigenvalues with large null-space in three dimensional lossless drude dispersive metallic photonic crystals (Q1682682) (← links)
• Computing the smallest eigenpairs of the graph Laplacian (Q1742851) (← links)
• On the convergence rate of DGMRES (Q1754438) (← links)
• A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (Q1855433) (← links)
• On the use of harmonic Ritz pairs in approximating internal eigenpairs (Q1855434) (← links)
• Two-sided and alternating Jacobi-Davidson (Q1855437) (← links)
• The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action (Q1855446) (← links)
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices (Q1862016) (← links)
• Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices (Q1871007) (← links)
• An inverse iteration method using multigrid for quantum chemistry (Q1923872) (← links)
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems (Q1923881) (← links)
• A refined Arnoldi type method for large scale eigenvalue problems (Q1943090) (← links)
• Computing extremal eigenvalues for three-dimensional photonic crystals with wave vectors near the Brillouin zone center (Q1955924) (← links)
• Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits (Q1965174) (← links)
• Eigenmode solution of 2-D and 3-D electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm (Q1971406) (← links)
• Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations (Q1976920) (← links)