scientific article; zbMATH DE number 766233
From MaRDI portal
Publication:4836671
zbMath0825.65034MaRDI QIDQ4836671
Publication date: 21 June 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergencepreconditioneralgebraic eigenvalue problemsubspace iterationsRayleigh- Ritz methodTemple-Lehmann two- sided estimatesvector iterations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Convergence theory for preconditioned eigenvalue solvers in a nutshell, Cluster robustness of preconditioned gradient subspace iteration eigensolvers, Cluster robust error estimates for the Rayleigh-Ritz approximation. I: Estimates for invariant subspaces, Cluster robust error estimates for the Rayleigh-Ritz approximation II: Estimates for eigenvalues, Convergence Analysis of Restarted Krylov Subspace Eigensolvers, The approximation of the Maxwell eigenvalue problem using a least-squares method, Iterative minimization of the Rayleigh quotient by block steepest descent iterations, Rayleigh--Ritz Majorization Error Bounds of Mixed Type, Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers, Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers, New estimates for Ritz vectors, Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, A block Chebyshev-Davidson method for linear response eigenvalue problems, Sharp Ritz value estimates for restarted Krylov subspace iterations, Local two-sided bounds for eigenvalues of self-adjoint operators, Projection sparse principal component analysis: an efficient least squares method, Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods, On preconditioned eigensolvers and invert-Lanczos processes, Preconditioned gradient iterations for the eigenproblem of definite matrix pairs, Cluster robust estimates for block gradient-type eigensolvers, Domain decomposition methods for eigenvalue problems, Kron's method for symmetric eigenvalue problems, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem
