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

Investigation on a quantum algorithm for linear differential equations

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dong, Xiaojing Peng, Yizhe Tang, Qili Yang, Yin Yu, Yue Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

Ref. [BCOW1.] introduced a pioneering quantum approach (coined BCOW algorithm) for solving linear differential equations with optimal error tolerance. Originally designed for a specific class of diagonalizable linear differential equations, the algorithm was extended by Krovi in [Kro23] to encompass broader classes, including non-diagonalizable and even singular matrices. Despite the common misconception, the original algorithm is indeed applicable to non-diagonalizable matrices, with diagonalisation primarily serving for theoretical analyses to establish bounds on condition number and solution error. By leveraging basic estimates from [Kro23], we derive bounds comparable to those outlined in the Krovi algorithm, thereby reinstating the advantages of the BCOW approach. Furthermore, we extend the BCOW algorithm to address time-dependent linear differential equations by transforming non-autonomous systems into higher-dimensional autonomous ones, a technique also applicable for the Krovi algorithm. © 2024, CC BY-NC-ND.

关键词： Consensus algorithm

A two-dimensional GeSe/SnSe heterostructure for high performance thin-film solar cells

学校读者我要写书评

暂无评论

Journal of Materials Chemistry A 2019年第18期7卷 11265-11271页

作者： Yuliang Mao Congsheng Xu Jianmei Yuan Hongquan Zhao Hunan Key Laboratory for Micro-Nano Energy Materials and Devices School of Physics and Optoelectronics Xiangtan University Hunan 411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan 411105 China Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing 401120 China

Based on the first-principles calculations, we demonstrated that a GeSe/SnSe heterostructure has type-II band alignment and a direct band gap, which can effectively prevent the recombination of photogenerated electron–hole pairs. Moreover, the GeSe/SnSe heterostructure also exhibits strong optical absorption intensity, which can reach the order of 1.⁵ cm^−1./sup>. Our predicted photoelectric conversion efficiency (PCE) for the GeSe/SnSe heterostructure reaches 21.47%. We also found that the hole carrier mobility of the GeSe/SnSe heterostructure along the x direction has been significantly improved to 6.42 × 1.⁴ cm² V^−1./sup> s^−1./sup>, which is higher than that of black phosphorus (1.× 1.⁴ cm² V^−1./sup> s^−1./sup>). By applying a vertical external electric field, we found that the band gap and band offset of the GeSe/SnSe heterojunction can be effectively tuned. The revealed type-II band alignment, strong optical absorption, superior PCE and superior hole carrier mobility of the GeSe/SnSe heterostructure imply that this new proposed material has broad application prospects in solar cells.

关键词：

The grad-div conforming virtual element method for the quad-div problem in three dimensions

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dong, Xiaojing Han, Yibing Huang, Yunqing Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Er huan Road Hunan Xiangtan411105 China

We propose a new stable variational formulation for the quad-div problem in three dimensions and prove its well-posedness. Using this weak form, we develop and analyze the H(grad-div)-conforming virtual element method of arbitrary approximation orders on polyhedral meshes. Three families of H(grad-div)conforming virtual elements are constructed based on the structure of a de Rham sub-complex with enhanced smoothness, resulting in an exact discrete virtual element complex. In the lowest-order case, the simplest element has only one degree of freedom at each vertex and face, respectively. We rigorously prove the interpolation error estimates, the stability of discrete bilinear forms, the well-posedness of discrete formulation and the optimal error estimates. Some numerical examples are shown to verify the theoretical results. © 2024, CC BY-NC-ND.

关键词： Mesh generation

A spatial sixth-order CCD-TVD method for solving multidimensional coupled Burgers' equation

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Pan, Kejia Wu, Xiaoxin Yue, Xiaoqiang Ni, Runxin School of Mathematics and Statistics Central South University Changsha Hunan410083 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Hunan411105 China

In this paper, an efficient and high-order accuracy finite difference method is proposed for solving multidimensional nonlinear Burgers' equation. The third-order three stage Runge-Kutta total variation diminishing (TVD) scheme is employed for the time discretization, and the three-point combined compact difference (CCD) scheme is used for spatial discretization. Our method is third-order accurate in time and sixth-order accurate in space. The CCD-TVD method treats the nonlinear term explicitly thus it is very efficient and easy to implement. In addition, we prove the unique solvability of the CCD system under non-periodic boundary conditions. Numerical experiments including both two-dimensional and three-dimensional problems have been conducted to demonstrate the high efficiency and accuracy of the proposed method. Copyright © 201., The Authors. All rights reserved.

关键词： Runge Kutta methods

Low-rank generalized alternating direction implicit iteration method for solving matrix equations

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Juan Xun, Wenlu Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan China School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan China

