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

0391459 - MÚ 2014 RIV CZ eng C - Konferenční příspěvek (zahraniční konf.)
Vejchodský, Tomáš
Guaranteed and fully computable two-sided bounds of Friedrichs' constant.
Programs and Algorithms of Numerical Matematics 16. Prague: Institute of Mathematics, Academy of Sciences of the Czech Republic, 2013 - (Chleboun, J.; Segeth, K.; Šístek, J.; Vejchodský, T.), s. 195-201. ISBN 978-80-85823-62-2.
[Programy a algoritmy numerické matematiky /16./. Dolní Maxov (CZ), 03.06.2012-08.06.2012]
Grant CEP: GA AV ČR(CZ) IAA100190803
Institucionální podpora: RVO:67985840
Klíčová slova: numerical methods * computing
Kód oboru RIV: BA - Obecná matematika
http://users.math.cas.cz/~panm/Panm16/proceedings_final/195_vejchodsky.pdf

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 a priori-a posteriori inequalities is employed for the upper bound. Several numerical experiments show applicability and accuracy of this approach.
Trvalý link: http://hdl.handle.net/11104/0220501