Convergence and Complexity of an Adaptive Planewave Method for Eigenvalue Computations

DOI10.4208/AAMM.OA-2023-0099MaRDI QIDQ6369215zbMATH OpenFDO

Authors Xiaoying Dai, Yan Pan, Bin Yang, Aihui Zhou

Publication date 2 June 2021

Full work available at URL https://doi.org/10.4208/AAMM.OA-2023-0099

Mathematics Subject Classification ID

Error bounds for boundary value problems involving PDEs (65N15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Numerical methods for trigonometric approximation and interpolation (65T40)

Abstract: In this paper, we study the adaptive planewave discretization for a cluster of eigenvalues of second-order elliptic partial differential equations. We first design an a posteriori error estimator and prove both the upper and lower bounds. Based on the a posteriori error estimator, we propose an adaptive planewave method. We then prove that the adaptive planewave approximations have the linear convergence rate and quasi-optimal complexity.

Recommendations

• Convergence and optimal complexity of adaptive finite element eigenvalue computations
• A convergent adaptive method for elliptic eigenvalue problems
• An adaptive planewave method for electronic structure calculations
• Convergence and quasi-optimal complexity of adaptive finite element computations for multiple eigenvalues
• Adaptive eigenvalue computation: Complexity estimates

Cited in

(1)

• A posteriori error estimates for Schrödinger operators discretized with linear combinations of atomic orbitals

This page was built for publication: Convergence and Complexity of an Adaptive Planewave Method for Eigenvalue Computations

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