<?xml version='1.0' encoding='utf-8'?>
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="3.7" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd">
  <titleInfo>
    <title>MONTE CARLO SIMULATION OF INFINITE-DIMENSIONAL INTEGRALS</title>
  </titleInfo>
  <name>
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/cre">creator</roleTerm>
    </role>
    <namePart>Niu, Ben</namePart>
  </name>
  <name authority="wikidata" authorityURI="https://www.wikidata.org" valueURI="https://www.wikidata.org/wiki/Q132147199">
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/ths">advisor</roleTerm>
    </role>
    <namePart>Hickernell, Fred J.</namePart>
  </name>
  <abstract>This thesis is motivated by pricing a path-dependent financial derivative, such as an Asian option, which requires the computation of the expectation of a payoff function, which depends on a Brownian motion. Employing a standard series expansion of the Brownian motion, the latter problem is equivalent to the computation of the expectation of a function of the corresponding i.i.d. sequence of random coefficients. This motivates the construction and the analysis of algorithms for numerical integration with respect to a product probability measure on the infinite-dimensional sequence. The class of integrands studied in this thesis resides in the unit ball in a reproducing kernel Hilbert space obtained by superposition of weighted tensor product spaces of functions of finitely many variables. Combining tractability results for high-dimensional integration with the multi-level technique we obtain new algorithms for infinite-dimensional integration. These deterministic multi-level algorithms use variable subspace sampling and they are superior to any deterministic algorithm based on fixed subspace sampling with respect to the respective worst case error. Numerical experiment results are presented at the end.</abstract>
  <note type="provenance">Submitted by Dana Lamparello (dlampare@iit.edu) on 2011-12-01T18:40:14Z No. of bitstreams: 1 BenNiuThesisMay2011.pdf: 1517199 bytes, checksum: 73ed64bf4aa822370692fd9edc1b2108 (MD5)</note>
  <note type="provenance">Made available in DSpace on 2011-12-01T18:40:14Z (GMT). No. of bitstreams: 1 BenNiuThesisMay2011.pdf: 1517199 bytes, checksum: 73ed64bf4aa822370692fd9edc1b2108 (MD5) Previous issue date: 2011-05</note>
  <note type="thesis">Ph.D. in Applied Mathematics, May 2011</note>
  <originInfo>
    <dateCaptured>2011-04-13</dateCaptured>
  </originInfo>
  <originInfo>
    <dateCreated keyDate="yes">2011-05</dateCreated>
  </originInfo>
  <identifier type="hdl">http://hdl.handle.net/10560/2358</identifier>
  <language>
    <languageTerm type="code" authority="rfc3066">en</languageTerm>
  </language>
  <typeOfResource authority="aat" valueURI="http://vocab.getty.edu/page/aat/300028029">Dissertation</typeOfResource>
  <physicalDescription>
    <digitalOrigin>born digital</digitalOrigin>
    <internetMediaType>application/pdf</internetMediaType>
  </physicalDescription>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.org">In Copyright</accessCondition>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.orgURI">http://rightsstatements.org/page/InC/1.0/</accessCondition>
  <accessCondition type="restrictionOnAccess">Restricted Access</accessCondition>
  <name type="corporate">
    <namePart>MATH / Applied Mathematics</namePart>
    <affiliation>Illinois Institute of Technology</affiliation>
    <role>
      <roleTerm type="text">Affiliated department</roleTerm>
    </role>
  </name>
</mods>