检索结果-内蒙古大学图书馆

Irrational-window-filter projection method and application to quasiperiodic Schrödinger eigenproblems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jiang, Kai Li, Xueyang Ma, Yao Zhang, Juan Zhang, Pingwen Zhou, Qi Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

In this paper, we propose a new algorithm, the irrational-window-filter projection method (IWFPM), for quasiperiodic systems with concentrated spectral point distribution. Based on the projection method (PM), IWFPM filters out dominant spectral points by defining an irrational window and uses a corresponding index-shift transform to make the FFT available. The error analysis on the function approximation level is also given. We apply IWFPM to 1D, 2D, and 3D quasiperiodic Schrödinger eigenproblems (QSEs) to demonstrate its accuracy and efficiency. IWFPM exhibits a significant computational advantage over PM for both extended and localized quantum states. More importantly, by using IWFPM, the existence of Anderson localization in 2D and 3D QSEs is numerically *** Codes 35P05, 35J10, 65D15, 65T50, 81-08 © 2024, CC BY-NC-SA.

关键词： Wiener filtering

PROJECTION METHOD FOR QUASIPERIODIC ELLIPTIC EQUATIONS AND APPLICATION TO QUASIPERIODIC HOMOGENIZATION

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jiang, Kai Li, Meng Zhang, Juan Zhang, Lei Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China

In this study, we address the challenge of solving elliptic equations with quasiperiodic coefficients. To achieve accurate and efficient computation, we introduce the projection method, which enables the embedding of quasiperiodic systems into higher-dimensional periodic systems. To enhance the computational efficiency, we propose a compressed storage strategy for the stiffness matrix by its multi-level block circulant structure, significantly reducing memory requirements. Furthermore, we design a diagonal preconditioner to efficiently solve the resulting high-dimensional linear system by reducing the condition number of the stiffness matrix. These techniques collectively contribute to the computational effectiveness of our proposed approach. Convergence analysis shows the spectral accuracy of the proposed method. We demonstrate the effectiveness and accuracy of our approach through a series of numerical examples. Moreover, we apply our method to achieve a highly accurate computation of the homogenized coefficients for a quasiperiodic multiscale elliptic *** Codes 65D05, 65D15, 65F08, 35B15, 35B27 Copyright © 2024, The Authors. All rights reserved.

关键词： Stiffness matrix

NUMERICAL METHODS AND ANALYSIS OF COMPUTING QUASIPERIODIC SYSTEMS

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jiang, Kai Li, Shifeng Zhang, Pingwen Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is of great challenge. A useful approach, the projection method (PM) [J. Comput. Phys., 256: 428, 2014], 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 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 quasiperiodic spectral method (QSM) based on this framework. Results demonstrate that PM and QSM both have exponential decay, and the QSM (PM) is a generalization of the periodic Fourier spectral (pseudo-spectral) method. Then we analyze the computational complexity of PM and QSM in calculating quasiperiodic systems. The PM can use fast Fourier transform, while the QSM cannot. Moreover, we investigate the accuracy and efficiency of PM, QSM and periodic approximation method in solving the linear time-dependent quasiperiodic Schrödinger equation. Copyright © 2022, The Authors. All rights reserved.

关键词： Fast Fourier transforms

ON THE APPROXIMATION OF QUASIPERIODIC FUNCTIONS WITH DIOPHANTINE FREQUENCIES BY PERIODIC FUNCTIONS

学校读者我要写书评

暂无评论

arXiv 2023年

We present an analysis of the approximation error for a d-dimensional quasiperiodic function f with Diophantine frequencies, approximated by a periodic function with the fundamental domain [0, L1) × [0, L2) × · · · × [0, Ld). When f has a certain regularity, its global behavior can be described by a finite number of Fourier components and has a polynomial decay at infinity. The dominant part of periodic approximation error is bounded by (formula presented), where Lj belongs to the best simultaneous approximation sequence and sj is the number of different irrational elements in j-th dimension component of Fourier frequencies, respectively. Meanwhile, we discuss the approximation rate. Finally, these analytical results are verified by some examples. Copyright © 2023, The Authors. All rights reserved.

关键词： Natural frequencies

γ-DEEPDSM FOR INTERFACE RECONSTRUCTION: OPERATOR LEARNING AND A LEARNING-AUTOMATED FEM PACKAGE

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zheng, Yangyang Wei, Huayi Cao, Shuhao Guo, Ruchi School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan China School of Mathematics and Computational Science Xiangtan University National Center for Applied Mathematics in Hunan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China School of Science and Engineering University of Missouri-Kansas City Kansas CityMO United States School of Mathematics Sichuan University Sichuan Chengdu China

In this work, we propose an Operator Learning (OpL) method for solving boundary value inverse problems in partial differential equations (PDEs), focusing on recovering diffusion coefficients from boundary data. Inspired by the classical Direct Sampling Method (DSM), our operator learner, named γ-deepDSM, has two key components: (1) a data-feature generation process that applies a learnable fractional Laplace-Beltrami operator to the boundary data, and (2) a convolutional neural network that operates on these data features to produce reconstructions. To facilitate this workflow, leveraging FEALPy [52], a cross-platform Computed-Aided-engineering engine, our another contribution is to develop a set of finite element method (FEM) modules fully integrated with PyTorch, called Learning-Automated FEM (LA-FEM). The new LA-FEM modules in FEALPy conveniently allows efficient parallel GPU computing, batched computation of PDEs, and auto-differentiation, without the need for additional loops, data format conversions, or device-to-device transfers. With LA-FEM, the PDE solvers with learnable parameters can be directly integrated into neural network models. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolutional neural networks

