{"title":"具有片状 Lipschitz 连续漂移系数的 SDE 强逼近的尖锐误差下限","authors":"Simon Ellinger","doi":"10.1016/j.jco.2023.101822","DOIUrl":null,"url":null,"abstract":"<div><p><span>We study pathwise approximation of strong solutions of scalar stochastic differential equations (SDEs) at a single time in the presence of discontinuities of the drift coefficient. Recently, it has been shown by Müller-Gronbach and Yaroslavtseva (2022) that for all </span><span><math><mi>p</mi><mo>∈</mo><mo>[</mo><mn>1</mn><mo>,</mo><mo>∞</mo><mo>)</mo></math></span> a transformed Milstein-type scheme reaches an <span><math><msup><mrow><mi>L</mi></mrow><mrow><mi>p</mi></mrow></msup></math></span><span><span>-error rate of at least 3/4 when the drift coefficient is a piecewise Lipschitz-continuous function with a piecewise Lipschitz-continuous derivative and the diffusion coefficient is constant. It has been proven by Müller-Gronbach and Yaroslavtseva (2023) that this rate 3/4 is optimal if one additionally assumes that the drift coefficient is bounded, increasing and has a point of discontinuity. While </span>boundedness and monotonicity of the drift coefficient are crucial for the proof of the matching lower bound from Müller-Gronbach and Yaroslavtseva (2023), we show that both conditions can be dropped. For the proof we apply a transformation technique which was so far only used to obtain upper bounds.</span></p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient\",\"authors\":\"Simon Ellinger\",\"doi\":\"10.1016/j.jco.2023.101822\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We study pathwise approximation of strong solutions of scalar stochastic differential equations (SDEs) at a single time in the presence of discontinuities of the drift coefficient. Recently, it has been shown by Müller-Gronbach and Yaroslavtseva (2022) that for all </span><span><math><mi>p</mi><mo>∈</mo><mo>[</mo><mn>1</mn><mo>,</mo><mo>∞</mo><mo>)</mo></math></span> a transformed Milstein-type scheme reaches an <span><math><msup><mrow><mi>L</mi></mrow><mrow><mi>p</mi></mrow></msup></math></span><span><span>-error rate of at least 3/4 when the drift coefficient is a piecewise Lipschitz-continuous function with a piecewise Lipschitz-continuous derivative and the diffusion coefficient is constant. It has been proven by Müller-Gronbach and Yaroslavtseva (2023) that this rate 3/4 is optimal if one additionally assumes that the drift coefficient is bounded, increasing and has a point of discontinuity. While </span>boundedness and monotonicity of the drift coefficient are crucial for the proof of the matching lower bound from Müller-Gronbach and Yaroslavtseva (2023), we show that both conditions can be dropped. For the proof we apply a transformation technique which was so far only used to obtain upper bounds.</span></p></div>\",\"PeriodicalId\":50227,\"journal\":{\"name\":\"Journal of Complexity\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2024-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Complexity\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0885064X23000912\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X23000912","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient
We study pathwise approximation of strong solutions of scalar stochastic differential equations (SDEs) at a single time in the presence of discontinuities of the drift coefficient. Recently, it has been shown by Müller-Gronbach and Yaroslavtseva (2022) that for all a transformed Milstein-type scheme reaches an -error rate of at least 3/4 when the drift coefficient is a piecewise Lipschitz-continuous function with a piecewise Lipschitz-continuous derivative and the diffusion coefficient is constant. It has been proven by Müller-Gronbach and Yaroslavtseva (2023) that this rate 3/4 is optimal if one additionally assumes that the drift coefficient is bounded, increasing and has a point of discontinuity. While boundedness and monotonicity of the drift coefficient are crucial for the proof of the matching lower bound from Müller-Gronbach and Yaroslavtseva (2023), we show that both conditions can be dropped. For the proof we apply a transformation technique which was so far only used to obtain upper bounds.
期刊介绍:
The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited.
Areas Include:
• Approximation theory
• Biomedical computing
• Compressed computing and sensing
• Computational finance
• Computational number theory
• Computational stochastics
• Control theory
• Cryptography
• Design of experiments
• Differential equations
• Discrete problems
• Distributed and parallel computation
• High and infinite-dimensional problems
• Information-based complexity
• Inverse and ill-posed problems
• Machine learning
• Markov chain Monte Carlo
• Monte Carlo and quasi-Monte Carlo
• Multivariate integration and approximation
• Noisy data
• Nonlinear and algebraic equations
• Numerical analysis
• Operator equations
• Optimization
• Quantum computing
• Scientific computation
• Tractability of multivariate problems
• Vision and image understanding.