dc.contributor.author | Glau, K | en_US |
dc.contributor.author | Mahlstedt, M | en_US |
dc.contributor.author | Poetz, C | en_US |
dc.date.accessioned | 2018-11-27T13:37:23Z | |
dc.date.available | 2018-11-19 | en_US |
dc.date.issued | 2019 | en_US |
dc.date.submitted | 2018-11-22T13:56:46.551Z | |
dc.identifier.issn | 1064-8275 | en_US |
dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/53338 | |
dc.format.extent | B153 - B180 | en_US |
dc.relation.ispartof | SIAM JOURNAL ON SCIENTIFIC COMPUTING | en_US |
dc.rights | This is a pre-copyedited, author-produced version of an article accepted for publication in SIAM Journal on Scientific Computing following peer review | |
dc.subject | American option pricing | en_US |
dc.subject | complexity reduction | en_US |
dc.subject | dynamic programming | en_US |
dc.subject | polynomial interpolation | en_US |
dc.title | A NEW APPROACH FOR AMERICAN OPTION PRICING: THE DYNAMIC CHEBYSHEV METHOD | en_US |
dc.type | Article | |
dc.rights.holder | © 2018 Society for Industrial and Applied Mathematics | |
dc.identifier.doi | 10.1137/18M1193001 | en_US |
pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000460118500039&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
pubs.issue | 1 | en_US |
pubs.notes | Not known | en_US |
pubs.publication-status | Published | en_US |
pubs.volume | 41 | en_US |