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

Designing a minimal Landau theory to stabilize desired quasicrystals

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Si, Wei Li, Shifeng Zhang, Pingwen Shi, An-Chang Jiang, Kai School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan411105 China LMAM CAPT and School of Mathematical Sciences Peking University Beijing100871 China School of Mathematics and Statistics Wuhan University Wuhan430072 China Department of Physics and Astronomy McMaster University HamiltonL8S 4M1 Canada

Interparticle interactions with multiple length scales play a pivotal role in the formation and stability of quasicrystals. Choosing a minimal set of length scales to stabilize a given quasicrystal is a challenging problem. To address this challenge, we propose an intelligent screening method (ISM) to design a Landau theory with a minimal number of length scales – referred to as the minimal Landau theory – that includes only the essential length scales necessary to stabilize quasicrystals. Based on a generalized multiple-length-scale Landau theory, ISM first evaluates various spectral configurations of candidate structures under a hard constraint. It then identifies the configuration with the lowest free energy. Using this optimal configuration, ISM calculates phase diagrams to explore the thermodynamic stability of desired quasicrystals. ISM can design a minimal Landau theory capable of stabilizing the desired quasicrystals by incrementally increasing the number of length scales. Our application of ISM has not only confirmed known behaviors in 10- and 12-fold quasicrystals but also led to a significant prediction that quasicrystals with 8-, 14-, 16-, and 18-fold symmetry could be stable within three-length-scale Landau models. © 2024, CC BY-NC-ND.

关键词： Free energy

The Mean Time to Absorption on Horizontal Partitioned Sierpinski Gasket Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhang, Zhizhuo Wu, Bo Yu, Zuguo School of Mathematics Southeast University Nanjing210023 China School of Applied Mathematics Nanjing University of Finance and Economics Nanjing210023 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan411105 China

The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk is the mean time to absorption, which plays an extremely important role in the study of topology, dynamics and practical application of complex networks. Analyzing the mean time to absorption on the regular iterative self-similar network models is an important way to explore the influence of self-similarity on the properties of random walks on the network. The existing literatures have proved that even local self-similar structures can greatly affect the properties of random walks on the global network, but they have failed to prove whether these effects are related to the scale of these self-similar structures. In this article, we construct and study a class of Horizontal Partitioned Sierpinski Gasket network model based on the classic Sierpinski gasket network, which is composed of local self-similar structures, and the scale of these structures will be controlled by the partition coefficient k. Then, the analytical expressions and approximate expressions of the mean time to absorption on the network model are obtained, which prove that the size of the self-similar structure in the network will directly restrict the influence of the self-similar structure on the properties of random walks on the network. Finally, we also analyzed the mean time to absorption of different absorption nodes on the network to find the location of the node with the highest absorption efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Complex networks

A Multi-scale Generalized Shrinkage Threshold Network for Image Blind Deblurring in Remote Sensing

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Feng, Yujie Yang, Yin Fan, Xiaohong Zhang, Zhengpeng Zhang, Jianping School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory for Intelligent Computing and Information Processing The Ministry of Education Xiangtan411105 China School of Mathematics and Computational Science Xiangtan University National Center for Applied Mathematics in Hunan Hunan International Scientific and Technological Innovation Cooperation Base of Computational Science Xiangtan411105 China School of Automation and Electronic Information Xiangtan University Xiangtan411105 China

MSC Codes 54H30, 68U10, 94A08Remote sensing images are essential for many applications of the earth’s sciences, but their quality can usually be degraded due to limitations in sensor technology and complex imaging environments. To address this, various remote sensing image deblurring methods have been developed to restore sharp and high-quality images from degraded observational data. However, most traditional model-based deblurring methods usually require predefined hand-crafted prior assumptions, which are difficult to handle in complex applications. On the other hand, deep learning-based deblurring methods are often considered as black boxes, lacking transparency and interpretability. In this work, we propose a new blind deblurring learning framework that utilizes alternating iterations of shrinkage thresholds. This framework involves updating blurring kernels and images, with a theoretical foundation in network design. Additionally, we propose a learnable blur kernel proximal mapping module to improve the accuracy of the blur kernel reconstruction. Furthermore, we propose a deep proximal mapping module in the image domain, which combines a generalized shrinkage threshold with a multi-scale prior feature extraction block. This module also incorporates an attention mechanism to learn adaptively the importance of prior information, improving the flexibility and robustness of prior terms, and avoiding limitations similar to hand-crafted image prior terms. Consequently, we design a novel multi-scale generalized shrinkage threshold network (MGSTNet) that focuses specifically on learning deep geometric prior features to enhance image restoration. Experimental results on real and synthetic remote sensing image datasets demonstrate the superiority of our MGSTNet framework compared to existing deblurring methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Shrinkage

