<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0424082</ARLID> <utime>20240903170628.3</utime><mtime>20140307235959.9</mtime>   <SCOPUS>84889023261</SCOPUS> <WOS>000328665200005</WOS>         <title language="eng" primary="1">Verification of functional a posteriori error estimates for obstacle problem in 1D</title>  <specification> <page_count>12 s.</page_count> <media_type>P</media_type> </specification>    <serial><ARLID>cav_un_epca*0297163</ARLID><ISSN>0023-5954</ISSN><title>Kybernetika</title><part_num/><part_title/><volume_id>49</volume_id><volume>5 (2013)</volume><page_num>738-754</page_num><publisher><place/><name>Ústav teorie informace a automatizace AV ČR, v. v. i.</name><year/></publisher></serial>    <keyword>obstacle problem</keyword>   <keyword>a posteriori error estimate</keyword>   <keyword>variational inequalities</keyword>    <author primary="1"> <ARLID>cav_un_auth*0300281</ARLID>  <name1>Harasim</name1> <name2>P.</name2> <country>CZ</country> </author> <author primary="0"> <ARLID>cav_un_auth*0292941</ARLID> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Valdman</name1> <name2>Jan</name2> <institution>UTIA-B</institution> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2014/MTR/valdman-0424082.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0292653</ARLID> <project_id>GA13-18652S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">We verify functional a posteriori error estimate for obstacle problem proposed by Repin. Simplification into 1D allows for the construction of a nonlinear benchmark for which an exact solution of the obstacle problem can be derived. Quality of a numerical approximation obtained by the finite element method is compared with the exact solution and the error of approximation is bounded from above by a majorant error estimate. The sharpness of the majorant error estimate is discussed.</abstract>     <RIV>BA</RIV>    <reportyear>2014</reportyear>      <num_of_auth>2</num_of_auth>  <unknown tag="mrcbC52"> 4 O 4o 20231122140052.6 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0230620</permalink>   <confidential>S</confidential>          <unknown tag="mrcbT16-e">COMPUTERSCIENCECYBERNETICS</unknown> <unknown tag="mrcbT16-f">0.577</unknown> <unknown tag="mrcbT16-g">0.098</unknown> <unknown tag="mrcbT16-h">9.IV</unknown> <unknown tag="mrcbT16-i">0.00191</unknown> <unknown tag="mrcbT16-j">0.341</unknown> <unknown tag="mrcbT16-k">655</unknown> <unknown tag="mrcbT16-l">61</unknown> <unknown tag="mrcbT16-s">0.348</unknown> <unknown tag="mrcbT16-z">ScienceCitationIndexExpanded</unknown> <unknown tag="mrcbT16-4">Q2</unknown> <unknown tag="mrcbT16-B">35.159</unknown> <unknown tag="mrcbT16-C">31.250</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q3</unknown> <arlyear>2013</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: valdman-0424082.pdf </unknown>    <unknown tag="mrcbU14"> 84889023261 SCOPUS </unknown> <unknown tag="mrcbU34"> 000328665200005 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 49 č. 5 2013 738 754 Ústav teorie informace a automatizace AV ČR, v. v. i. </unknown> </cas_special> </bibitem>