Passer à la navigation principale Passer à la recherche Passer au contenu principal

Guaranteed a posteriori bounds for eigenvalues and eigenvectors: Multiplicities and clusters

  • Eric Cancès
  • , Geneviève Dusson
  • , Yvon Maday
  • , Benjamin Stamm
  • , Martin Vohralík
  • UFR Sciences et techniques
  • Sorbonne Université
  • RWTH Aachen University
  • INRIA Institut National de Recherche en Informatique et en Automatique

Résultats de recherche: Contribution à un journalArticleRevue par des pairs

Résumé

This paper presents a posteriori error estimates for conforming numerical approximations of eigenvalue clusters of second-order self-adjoint elliptic linear operators with compact resolvent. Given a cluster of eigenvalues, we estimate the error in the sum of the eigenvalues, as well as the error in the eigenvectors represented through the density matrix, i.e., the orthogonal projector on the associated eigenspace. This allows us to deal with degenerate (multiple) eigenvalues within the framework. All the bounds are valid under the only assumption that the cluster is separated from the surrounding smaller and larger eigenvalues; we show how this assumption can be numerically checked. Our bounds are guaranteed and converge with the same speed as the exact errors. They can be turned into fully computable bounds as soon as an estimate on the dual norm of the residual is available, which is presented in two particular cases: the Laplace eigenvalue problem discretized with conforming finite elements, and a Schrodinger operator with periodic boundary conditions of the form-Δ + V discretized with planewaves. For these two cases, numerical illustrations are provided on a set of test problems.

langue originaleAnglais
Pages (de - à)2563-2611
Nombre de pages49
journalMathematics of Computation
Volume89
Numéro de publication326
Les DOIs
étatPublié - 1 nov. 2020

Empreinte digitale

Examiner les sujets de recherche de « Guaranteed a posteriori bounds for eigenvalues and eigenvectors: Multiplicities and clusters ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation