Publikation: A Forward Scheme for Backward SDEs
Lade...
Dateien
Datum
2005
Autor:innen
Bender, Christian
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Preprint
Publikationsstatus
Published
Erschienen in
Zusammenfassung
We introduce a forward scheme to simulate backward SDEs. Compared to existing schemes, we avoid high order nestings of conditional expectations backwards in time. In this way the error, when approximating the conditional expectation, in dependence of the time partition is significantly reduced. Besides this generic result, we present an implementable algorithm and provide an error analysis for it. Finally, we demonstrate the strength of the new algorithm by solving some financial problems numerically.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
BENDER, Christian, Robert DENK, 2005. A Forward Scheme for Backward SDEsBibTex
@unpublished{Bender2005Forwa-664,
year={2005},
title={A Forward Scheme for Backward SDEs},
author={Bender, Christian and Denk, Robert}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/664">
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/664"/>
<dc:language>eng</dc:language>
<dc:contributor>Denk, Robert</dc:contributor>
<dc:creator>Denk, Robert</dc:creator>
<dc:rights>terms-of-use</dc:rights>
<dc:creator>Bender, Christian</dc:creator>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:abstract xml:lang="eng">We introduce a forward scheme to simulate backward SDEs. Compared to existing schemes, we avoid high order nestings of conditional expectations backwards in time. In this way the error, when approximating the conditional expectation, in dependence of the time partition is significantly reduced. Besides this generic result, we present an implementable algorithm and provide an error analysis for it. Finally, we demonstrate the strength of the new algorithm by solving some financial problems numerically.</dcterms:abstract>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/664/1/preprint_209.pdf"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:issued>2005</dcterms:issued>
<dc:format>application/pdf</dc:format>
<dc:contributor>Bender, Christian</dc:contributor>
<dcterms:title>A Forward Scheme for Backward SDEs</dcterms:title>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:26Z</dcterms:available>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:26Z</dc:date>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/664/1/preprint_209.pdf"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
