Cluster robust estimates for block gradient-type eigensolvers

DOI10.1090/MCOM/3446zbMATH Open1416.65100OpenAlexW2924548112WikidataQ128176746 ScholiaQ128176746MaRDI QIDQ5226658FDOQ5226658

Authors: Ming Zhou, Klaus Neymeyr 

Publication date: 1 August 2019

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d2052fdcd9bb4848a6f67390b73721ec715f860d

Recommendations

• Cluster robustness of preconditioned gradient subspace iteration eigensolvers
• Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers
• Convergence of the block Lanczos method for eigenvalue clusters
• scientific article; zbMATH DE number 1760071
• Cluster robust error estimates for the Rayleigh-Ritz approximation II: Estimates for eigenvalues
• scientific article; zbMATH DE number 440688
• Robust eigenstructure clustering by non-smooth optimisation
• Randomized block Krylov methods for approximating extreme eigenvalues
• Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
• On Eigenvalue Estimates for Block Incomplete Factorization Methods

zbMATH Keywords

multigridRayleigh quotientelliptic eigenvalue problemcluster robustnessblock eigensolversgradient iterations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Cites Work

• Templates for the Solution of Algebraic Eigenvalue Problems
• Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
• Title not available (Why is that?)
• A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
• A geometric theory for preconditioned inverse iteration applied to a subspace
• Convergence analysis of gradient iterations for the symmetric eigenvalue problem
• Gradient flow approach to geometric convergence analysis of preconditioned eigensolvers
• Title not available (Why is that?)
• A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration
• Convergence Analysis of Inexact Rayleigh Quotient Iteration
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational aspects of F. L. Bauer's simultaneous iteration method
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• Sharp a priori error estimates of the Rayleigh-Ritz method without assumptions of fixed sign or compactness
• Cluster robustness of preconditioned gradient subspace iteration eigensolvers
• Convergence theory for preconditioned eigenvalue solvers in a nutshell
• Convergence estimates of nonrestarted and restarted block-Lanczos methods.
• The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems
• Convergence analysis of restarted Krylov subspace eigensolvers

Cited In (3)

• Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers
• Sharp Majorization-Type Cluster Robust Bounds for Block Filters and Eigensolvers
• Cluster robustness of preconditioned gradient subspace iteration eigensolvers

Uses Software

• lobpcg.m

This page was built for publication: Cluster robust estimates for block gradient-type eigensolvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226658)