Galerkin error reduction and eigenvalue localisation for conforming FEM

Abstract The reduction factor $$\varrho $$ ϱ in a Galerkin scheme with conforming $$P_1$$ P 1 finite element spaces on simplicial meshes is the maximal quotient of the Galerkin errors in the $$L^2$$ L 2 norm divided by the energy norm (the $$H^1$$ H 1 semi-norm) for the Poisson model problem for instance. An old and a new scheme allow for the computation of upper bounds of $$\varrho $$ ϱ on a given mesh. The schemes are compared theoretically and numerically before three applications for the guaranteed lower eigenvalue bounds (GLB) illustrate their impact. The three eigenvalue problems are named after Laplace, Schrödinger, and Steklov. The resulting GLB compete with those from recent post-processing of nonconforming Crouzeix–Raviart eigenvalue approximations in the classical and in extended versions.

Authors

Institutions

Publication Details

Journal
Numerische Mathematik
Published
2026-10-16
DOI
https://doi.org/10.1007/s00211-026-01577-9
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Galerkin error reduction and eigenvalue localisation for conforming FEM

Carsten Carstensen, Tim Stiebert
Numerische Mathematik
Advanced Numerical Methods in Computational Mathematics
article

Galerkin error reduction and eigenvalue localisation for conforming FEM

Carsten Carstensen, Tim Stiebert
article en

Abstract

Abstract The reduction factor $$\varrho $$ ϱ in a Galerkin scheme with conforming $$P_1$$ P 1 finite element spaces on simplicial meshes is the maximal quotient of the Galerkin errors in the $$L^2$$ L 2 norm divided by the energy norm (the $$H^1$$ H 1 semi-norm) for the Poisson model problem for instance. An old and a new scheme allow for the computation of upper bounds of $$\varrho $$ ϱ on a given mesh. The schemes are compared theoretically and numerically before three applications for the guaranteed lower eigenvalue bounds (GLB) illustrate their impact. The three eigenvalue problems are named after Laplace, Schrödinger, and Steklov. The resulting GLB compete with those from recent post-processing of nonconforming Crouzeix–Raviart eigenvalue approximations in the classical and in extended versions.

Numerische Mathematik
Humboldt-Universität zu Berlin (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 19%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.