<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0410880</ARLID> <utime>20240103182246.0</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">A fast iterative algorithm for American option pricing</title>  <specification> <page_count>10 s.</page_count> </specification>   <serial><title>Solutions</title><part_num/><part_title/><volume_id>6</volume_id><volume>1 (2002)</volume><page_num>57-66</page_num></serial>    <keyword>iterative algorithm</keyword>   <keyword>American option pricing</keyword>   <keyword>linear complementary problems</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101131</ARLID> <name1>Kočvara</name1> <name2>Michal</name2> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>     <COSATI>12C</COSATI>    <cas_special> <project> <project_id>IAA1075005</project_id> <agency>GA AV ČR</agency> <ARLID>cav_un_auth*0012782</ARLID> </project> <research> <research_id>CEZ:AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">We propose a new algorithm for solving European and American option pricing, formulated as complementarity problem.</abstract>      <RIV>BA</RIV>   <department>MTR</department>    <permalink>http://hdl.handle.net/11104/0130967</permalink>   <ID_orig>UTIA-B 20020094</ID_orig>     <arlyear>2002</arlyear>       <unknown tag="mrcbU63"> Solutions Roč. 6 č. 1 2002 57 66 </unknown> </cas_special> </bibitem>