Guaranteed and fully computable two-sided bounds of Friedrichs’ constant

Vejchodský, Tomáš. "Guaranteed and fully computable two-sided bounds of Friedrichs’ constant." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2013. 195-201. <http://eudml.org/doc/271391>.

@inProceedings{Vejchodský2013,
abstract = {This contribution presents a general numerical method for computing lower and upper bound of the optimal constant in Friedrichs’ inequality. The standard Rayleigh-Ritz method is used for the lower bound and the method of $\textit \{a\ priori-a\ posteriori\ inequalities\}$ is employed for the upper bound. Several numerical experiments show applicability and accuracy of this approach.},
author = {Vejchodský, Tomáš},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {Friedrichs' constant; a posteriori error estimates; eigenvalue problem},
location = {Prague},
pages = {195-201},
publisher = {Institute of Mathematics AS CR},
title = {Guaranteed and fully computable two-sided bounds of Friedrichs’ constant},
url = {http://eudml.org/doc/271391},
year = {2013},
}

TY - CLSWK
AU - Vejchodský, Tomáš
TI - Guaranteed and fully computable two-sided bounds of Friedrichs’ constant
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2013
CY - Prague
PB - Institute of Mathematics AS CR
SP - 195
EP - 201
AB - This contribution presents a general numerical method for computing lower and upper bound of the optimal constant in Friedrichs’ inequality. The standard Rayleigh-Ritz method is used for the lower bound and the method of $\textit {a\ priori-a\ posteriori\ inequalities}$ is employed for the upper bound. Several numerical experiments show applicability and accuracy of this approach.
KW - Friedrichs' constant; a posteriori error estimates; eigenvalue problem
UR - http://eudml.org/doc/271391
ER -