The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems

zbMath1295.65110MaRDI QIDQ2510839

Klaus Neymeyr, Ming Zhou

Publication date: 4 August 2014

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol41/abstract_vol41_pp93-108.html

zbMATH Keywords

preconditioningfinite elementinvariant subspacemultigridsmallest eigenvaluenumerical experimentRayleigh-Ritz procedureelliptic eigenvalue problemsubspace iterationsteepest descent/ascent

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Estimates of eigenvalues in context of PDEs (35P15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Related Items (5)

Convergence Analysis of Restarted Krylov Subspace Eigensolvers ⋮ Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers ⋮ Sharp Ritz value estimates for restarted Krylov subspace iterations ⋮ Preconditioned gradient iterations for the eigenproblem of definite matrix pairs ⋮ Cluster robust estimates for block gradient-type eigensolvers

This page was built for publication: The block preconditioned steepest descent iteration for elliptic operator eigenvalue problems