Pages that link to "Item:Q1855433"
From MaRDI portal
The following pages link to A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (Q1855433):
Displaying 34 items.
- An indefinite variant of LOBPCG for definite matrix pencils (Q403080) (← links)
- Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems (Q557926) (← links)
- Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization (Q618775) (← links)
- A spectral scheme for Kohn-Sham density functional theory of clusters (Q729158) (← links)
- A truncated-CG style method for symmetric generalized eigenvalue problems (Q818183) (← links)
- A new justification of the Jacobi-Davidson method for large eigenproblems (Q886146) (← links)
- Computation of eigenvalues by numerical upscaling (Q888523) (← links)
- Adaptive eigenvalue computation: Complexity estimates (Q958152) (← links)
- On preconditioned eigensolvers and invert-Lanczos processes (Q999788) (← links)
- Increasing efficiency of inverse iteration (Q1041310) (← links)
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems (Q1044859) (← links)
- Sharp Ritz value estimates for restarted Krylov subspace iterations (Q1744300) (← links)
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (Q1855433) (← links)
- Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems (Q2052458) (← links)
- Approximation of positive semidefinite nonlinear eigenvalue problems (Q2091497) (← links)
- Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses (Q2309393) (← links)
- An unconstrained global optimization framework for real symmetric eigenvalue problems (Q2311812) (← links)
- Convergence theory for preconditioned eigenvalue solvers in a nutshell (Q2362287) (← links)
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases (Q2368743) (← links)
- Cluster robustness of preconditioned gradient subspace iteration eigensolvers (Q2368744) (← links)
- Preconditioned iterative methods for a class of nonlinear eigenvalue problems (Q2368747) (← links)
- Continuous methods for symmetric generalized eigenvalue problems (Q2465327) (← links)
- Inexact inverse iteration for symmetric matrices (Q2496620) (← links)
- THE HYPERBOLIC QUADRATIC EIGENVALUE PROBLEM (Q2941129) (← links)
- Iterative minimization of the Rayleigh quotient by block steepest descent iterations (Q2948072) (← links)
- Convergence Analysis of Restarted Krylov Subspace Eigensolvers (Q3185675) (← links)
- Guaranteed lower bounds for eigenvalues (Q3189441) (← links)
- The Jacobi-Davidson method (Q3603888) (← links)
- Cluster robust estimates for block gradient-type eigensolvers (Q5226658) (← links)
- The preconditioned inverse iteration for hierarchical matrices (Q5397309) (← links)
- Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem (Q5886234) (← links)
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers (Q6146165) (← links)
- A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems (Q6175730) (← links)
- Computation of the leading eigenvalue and the corresponding eigenelement of eigenvalue problems with nonlinear dependence on the spectral parameter (Q6640569) (← links)