• Medientyp: E-Artikel
  • Titel: Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates
  • Beteiligte: Carstensen, Carsten [Verfasser:in]; Puttkammer, Sophie [Verfasser:in]
  • Erschienen: Humboldt-Universität zu Berlin, 2023-12-27
  • Sprache: Englisch
  • DOI: https://doi.org/10.18452/28468; https://doi.org/10.1007/s00211-023-01382-8
  • ISSN: 0945-3245
  • Schlagwörter: 65N50 ; 65N12 ; 65Y20 ; 65N25 ; 65N30 ; 65N15
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: Guaranteed lower Dirichlet eigenvalue bounds (GLB) can be computed for the m-th Laplace operator with a recently introduced extra-stabilized nonconforming Crouzeix–Raviart (m = 1) or Morley (m = 2) finite element eigensolver. Striking numerical evidence for the superiority of a new adaptive eigensolver motivates the convergence analysis in this paper with a proof of optimal convergence rates of the GLB towards a simple eigenvalue. The proof is based on (a generalization of) known abstract arguments entitled as the axioms of adaptivity. Beyond the known a priori convergence rates, a medius analysis is enfolded in this paper for the proof of best-approximation results. This and subordinated L2 error estimates for locally refined triangulations appear of independent interest. The analysis of optimal convergence rates of an adaptive mesh-refining algorithm is performed in 3D and highlights a new version of discrete reliability. ; Peer Reviewed
  • Zugangsstatus: Freier Zugang
  • Rechte-/Nutzungshinweise: Namensnennung (CC BY)