A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
From MaRDI portal
(Redirected from Publication:1855433)
Recommendations
- A geometric theory for preconditioned inverse iteration applied to a subspace
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
- scientific article; zbMATH DE number 766233
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- Convergence of inexact inverse iteration with application to preconditioned iterative solvers
Cites work
- scientific article; zbMATH DE number 4018232 (Why is no real title available?)
- scientific article; zbMATH DE number 125015 (Why is no real title available?)
- scientific article; zbMATH DE number 766233 (Why is no real title available?)
- scientific article; zbMATH DE number 919117 (Why is no real title available?)
- scientific article; zbMATH DE number 4197271 (Why is no real title available?)
- scientific article; zbMATH DE number 3231501 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A geometric theory for preconditioned inverse iteration applied to a subspace
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- A gradient method for the matrix eigenvalue problem Ax = Bx
- A subspace preconditioning algorithm for eigenvector/eigenvalue computation
- An efficient method for band structure calculations in 2D photonic crystals
- An efficient method for band structure calculations in 3D photonic crystals
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures: A paradigm in three dimensions
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- Iteration methods in eigenvalue problems
- Minimization of the computational labor in determining the first eigenvalues of differential operators
- New iterative methods for solution of the eigenproblem
- On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem
- On the convergence of the modified method of steepest descent in the calculation of eigenvalues
- On the convergence rate of a preconditioned subspace eigensolver
- Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
- Preconditioned Lanczos Methods for the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
- Preconditioning eigensolvers -- an Oxymoron?
- Preconditioning eigenvalues and some comparison of solvers
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- Simultaneous iteration for the matrix eigenvalue problem
- Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization
- Subspace iterative methods for eigenvalue problems
- Successive eigenvalue relaxation: A new method for the generalized eigenvalue problem and convergence estimates
- Templates for the Solution of Algebraic Eigenvalue Problems
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- The site of termination of afferent fibres in the caudate nucleus
- The trace minimization method for the symmetric generalized eigenvalue problem
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(40)- Cluster robust estimates for block gradient-type eigensolvers
- An indefinite variant of LOBPCG for definite matrix pencils
- Approximation of positive semidefinite nonlinear eigenvalue problems
- Convergence theory for preconditioned eigenvalue solvers in a nutshell
- Preconditioned iterative methods for a class of nonlinear eigenvalue problems
- Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
- Inexact inverse iteration for symmetric matrices
- Iterative minimization of the Rayleigh quotient by block steepest descent iterations
- Sharp Ritz value estimates for restarted Krylov subspace iterations
- A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems
- Convergence analysis of restarted Krylov subspace eigensolvers
- Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
- A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
- A geometric theory for preconditioned inverse iteration. II: Convergence estimates
- On preconditioned eigensolvers and invert-Lanczos processes
- Cluster robustness of preconditioned gradient subspace iteration eigensolvers
- Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers
- Adaptive eigenvalue computation: Complexity estimates
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Towards solving large-scale topology optimization problems with buckling constraints at the cost of linear analyses
- Convergence Analysis of Newton–Schur Method for Symmetric Elliptic Eigenvalue Problem
- Continuous methods for symmetric generalized eigenvalue problems
- Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
- A geometric theory for preconditioned inverse iteration applied to a subspace
- Computation of eigenvalues by numerical upscaling
- Computation of the leading eigenvalue and the corresponding eigenelement of eigenvalue problems with nonlinear dependence on the spectral parameter
- Increasing efficiency of inverse iteration
- A new justification of the Jacobi-Davidson method for large eigenproblems
- A spectral scheme for Kohn-Sham density functional theory of clusters
- scientific article; zbMATH DE number 766233 (Why is no real title available?)
- The hyperbolic quadratic eigenvalue problem
- Guaranteed lower bounds for eigenvalues
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- The Jacobi-Davidson method
- A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases
- Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems
- An unconstrained global optimization framework for real symmetric eigenvalue problems
- A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
- The preconditioned inverse iteration for hierarchical matrices
- A truncated-CG style method for symmetric generalized eigenvalue problems
This page was built for publication: A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855433)
