On Computing Coercivity Constants in Linear Variational Problems Through Eigenvalue Analysis

@article{Sentz2022OnCC,
  title={On Computing Coercivity Constants in Linear Variational Problems Through Eigenvalue Analysis},
  author={Peter Sentz and Jehanzeb Hameed Chaudhry and Luke N. Olson},
  journal={ArXiv},
  year={2022},
  volume={abs/2205.11580}
}
. In this work, we investigate the convergence of numerical approximations to coercivity constants of variational problems. These constants are essential components of rigorous error bounds for reduced-order modeling; extension of these bounds to the error with respect to exact solutions requires an understanding of convergence rates for discrete coercivity constants. The results are obtained by characterizing the coercivity constant as a spectral value of a self-adjoint linear operator; for… 

Figures from this paper

References

SHOWING 1-10 OF 42 REFERENCES
Numerical Estimation of Coercivity Constants for Boundary Integral Operators in Acoustic Scattering
TLDR
It is found that coercivity holds, uniformly in the wavenumber $k$, for a wide variety of domains, and convergence estimates for the numerical range of Galerkin projections of a general bounded linear operator on a Hilbert space are proved.
Two-Sided Bounds for Eigenvalues of Differential Operators with Applications to Friedrichs, Poincaré, Trace, and Similar Constants
TLDR
A general numerical method for computing guaranteed two-sided bounds for principal eigenvalues of symmetric linear elliptic differential operators using the Galerkin method and as a byproduct an abstract inequality of Friedrichs--Poincare type is proved.
Finite element approximation of eigenvalue problems
  • D. Boffi
  • Mathematics, Computer Science
    Acta Numerica
  • 2010
TLDR
The final part tries to introduce the reader to the fascinating setting of differential forms and homological techniques with the description of the Hodge–Laplace eigenvalue problem and its mixed equivalent formulations.
Guaranteed and Robust a Posteriori Bounds for Laplace Eigenvalues and Eigenvectors: Conforming Approximations
TLDR
Upper and lower bounds for an arbitrary simple eigenvalue are given and guaranteed, fully computable, optimally convergent, and polynomial-degree robust bounds on the energy error in the approximation of the associated eigenvector are derived.
On spectral approximation. Part 2. Error estimates for the Galerkin method
TLDR
This work considers an isolated eigenvalue A of finite multiplicity of an operator A which is approximated by a Galerkin method, and proves the existence of the operator C, i.
Lower Bounds for Eigenvalues of Elliptic Operators: By Nonconforming Finite Element Methods
TLDR
A new systematic method that can produce lower bounds for eigenvalues is introduced and the saturation condition for most nonconforming elements is proved, which provides a guidance to modify known non Conforming elements in literature and to propose new nonconform elements.
Approximation of Elliptic Boundary-Value Problems
✺ 1950’s: Finite differences and Rayleigh-Ritz-Galerkin ✺ FD: Young (1950) — over relaxation; faster iterative methods for large systems; 5-point schemes ✺ Courant: Variational method with piecewise
Guaranteed Eigenvalue Bounds for the Steklov Eigenvalue Problem
TLDR
An enhanced version of the eigenvalue estimation algorithm developed by the third author is proposed, which removes the requirements of the positive definiteness of bilinear forms in the formulation of eigen value problems.
Numerical solution of parametrized Navier–Stokes equations by reduced basis methods
We apply the reduced basis method to solve Navier–Stokes equations in parametrized domains. Special attention is devoted to the treatment of the parametrized nonlinear transport term in the reduced
...
...