Convergence analysis of PM-BDF2 method for quasiperiodic parabolic equations

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jiang, Kai Li, Meng Zhang, Juan Zhang, Lei Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Department of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China

Numerically solving parabolic equations with quasiperiodic coefficients is a significant challenge due to the potential formation of space-filling quasiperiodic structures that lack translational symmetry or decay. In this paper, we introduce a highly accurate numerical method for solving time-dependent quasiperiodic parabolic equations. We discretize the spatial variables using the projection method (PM) and the time variable with the second-order backward differentiation formula (BDF2). We provide a complexity analysis for the resulting PM-BDF2 method. Furthermore, we conduct a detailed convergence analysis, demonstrating that the proposed method exhibits spectral accuracy in space and second-order accuracy in time. Numerical results in both one and two dimensions validate these convergence results, highlighting the PMBDF2 method as a highly efficient algorithm for addressing quasiperiodic parabolic equations. Copyright © 2024, The Authors. All rights reserved.

关键词： Convergence of numerical methods

ACCURATELY RECOVER GLOBAL QUASIPERIODIC SYSTEMS BY FINITE POINTS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Kai Zhou, Qi Zhang, Pingwen Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

Quasiperiodic systems, related to irrational numbers, are space-filling structures without decay nor translation invariance. How to accurately recover these systems, especially for non-smooth cases, presents a big challenge in numerical computation. In this paper, we propose a new algorithm, finite points recovery (FPR) method, which is available for both smooth and non-smooth cases, to address this challenge. The FPR method first establishes a homomorphism between the lower-dimensional definition domain of the quasiperiodic function and the higher-dimensional torus, then recovers the global quasiperiodic system by employing interpolation technique with finite points in the definition domain without dimensional lifting. Furthermore, we develop accurate and efficient strategies of selecting finite points according to the arithmetic properties of irrational numbers. The corresponding mathematical theory, convergence analysis, and computational complexity analysis on choosing finite points are presented. Numerical experiments demonstrate the effectiveness and superiority of FPR approach in recovering both smooth quasiperiodic functions and piecewise constant Fibonacci quasicrystals. While existing spectral methods encounter difficulties in accurately recovering non-smooth quasiperiodic *** Codes 11J68, 65D05, 65D15, 68W25 © 2023, CC BY-NC-ND.

关键词： Interpolation

A computationally-efficient sandbox algorithm for multifractal analysis of large-scale complex networks with tens of millions of nodes

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Ding, Yuemin Liu, Jin-Long Li, Xiaohui Tian, Yu-Chu Yu, Zu-Guo School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China School of Computer Science Queensland University of Technology BrisbaneQLD4000 Australia Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan411105 China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan Hubei430081 China

The fractality of complex networks has attracted much attention with extensive investigations over the last 15 years. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful tool to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. One of the widely used methods for fractal analysis is box-covering. It uses the minimum number of covering boxes to calculate the fractal dimension of complex networks, and is known to be NP-hard. More severely, in comparison with fractal analysis algorithms, MFA algorithms have much higher computational complexity. Among various MFA algorithms for complex networks, the sandbox MFA algorithm behaves with the best computational efficiency. However, the existing sandbox algorithm is still computationally expensive. Thus, so far it has only been applied to small-scale complex networks of the size of about tens of thousands of nodes. It becomes challenging to implement the MFA for large-scale networks with tens of millions of nodes. It is also not clear whether or not MFA results can be improved by a largely increased size of a theoretical network. To tackle these challenges, a computationally-efficient sandbox algorithm (CESA) is presented in this paper for MFA of large-scale networks. Distinct from the existing sandbox algorithm that uses the shortest-path distance matrix to obtain the required information for MFA of complex networks, our CESA employs the breadth-first search (BFS) technique to directly search the neighbor nodes of each layer of center nodes, and then to retrieve the required information. Our CESA's input is a sparse data structure derived from the compressed sparse row (CSR) format designed for compressed storage of the adjacency matrix of large-scale network. A theoretical analysis reveals that the CESA reduces the time complexity of the existing sandbox algorithm from cubic to quadratic, and also improves the space complexity from quadratic

关键词： computational efficiency

GLOBAL OPTIMIZATION FOR THE PORTFOLIO SELECTION MODEL WITH HIGH-ORDER MOMENTS

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Liu Yang, Yi Zhong, Suhan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University School of Mathematics and Computational Sciences Xiangtan University Hunan Xiangtan411105 China School of Mathematics Hunan City University Hunan Yiyang413000 China Department of Mathematics Texas A&M University College StationTX77843-3368 United States

In this paper, we study the global optimality of polynomial portfolio optimization (PPO). The PPO is a kind of portfolio selection model with high-order moments and flexible risk preference parameters. We introduce a perturbation sample average approximation method, which can give a robust approximation of the PPO in form of linear conic optimization. The approximated problem can be solved globally with Moment-SOS relaxations. We summarize a semidefinite algorithm, which can be used to find reliable approximations of the optimal value and optimizer set of the PPO. Numerical examples are given to show the efficiency of the algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Global optimization