Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: conforming approximations

E Cancès, G Dusson, Y Maday, B Stamm… - SIAM Journal on …, 2017 - SIAM
This paper derives a posteriori error estimates for conforming numerical approximations of
the Laplace eigenvalue problem with a homogeneous Dirichlet boundary condition. In …

Computation of eigenvalues by numerical upscaling

A Målqvist, D Peterseim - Numerische Mathematik, 2015 - Springer
We present numerical upscaling techniques for a class of linear second-order self-adjoint
elliptic partial differential operators (or their high-resolution finite element discretization). As …

Interplay between discretization and algebraic computation in adaptive numerical solutionof elliptic pde problems

M Arioli, J Liesen, A Miçdlar, Z Strakoš - GAMM‐Mitteilungen, 2013 - Wiley Online Library
Abstract The Adaptive Finite Element Method (AFEM) for approximating solutions of PDE
boundary value and eigenvalue problems is a numerical scheme that automatically and …

Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: a unified framework

E Cancès, G Dusson, Y Maday, B Stamm… - Numerische …, 2018 - Springer
This paper develops a general framework for a posteriori error estimates in numerical
approximations of the Laplace eigenvalue problem, applicable to all standard numerical …

An adaptive finite element eigenvalue solver of asymptotic quasi-optimal computational complexity

C Carstensen, J Gedicke - SIAM Journal on Numerical Analysis, 2012 - SIAM
This paper presents a combined adaptive finite element method with an iterative algebraic
eigenvalue solver for a symmetric eigenvalue problem of asymptotic quasi-optimal …

Convergence and quasi-optimal complexity of adaptive finite element computations for multiple eigenvalues

X Dai, L He, A Zhou - IMA Journal of Numerical Analysis, 2015 - academic.oup.com
In this paper, we study an adaptive finite element for multiple eigenvalues of second order
elliptic partial differential equations. We obtain both the asymptotic contraction property and …

A posteriori error estimation for the non-self-consistent Kohn–Sham equations

MF Herbst, A Levitt, E Cancès - Faraday Discussions, 2020 - pubs.rsc.org
We address the problem of rigorously bounding the errors in the numerical solution of the
Kohn–Sham equations due to (i) the finiteness of the basis set,(ii) the convergence …

An adaptive algorithm based on the shifted inverse iteration for the Steklov eigenvalue problem

H Bi, H Li, Y Yang - Applied Numerical Mathematics, 2016 - Elsevier
This paper proposes and analyzes an a posteriori error estimator for the finite element multi-
scale discretization approximation of the Steklov eigenvalue problem. Based on the a …

An adaptive homotopy approach for non-selfadjoint eigenvalue problems

C Carstensen, J Gedicke, V Mehrmann… - Numerische …, 2011 - Springer
This paper presents adaptive algorithms for eigenvalue problems associated with non-
selfadjoint partial differential operators. The basis for the developed algorithms is a …

Superconvergent two-grid methods for elliptic eigenvalue problems

H Guo, Z Zhang, R Zhao - Journal of Scientific Computing, 2017 - Springer
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and
numerically tested. The methods combine advantages of the two-grid algorithm (Xu and …