Lattice Boltzmann simulation reveals supercritical bifurcation in flow mode transitions of power-law fluids in the four-roll mill

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yu, Yuan Jiang, Xiao Gu, Qingqing Lin, Chuandong Zhu, Qingyong Yuan, Hai-Zhuan School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China National Center for Applied Mathematics in Hunan Xiangtan411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan411105 China School of Energy and Power Engineering University of Shanghai for Science and Technology Shanghai200093 China Sino-French Institute of Nuclear Engineering and Technology Sun Yat-sen University Zhuhai519082 China School of Aeronautics and Astronautics Sun Yat-sen University Shenzhen518107 China

The four-roll mill has been traditionally viewed as a device generating simple extensional flow with a central stagnation point. Our systematic investigation using a two-relaxation-time regularized lattice Boltzmann (TRT-RLB) model reveals unexpected richness in the flow physics, identifying two previously unreported supercritical bifurcation modes: a quadrifoliate vortex mode featuring four symmetrical counter-rotating vortices, and a dumbbell-shaped quad-vortex mode where vortices detach from but remain symmetric about the stagnation point. The numerical framework, representing the first successful extension of TRT-RLB method to power-law fluid dynamics, enables comprehensive mapping of flow characteristics across Reynolds numbers (1 ≤ Re ≤ 50), power-law indices (0.7 ≤ n ≤ 1.3), and geometric configurations. The transition from quadrifoliate vortex mode exhibits distinct pathways depending on the power-law index: at relatively small n, the flow undergoes a direct supercritical bifurcation to simple extensional flow, while at relatively large n, it evolves through an intermediate dumbbell-shaped state. Among geometric parameters, the roller radius r emerges as the dominant factor controlling bifurcation points and vortex dimensions, whereas the roller-container gap δ exerts minimal influence on flow regimes. The transitions between flow modes can be precisely characterized through the evolution of vortex dimensions and velocity gradients at the stagnation point, providing quantitative criteria for flow regime identification. These findings enrich our fundamental understanding of bifurcation phenomena in extensional devices and provide quantitative guidelines for achieving desired flow patterns in four-roll mill applications. Copyright © 2025, The Authors. All rights reserved.

关键词： Vortex flow

MVMS-RCN: A Dual-Domain Unified CT Reconstruction with Multi-sparse-view and Multi-scale Refinement-correction

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Fan, Xiaohong Chen, Ke Yi, Huaming Yang, Yin Zhang, Jianping The School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan411105 China The Centre for Mathematical Imaging Techniques Department of Mathematical Sciences The University of Liverpool LiverpoolL6972L United Kingdom The School of Mathematics and Computational Science Xiangtan University Hunan National Applied Mathematics Center Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan411105 China

X-ray Computed Tomography (CT) is one of the most important diagnostic imaging techniques in clinical applications. Sparse-view CT imaging reduces the number of projection views to a lower radiation dose and alleviates the potential risk of radiation exposure. Most existing deep learning (DL) and deep unfolding sparse-view CT reconstruction methods: 1) do not fully use the projection data;2) do not always link their architecture designs to a mathematical theory;3) do not flexibly deal with multi-sparse-view reconstruction assignments. This paper aims to use mathematical ideas and design optimal DL imaging algorithms for sparse-view CT reconstructions. We propose a novel dual-domain unified framework that offers a great deal of flexibility for multi-sparse-view CT reconstruction through a single model. This framework combines the theoretical advantages of model-based methods with the superior reconstruction performance of DL-based methods, resulting in the expected generalizability of DL. We propose a refinement module that utilizes unfolding projection domain to refine full-sparse-view projection errors, as well as an image domain correction module that distills multi-scale geometric error corrections to reconstruct sparse-view CT. This provides us with a new way to explore the potential of projection information and a new perspective on designing network architectures. The multi-scale geometric correction module is end-to-end learnable, and our method could function as a plug-and-play reconstruction technique, adaptable to various applications. Extensive experiments demonstrate that our framework is superior to other existing state-of-the-art methods. Our source codes are available at https://***/fanxiaohong/MVMS-RCN. Copyright © 2024, The Authors. All rights reserved.

