.png){kind=icon}
.png){kind=icon}
Return
On computing coercivity constants in linear variational problems through eigenvalue analysis
.png){kind=icon}
PRE
AI
DOI：10.1093/imanum/draf110.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 modelling, since extension of these bounds to the error with respect to exact solutions requires an understanding of the approximation and convergence properties of discrete coercivity constants with respect to the continuous problem. Rates of convergence are obtained by characterizing the coercivity constant as a spectral value of a self-adjoint linear operator. For several examples of differential equations we show that the coercivity constant is related to an eigenvalue of a compact operator; in these cases convergence rates are derived and verified with numerical examples.
Keywords:
elliptic differential equations
variational problems
eigenvalue approximation
Journal
I
IF:
2.4
Papers:
93
Citations:
0
View more organizations