{"title":"艾特-萨哈利亚模型的无条件保正近似:米尔斯坦型显式方案","authors":"Yingsong Jiang, Ruishu Liu, Xiaojie Wang, Jinghua Zhuo","doi":"10.1007/s11075-024-01861-5","DOIUrl":null,"url":null,"abstract":"<p>The present article aims to design and analyze efficient first-order strong schemes for a generalized Aït-Sahalia type model arising in mathematical finance and evolving in a positive domain <span>\\((0, \\infty )\\)</span>, which possesses a diffusion term with superlinear growth and a highly nonlinear drift that blows up at the origin. Such a complicated structure of the model unavoidably causes essential difficulties in the construction and convergence analysis of time discretizations. By incorporating implicitness in the term <span>\\(\\alpha _{-1} x^{-1}\\)</span> and a corrective mapping <span>\\(\\Phi _h\\)</span> in the recursion, we develop a novel class of explicit and unconditionally positivity-preserving (i.e., for any step-size <span>\\(h>0\\)</span>) Milstein-type schemes for the underlying model. In both non-critical and general critical cases, we introduce a novel approach to analyze mean-square error bounds of the novel schemes, without relying on a priori high-order moment bounds of the numerical approximations. The expected order-one mean-square convergence is attained for the proposed scheme. The above theoretical guarantee can be used to justify the optimal complexity of the Multilevel Monte Carlo method. Numerical experiments are finally provided to verify the theoretical findings.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"17 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Unconditionally positivity-preserving approximations of the Aït-Sahalia type model: Explicit Milstein-type schemes\",\"authors\":\"Yingsong Jiang, Ruishu Liu, Xiaojie Wang, Jinghua Zhuo\",\"doi\":\"10.1007/s11075-024-01861-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The present article aims to design and analyze efficient first-order strong schemes for a generalized Aït-Sahalia type model arising in mathematical finance and evolving in a positive domain <span>\\\\((0, \\\\infty )\\\\)</span>, which possesses a diffusion term with superlinear growth and a highly nonlinear drift that blows up at the origin. Such a complicated structure of the model unavoidably causes essential difficulties in the construction and convergence analysis of time discretizations. By incorporating implicitness in the term <span>\\\\(\\\\alpha _{-1} x^{-1}\\\\)</span> and a corrective mapping <span>\\\\(\\\\Phi _h\\\\)</span> in the recursion, we develop a novel class of explicit and unconditionally positivity-preserving (i.e., for any step-size <span>\\\\(h>0\\\\)</span>) Milstein-type schemes for the underlying model. In both non-critical and general critical cases, we introduce a novel approach to analyze mean-square error bounds of the novel schemes, without relying on a priori high-order moment bounds of the numerical approximations. The expected order-one mean-square convergence is attained for the proposed scheme. The above theoretical guarantee can be used to justify the optimal complexity of the Multilevel Monte Carlo method. Numerical experiments are finally provided to verify the theoretical findings.</p>\",\"PeriodicalId\":54709,\"journal\":{\"name\":\"Numerical Algorithms\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Numerical Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11075-024-01861-5\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01861-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Unconditionally positivity-preserving approximations of the Aït-Sahalia type model: Explicit Milstein-type schemes
The present article aims to design and analyze efficient first-order strong schemes for a generalized Aït-Sahalia type model arising in mathematical finance and evolving in a positive domain \((0, \infty )\), which possesses a diffusion term with superlinear growth and a highly nonlinear drift that blows up at the origin. Such a complicated structure of the model unavoidably causes essential difficulties in the construction and convergence analysis of time discretizations. By incorporating implicitness in the term \(\alpha _{-1} x^{-1}\) and a corrective mapping \(\Phi _h\) in the recursion, we develop a novel class of explicit and unconditionally positivity-preserving (i.e., for any step-size \(h>0\)) Milstein-type schemes for the underlying model. In both non-critical and general critical cases, we introduce a novel approach to analyze mean-square error bounds of the novel schemes, without relying on a priori high-order moment bounds of the numerical approximations. The expected order-one mean-square convergence is attained for the proposed scheme. The above theoretical guarantee can be used to justify the optimal complexity of the Multilevel Monte Carlo method. Numerical experiments are finally provided to verify the theoretical findings.
期刊介绍:
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.