Xiaoying Dai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xiaoying Dai has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Aihui Zhou
Academy of Mathematics and Systems Science SKLMS Chinese Academy of Sciences 100190 Beijing China
14 shared publications Aihui Zhou
4 shared publicationsJack Xin
Department of Mathematics, University of California at Irvine, Irvine, USA
2 shared publications- Lianhua He
Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science LSEC Chinese Academy of Sciences 100190 Beijing China
2 shared publications - Tianyang Chu
Academy of Mathematics and Systems Science SKLMS Chinese Academy of Sciences 100190 Beijing China
2 shared publications - Xin Zhang
Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science LSEC Chinese Academy of Sciences 100190 Beijing China
2 shared publications
Latest Publications
- Open Access
A model order reduction based adaptive parareal method for time-dependent partial differential equations
In this paper, we propose a model order reduction based adaptive parareal method for time-dependent partial differential equations. By using the data obtained by the fine propagator in each iteration of the plain parareal method together with some model order reduction technique, we construct the coarse propagator adaptively in each parareal iteration, and then obtain our adaptive parareal method. We apply this new method to solve some 3D time-dependent advection-diffusion equations with the Kolmogorov flow and the ABC flow. Numerical results show the good performance of our method in simulating long-term evolution problems.
Open AccessA model order reduction based adaptive parareal method for time-dependent partial differential equations
In this paper, we propose a model order reduction based adaptive parareal method for time-dependent partial differential equations. By using the data obtained by the fine propagator in each iteration of the plain parareal method together with some model order reduction technique, we construct the coarse propagator adaptively in each parareal iteration, and then obtain our adaptive parareal method. We apply this new method to solve some 3D time-dependent advection-diffusion equations with the Kolmogorov flow and the ABC flow. Numerical results show the good performance of our method in simulating long-term evolution problems.
- Open Access
An orthogonality-preserving approach for eigenvalue problems
Solving large-scale eigenvalue problems poses a significant challenge due to the computational complexity and limitations on the parallel scalability of the orthogonalization operation, when many eigenpairs are required. In this paper, we propose an intrinsic orthogonality-preserving model, formulated as an evolution equation, and a corresponding numerical method for eigenvalue problems. The proposed approach automatically preserves orthogonality and exhibits energy dissipation during both time evolution and numerical iterations, provided that the initial data are orthogonal, thus offering an accurate and efficient approximation for the large-scale eigenvalue problems with orthogonality constraints. Furthermore, we rigorously prove the convergence of the scheme without the time step size restrictions imposed by the CFL conditions. Numerical experiments not only corroborate the validity of our theoretical analyses but also demonstrate the remarkably high efficiency of the algorithm.
Open AccessAn orthogonality-preserving approach for eigenvalue problems
Solving large-scale eigenvalue problems poses a significant challenge due to the computational complexity and limitations on the parallel scalability of the orthogonalization operation, when many eigenpairs are required. In this paper, we propose an intrinsic orthogonality-preserving model, formulated as an evolution equation, and a corresponding numerical method for eigenvalue problems. The proposed approach automatically preserves orthogonality and exhibits energy dissipation during both time evolution and numerical iterations, provided that the initial data are orthogonal, thus offering an accurate and efficient approximation for the large-scale eigenvalue problems with orthogonality constraints. Furthermore, we rigorously prove the convergence of the scheme without the time step size restrictions imposed by the CFL conditions. Numerical experiments not only corroborate the validity of our theoretical analyses but also demonstrate the remarkably high efficiency of the algorithm.
- Open Access
A gradient flow model for the Gross--Pitaevskii problem: Mathematical and numerical analysis
This paper concerns the mathematical and numerical analysis of the $L^2$ normalized gradient flow model for the Gross--Pitaevskii eigenvalue problem, which has been widely used to design the numerical schemes for the computation of the ground state of the Bose--Einstein condensate. We first provide the mathematical analysis for the model, including the well-posedness and the asymptotic behavior of the solution. Then we propose a normalized implicit-explicit fully discrete numerical scheme for the gradient flow model, and give some numerical analysis for the scheme, including the well-posedness and optimal convergence of the approximation. Some numerical experiments are provided to validate the theory.Open AccessA gradient flow model for the Gross--Pitaevskii problem: Mathematical and numerical analysis
This paper concerns the mathematical and numerical analysis of the $L^2$ normalized gradient flow model for the Gross--Pitaevskii eigenvalue problem, which has been widely used to design the numerical schemes for the computation of the ground state of the Bose--Einstein condensate. We first provide the mathematical analysis for the model, including the well-posedness and the asymptotic behavior of the solution. Then we propose a normalized implicit-explicit fully discrete numerical scheme for the gradient flow model, and give some numerical analysis for the scheme, including the well-posedness and optimal convergence of the approximation. Some numerical experiments are provided to validate the theory. - 2 July 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 7 (2) , 663-688
An Augmented Two-Scale Finite Element Method for Eigenvalue Problems
- 2 July 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 7 (2) , 663-688
An Augmented Two-Scale Finite Element Method for Eigenvalue Problems
- 25 April 2023
- Published by Elsevier in Computational Materials Science
- Vol. 226
An extended plane wave framework for the electronic structure calculations of twisted bilayer material systems
- 25 April 2023
- Published by Elsevier in Computational Materials Science
- Vol. 226
An extended plane wave framework for the electronic structure calculations of twisted bilayer material systems
- Open Access
An Augmented Subspace Based Adaptive Proper Orthogonal Decomposition Method for Time Dependent Partial Differential Equations
In this paper, we propose an augmented subspace based adaptive proper orthogonal decomposition (POD) method for solving the time dependent partial differential equations. By augmenting the POD subspace with some auxiliary modes, we obtain an augmented subspace. We use the difference between the approximation obtained in this augmented subspace and that obtained in the original POD subspace to construct an error indicator, by which we obtain a general framework for augmented subspace based adaptive POD method. We then provide two strategies to obtain some specific augmented subspaces, the random vector based augmented subspace and the coarse-grid approximations based augmented subspace. We apply our new method to two typical 3D advection-diffusion equations with the advection being the Kolmogorov flow and the ABC flow. Numerical results show that our method is more efficient than the existing adaptive POD methods, especially for the advection dominated models.
Open AccessAn Augmented Subspace Based Adaptive Proper Orthogonal Decomposition Method for Time Dependent Partial Differential Equations
In this paper, we propose an augmented subspace based adaptive proper orthogonal decomposition (POD) method for solving the time dependent partial differential equations. By augmenting the POD subspace with some auxiliary modes, we obtain an augmented subspace. We use the difference between the approximation obtained in this augmented subspace and that obtained in the original POD subspace to construct an error indicator, by which we obtain a general framework for augmented subspace based adaptive POD method. We then provide two strategies to obtain some specific augmented subspaces, the random vector based augmented subspace and the coarse-grid approximations based augmented subspace. We apply our new method to two typical 3D advection-diffusion equations with the advection being the Kolmogorov flow and the ABC flow. Numerical results show that our method is more efficient than the existing adaptive POD methods, especially for the advection dominated models.
- Open Access
An extended plane wave framework for the electronic structure calculations of twisted bilayer material systems
In this paper, we propose an extended plane wave framework to make the electronic structure calculations of the twisted bilayer 2D material systems practically feasible. Based on the foundation in [Y. Zhou, H. Chen, A. Zhou, J. Comput. Phys. 384, 99 (2019)], following extensions take place: (1) an tensor-producted basis set, which adopts PWs in the incommensurate dimensions, and localized basis in the interlayer dimension, (2) a practical application of a novel cutoff techniques we have recently developed, and (3) a quasi-band structure picture under the small twisted angles and weak interlayer coupling limits. With (1) and (2) now the dimensions of Hamiltonian matrix are reduced by about 2 orders of magnitude compared with the original framework. And (3) enables us to better organize the calculations and understand the results. For numerical examples, we study the electronic structures of the linear bilayer graphene lattice system with the magic twisted angle ($\sim 1.05^{\circ}$). The famous flat bands have been reproduced with their features in quantitative agreement with those from experiments and other theoretical calculations. Moreover, the extended framework has much less computational cost compared to the commensurate cell approximations, and is more extendable compared to the traditional model hamiltonians and tight binding models. Finally this framework can readily accommodate nonlinear models thus will laid the foundations for more effective yet accurate Density Functional Theory (DFT) calculations.
Open AccessAn extended plane wave framework for the electronic structure calculations of twisted bilayer material systems
In this paper, we propose an extended plane wave framework to make the electronic structure calculations of the twisted bilayer 2D material systems practically feasible. Based on the foundation in [Y. Zhou, H. Chen, A. Zhou, J. Comput. Phys. 384, 99 (2019)], following extensions take place: (1) an tensor-producted basis set, which adopts PWs in the incommensurate dimensions, and localized basis in the interlayer dimension, (2) a practical application of a novel cutoff techniques we have recently developed, and (3) a quasi-band structure picture under the small twisted angles and weak interlayer coupling limits. With (1) and (2) now the dimensions of Hamiltonian matrix are reduced by about 2 orders of magnitude compared with the original framework. And (3) enables us to better organize the calculations and understand the results. For numerical examples, we study the electronic structures of the linear bilayer graphene lattice system with the magic twisted angle ($\sim 1.05^{\circ}$). The famous flat bands have been reproduced with their features in quantitative agreement with those from experiments and other theoretical calculations. Moreover, the extended framework has much less computational cost compared to the commensurate cell approximations, and is more extendable compared to the traditional model hamiltonians and tight binding models. Finally this framework can readily accommodate nonlinear models thus will laid the foundations for more effective yet accurate Density Functional Theory (DFT) calculations.
- 19 December 2022
- Published by Springer Nature
- p. 447-478
Finite Element Methods for Density Functional Theory
- 19 December 2022
- Published by Springer Nature
- p. 447-478
Finite Element Methods for Density Functional Theory
- Open Access
Convergence and Complexity of an Adaptive Planewave Method for Eigenvalue Computations
In this paper, we study the adaptive planewave discretization for a cluster of eigenvalues of second-order elliptic partial differential equations. We first design an a posteriori error estimator and prove both the upper and lower bounds. Based on the a posteriori error estimator, we propose an adaptive planewave method. We then prove that the adaptive planewave approximations have the linear convergence rate and quasi-optimal complexity.
Open AccessConvergence and Complexity of an Adaptive Planewave Method for Eigenvalue Computations
In this paper, we study the adaptive planewave discretization for a cluster of eigenvalues of second-order elliptic partial differential equations. We first design an a posteriori error estimator and prove both the upper and lower bounds. Based on the a posteriori error estimator, we propose an adaptive planewave method. We then prove that the adaptive planewave approximations have the linear convergence rate and quasi-optimal complexity.
- Open Access
Convergent and orthogonality preserving schemes for approximating the Kohn-Sham orbitals
To obtain convergent numerical approximations without using any orthogonalization operations is of great importance in electronic structure calculations. In this paper, we propose and analyze a class of iteration schemes for the discretized Kohn- Sham Density Functional Theory model, with which the iterative approximations are guaranteed to converge to the Kohn-Sham orbitals exponentially without any orthogonalization as long as the initial orbitals are orthogonal and the time step sizes are given properly. In addition, we present a feasible and efficient approach to get suitable time step sizes and report some numerical experiments to validate our theory.
Open AccessConvergent and orthogonality preserving schemes for approximating the Kohn-Sham orbitals
To obtain convergent numerical approximations without using any orthogonalization operations is of great importance in electronic structure calculations. In this paper, we propose and analyze a class of iteration schemes for the discretized Kohn- Sham Density Functional Theory model, with which the iterative approximations are guaranteed to converge to the Kohn-Sham orbitals exponentially without any orthogonalization as long as the initial orbitals are orthogonal and the time step sizes are given properly. In addition, we present a feasible and efficient approach to get suitable time step sizes and report some numerical experiments to validate our theory.