This paper presents an effective low-rank generalized alternating direction implicit iteration (R-GADI) method for solving large-scale sparse and stable Lyapunov matrix equations and continuous-time algebraic Riccati matrix equations. The method is based on generalized alternating direction implicit iteration (GADI), which exploits the low-rank property of matrices and utilizes the Cholesky factorization approach for solving. The advantage of the new algorithm lies in its direct and efficient low-rank formulation, which is a variant of the Cholesky decomposition in the Lyapunov GADI method, saving storage space and making it computationally effective. When solving the continuous-time algebraic Riccati matrix equation, the Riccati equation is first simplified to a Lyapunov equation using the Newton method, and then the R-GADI method is employed for computation. Additionally, we analyze the convergence of the R-GADI method and prove its consistency with the convergence of the GADI method. Finally, the effectiveness of the new algorithm is demonstrated through corresponding numerical experiments. Copyright © 2024, The Authors. All rights reserved.

关键词： Riccati equations

A general alternating direction implicit iteration method for solving complex symmetric linear systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Juan Xun, Wenlu Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan China School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan China

We have introduced the generalized alternating direction implicit iteration (GADI) method for solving large sparse complex symmetric linear systems and proved its convergence properties. Additionally, some numerical results have demonstrated the effectiveness of this algorithm. Furthermore, as an application of the GADI method in solving complex symmetric linear systems, we utilized the flattening operator and Kronecker product properties to solve Lyapunov and Riccati equations with complex coefficients using the GADI method. In solving the Riccati equation, we combined inner and outer iterations, first simplifying the Riccati equation into a Lyapunov equation using the Newton method, and then applying the GADI method for solution. Finally, we provided convergence analysis of the method and corresponding numerical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Riccati equations

Adaptive BDDC algorithms for the system arising from plane wave discretization of Helmholtz equations

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Peng, Jie Wang, Junxian Shu, Shi School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan411105 China

Balancing domain decomposition by constraints (BDDC) algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least-squares (PWLS) discritization of Helmholtz equations with high and various wave numbers. The unknowns to be solved in this preconditioned system are defined on elements rather than vertices or edges, which are different from the well-known discritizations such as the classical finite element method. Through choosing suitable "interface" and appropriate primal constraints with complex coefficients and introducing some local techniques, we developed a two-level adaptive BDDC algorithm for the PWLS discretization, and the condition number of the preconditioned system is proved to be bounded above by a user-defined tolerance and a constant which is only dependent on the maximum number of interfaces per subdomain. A multilevel algorithm is also attempted to resolve the bottleneck in large scale coarse problem. Numerical results are carried out to confirm the theoretical results and illustrate the efficiency of the proposed *** Codes 65N30, 65F1., 65N55 Copyright © 201., The Authors. All rights reserved.

关键词： Helmholtz equation

Low-rank alternating direction doubling algorithm for solving large-scale continuous time algebraic Riccati equations

学校读者我要写书评

暂无评论

arXiv 2024年

This paper proposes an effective low-rank alternating direction doubling algorithm (R-ADDA) for computing numerical low-rank solutions to large-scale sparse continuous-time algebraic Riccati matrix equations. The method is based on the alternating direction doubling algorithm (ADDA), utilizing the low-rank property of matrices and employing Cholesky factorization for solving. The advantage of the new algorithm lies in computing only the 2k-th approximation during the iterative process, instead of every approximation. Its efficient low-rank formula saves storage space and is highly effective from a computational perspective. Finally, the effectiveness of the new algorithm is demonstrated through theoretical analysis and numerical experiments. Copyright © 2024, The Authors. All rights reserved.

关键词： Matrix algebra

Fast θ -Maruyama scheme for stochastic Volterra integral equations of convolution type: mean-square stability and strong convergence analysis

学校读者我要写书评

暂无评论

computational and Applied Mathematics 2023年第3期42卷

作者： Wang, Mengjie Dai, Xinjie Yu, Yanyan Xiao, Aiguo Hunan Key Laboratory for Computation and Simulation in Science and Engineering National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Yunnan University Yunnan Kunming650504 China

In this paper, a fast θ-Maruyama method is proposed for solving stochastic Volterra integral equations of convolution type with singular and Hölder continuous kernels based on the sum-of-exponentials approximation. Furthermore, the average storage O(N) and the calculation cost O(N2) of θ-Maruyama scheme are reduced to O(log N) and O(Nlog N) for T 1.or O(log 2N) and O(Nlog 2N) for T≈ 1., respectively, which implies that the fast θ-Maruyama scheme is confirmed to improve the computational efficiency of the θ-Maruyama method. Under the local Lipschitz and linear growth conditions, strong convergence of the given numerical scheme are obtained. Then, for the linear test equation, we show the asymptotic behavior of solutions in mean square sense. Further, we obtain the explicit structure of the stability matrices and some numerical results of the mean-square stability for the fast θ-Maruyama method applied to the linear test equation. Finally, some numerical experiments are also given to illustrate the effectiveness of the method. © 2023, The Author(s) under exclusive licence to Sociedade Brasileira de Matemática Aplicada e Computacional.

关键词： computational efficiency