关键词： Geometry

RECOVERY TYPE A POSTERIORI ERROR ESTIMATION OF AN ADAPTIVE FINITE ELEMENT METHOD FOR CAHN-HILLIARD EQUATION

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Yaoyao Huang, Yunqing Yi, Nianyu Yin, Peimeng School of Mathematics and Statistics Anhui Normal University Wuhu241000 China Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Multiscale Methods and Dynamics Group Computer Science and Mathematics Division Oak Ridge National Laboratory Oak RidgeTN37831 United States

In this paper, we derive a novel recovery type a posteriori error estimation of the Crank-Nicolson finite element method for the Cahn-Hilliard equation. To achieve this, we employ both the elliptic reconstruction technique and a time reconstruction technique based on three time-level approximations, resulting in an optimal a posteriori error estimator. We propose a time-space adaptive algorithm that utilizes the derived a posteriori error estimator as error indicators. Numerical experiments are presented to validate the theoretical findings, including comparing with an adaptive finite element method based on a residual type a posteriori error estimator. © 2023, CC BY-NC-ND.

关键词： Recovery

UNCONDITIONALLY ENERGY STABLE IEQ-FEMS FOR THE CAHN-HILLIARD EQUATION AND ALLEN-CAHN EQUATION

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Yaoyao Liu, Hailiang Yi, Nianyu Yin, Peimeng School of Mathematics and Statistics Anhui Normal University Anhui Wuhu241000 China Department of Mathematics Iowa State University AmesIA50011 United States Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Department of Mathematical Sciences The University of Texas at El Paso El PasoTX79968 United States

In this paper, we present several unconditionally energy-stable invariant energy quadratization (IEQ) finite element methods (FEMs) with linear, first- and second-order accuracy for solving both the Cahn-Hilliard equation and the Allen-Cahn equation. For time discretization, we compare three distinct IEQ-FEM schemes that position the intermediate function introduced by the IEQ approach in different function spaces: finite element space, continuous function space, or a combination of these spaces. Rigorous proofs establishing the existence and uniqueness of the numerical solution, along with analyses of energy dissipation for both equations and mass conservation for the Cahn-Hilliard equation, are provided. The proposed schemes' accuracy, efficiency, and solution properties are demonstrated through numerical experiments. © 2024, CC BY-NC-ND.

关键词： Finite element method

A Hybrid Iterative Neural Solver Based on Spectral Analysis for Parametric PDEs

学校读者我要写书评

暂无评论

Journal of computational Physics 2025年

作者： Chen Cui Kai Jiang Yun Liu Shi Shu 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 Xiangtan 411105 Hunan China

Recently, deep learning-based hybrid iterative methods (DL-HIM) have emerged as a promising approach for designing fast neural solvers to tackle large-scale sparse linear systems. DL-HIM combine the smoothing effect of simple iterative methods with the spectral bias of neural networks, which allows them to effectively eliminate both high-frequency and low-frequency error components. However, their efficiency may decrease if simple iterative methods can not provide effective smoothing, making it difficult for the neural network to learn mid-frequency and high-frequency components. This paper first conducts a convergence analysis for general DL-HIM from a spectral viewpoint, concluding that under reasonable assumptions, DL-HIM exhibit a convergence rate independent of grid size h and physical parameters μ . To meet these assumptions, we design a neural network from an eigen perspective, focusing on learning the eigenvalues and eigenvectors corresponding to error components that simple iterative methods struggle to eliminate. Specifically, the eigenvalues are learned by a meta subnet, while the eigenvectors are approximated using Fourier modes with a transition matrix provided by another meta subnet. The resulting DL-HIM, termed the Fourier Neural Solver (FNS), can be trained to achieve a convergence rate independent of PDE parameters and grid size within a local neighborhood of the training scale by designing a loss function that ensures the neural network complements the smoothing effect of Jacobi iterative methods. We verify the performance of FNS on six types of linear parametric PDEs.

关键词：

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