{"title":"Numerical Methods and Analysis of Computing Quasiperiodic Systems","authors":"Kai Jiang, Shifeng Li, Pingwen Zhang","doi":"10.1137/22m1524783","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 353-375, February 2024. <br/> Abstract. Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is a great challenge. A useful approach, the projection method (PM) [J. Comput. Phys., 256 (2014), pp. 428–440], has been proposed to compute quasiperiodic systems. Various studies have demonstrated that the PM is an accurate and efficient method to solve quasiperiodic systems. However, there is a lack of theoretical analysis of the PM. In this paper, we present a rigorous convergence analysis of the PM by establishing a mathematical framework of quasiperiodic functions and their high-dimensional periodic functions. We also give a theoretical analysis of the quasiperiodic spectral method (QSM) based on this framework. Results demonstrate that the PM and QSM both have exponential decay, and the QSM (PM) is a generalization of the periodic Fourier spectral (pseudospectral) method. Then, we analyze the computational complexity of the PM and QSM in calculating quasiperiodic systems. The PM can use a fast Fourier transform, while the QSM cannot. Moreover, we investigate the accuracy and efficiency of the PM, QSM, and periodic approximation method in solving the linear time-dependent quasiperiodic Schrödinger equation.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"8 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/22m1524783","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 353-375, February 2024. Abstract. Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is a great challenge. A useful approach, the projection method (PM) [J. Comput. Phys., 256 (2014), pp. 428–440], has been proposed to compute quasiperiodic systems. Various studies have demonstrated that the PM is an accurate and efficient method to solve quasiperiodic systems. However, there is a lack of theoretical analysis of the PM. In this paper, we present a rigorous convergence analysis of the PM by establishing a mathematical framework of quasiperiodic functions and their high-dimensional periodic functions. We also give a theoretical analysis of the quasiperiodic spectral method (QSM) based on this framework. Results demonstrate that the PM and QSM both have exponential decay, and the QSM (PM) is a generalization of the periodic Fourier spectral (pseudospectral) method. Then, we analyze the computational complexity of the PM and QSM in calculating quasiperiodic systems. The PM can use a fast Fourier transform, while the QSM cannot. Moreover, we investigate the accuracy and efficiency of the PM, QSM, and periodic approximation method in solving the linear time-dependent quasiperiodic Schrödinger equation.
期刊介绍:
SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.