{"title":"非光滑波动方程紧致四阶有限差分格式的误差上限和下限","authors":"A. Zlotnik","doi":"10.1016/j.jco.2025.101973","DOIUrl":null,"url":null,"abstract":"<div><div>A compact three-level fourth-order finite-difference scheme for solving the 1d wave equation is studied. New error bounds of the fractional order <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>h</mi></mrow><mrow><mn>4</mn><mo>(</mo><mi>λ</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>/</mo><mn>5</mn></mrow></msup><mo>)</mo></math></span> are proved in the mesh energy norm in terms of data, for two initial functions from the Sobolev and Nikolskii spaces with the smoothness orders <em>λ</em> and <span><math><mi>λ</mi><mo>−</mo><mn>1</mn></math></span> and the free term with a dominated mixed smoothness of order <span><math><mi>λ</mi><mo>−</mo><mn>1</mn></math></span>, for <span><math><mn>1</mn><mo>⩽</mo><mi>λ</mi><mo>⩽</mo><mn>6</mn></math></span>. The corresponding lower error bounds are proved as well to ensure the sharpness in order of the above error bounds with respect to each of the initial functions and the free term for any <em>λ</em>. Moreover, they demonstrate that the upper error bounds cannot be improved if the Lebesgue summability indices in the error norm are weakened down to 1 both in <em>x</em> and <em>t</em> and simultaneously the summability indices in the norms of data are strengthened up to ∞ both in <em>x</em> and <em>t</em>. Numerical experiments confirming the sharpness of the mentioned orders for half-integer <em>λ</em> and piecewise polynomial data have already been carried out previously.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"91 ","pages":"Article 101973"},"PeriodicalIF":1.8000,"publicationDate":"2025-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Upper and lower error bounds for a compact fourth-order finite-difference scheme for the wave equation with nonsmooth data\",\"authors\":\"A. Zlotnik\",\"doi\":\"10.1016/j.jco.2025.101973\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A compact three-level fourth-order finite-difference scheme for solving the 1d wave equation is studied. New error bounds of the fractional order <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>h</mi></mrow><mrow><mn>4</mn><mo>(</mo><mi>λ</mi><mo>−</mo><mn>1</mn><mo>)</mo><mo>/</mo><mn>5</mn></mrow></msup><mo>)</mo></math></span> are proved in the mesh energy norm in terms of data, for two initial functions from the Sobolev and Nikolskii spaces with the smoothness orders <em>λ</em> and <span><math><mi>λ</mi><mo>−</mo><mn>1</mn></math></span> and the free term with a dominated mixed smoothness of order <span><math><mi>λ</mi><mo>−</mo><mn>1</mn></math></span>, for <span><math><mn>1</mn><mo>⩽</mo><mi>λ</mi><mo>⩽</mo><mn>6</mn></math></span>. The corresponding lower error bounds are proved as well to ensure the sharpness in order of the above error bounds with respect to each of the initial functions and the free term for any <em>λ</em>. Moreover, they demonstrate that the upper error bounds cannot be improved if the Lebesgue summability indices in the error norm are weakened down to 1 both in <em>x</em> and <em>t</em> and simultaneously the summability indices in the norms of data are strengthened up to ∞ both in <em>x</em> and <em>t</em>. Numerical experiments confirming the sharpness of the mentioned orders for half-integer <em>λ</em> and piecewise polynomial data have already been carried out previously.</div></div>\",\"PeriodicalId\":50227,\"journal\":{\"name\":\"Journal of Complexity\",\"volume\":\"91 \",\"pages\":\"Article 101973\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2025-06-30\",\"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/S0885064X25000512\",\"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/S0885064X25000512","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Upper and lower error bounds for a compact fourth-order finite-difference scheme for the wave equation with nonsmooth data
A compact three-level fourth-order finite-difference scheme for solving the 1d wave equation is studied. New error bounds of the fractional order are proved in the mesh energy norm in terms of data, for two initial functions from the Sobolev and Nikolskii spaces with the smoothness orders λ and and the free term with a dominated mixed smoothness of order , for . The corresponding lower error bounds are proved as well to ensure the sharpness in order of the above error bounds with respect to each of the initial functions and the free term for any λ. Moreover, they demonstrate that the upper error bounds cannot be improved if the Lebesgue summability indices in the error norm are weakened down to 1 both in x and t and simultaneously the summability indices in the norms of data are strengthened up to ∞ both in x and t. Numerical experiments confirming the sharpness of the mentioned orders for half-integer λ and piecewise polynomial data have already been carried out previously.
期刊介绍:
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.