In this article, we develop a fully Discrete Galerkin(DG) method for solving ini- tial value fractional integro-differential equations(FIDEs). We consider Generalized Jacobi polynomials(CJPs) with indexes corres...In this article, we develop a fully Discrete Galerkin(DG) method for solving ini- tial value fractional integro-differential equations(FIDEs). We consider Generalized Jacobi polynomials(CJPs) with indexes corresponding to the number of homogeneous initial conditions as natural basis functions for the approximate solution. The fractional derivatives are used in the Caputo sense. The numerical solvability of algebraic system obtained from implementation of proposed method for a special case of FIDEs is investigated. We also provide a suitable convergence analysis to approximate solutions under a more general regularity assumption on the exact solution. Numerical results are presented to demonstrate the effectiveness of the proposed method.展开更多
In this paper,we develop bound-preserving discontinuous Galerkin(DG)methods for chemical reactive flows.There are several difficulties in constructing suitable numerical schemes.First of all,the density and internal e...In this paper,we develop bound-preserving discontinuous Galerkin(DG)methods for chemical reactive flows.There are several difficulties in constructing suitable numerical schemes.First of all,the density and internal energy are positive,and the mass fraction of each species is between 0 and 1.Second,due to the rapid reaction rate,the system may contain stiff sources,and the strong-stability-preserving explicit Runge-Kutta method may result in limited time-step sizes.To obtain physically relevant numerical approximations,we apply the bound-preserving technique to the DG methods.Though traditional positivity-preserving techniques can successfully yield positive density,internal energy,and mass fractions,they may not enforce the upper bound 1 of the mass fractions.To solve this problem,we need to(i)make sure the numerical fluxes in the equations of the mass fractions are consistent with that in the equation of the density;(ii)choose conservative time integrations,such that the summation of the mass fractions is preserved.With the above two conditions,the positive mass fractions have summation 1,and then,they are all between 0 and 1.For time discretization,we apply the modified Runge-Kutta/multi-step Patankar methods,which are explicit for the flux while implicit for the source.Such methods can handle stiff sources with relatively large time steps,preserve the positivity of the target variables,and keep the summation of the mass fractions to be 1.Finally,it is not straightforward to combine the bound-preserving DG methods and the Patankar time integrations.The positivity-preserving technique for DG methods requires positive numerical approximations at the cell interfaces,while Patankar methods can keep the positivity of the pre-selected point values of the target variables.To match the degree of freedom,we use polynomials on rectangular meshes for problems in two space dimensions.To evolve in time,we first read the polynomials at the Gaussian points.Then,suitable slope limiters can be applied to enforce the positivity of the solutions at those points,which can be preserved by the Patankar methods,leading to positive updated numerical cell averages.In addition,we use another slope limiter to get positive solutions used for the bound-preserving technique for the flux.Numerical examples are given to demonstrate the good performance of the proposed schemes.展开更多
In this paper,we construct a high-order discontinuous Galerkin(DG)method which can preserve the positivity of the density and the pressure for the viscous and resistive magnetohydrodynamics(VRMHD).To control the diver...In this paper,we construct a high-order discontinuous Galerkin(DG)method which can preserve the positivity of the density and the pressure for the viscous and resistive magnetohydrodynamics(VRMHD).To control the divergence error in the magnetic field,both the local divergence-free basis and the Godunov source term would be employed for the multi-dimensional VRMHD.Rigorous theoretical analyses are presented for one-dimensional and multi-dimensional DG schemes,respectively,showing that the scheme can maintain the positivity-preserving(PP)property under some CFL conditions when combined with the strong-stability-preserving time discretization.Then,general frameworks are established to construct the PP limiter for arbitrary order of accuracy DG schemes.Numerical tests demonstrate the effectiveness of the proposed schemes.展开更多
In this paper,numerical experiments are carried out to investigate the impact of penalty parameters in the numerical traces on the resonance errors of high-order multiscale discontinuous Galerkin(DG)methods(Dong et al...In this paper,numerical experiments are carried out to investigate the impact of penalty parameters in the numerical traces on the resonance errors of high-order multiscale discontinuous Galerkin(DG)methods(Dong et al.in J Sci Comput 66:321–345,2016;Dong and Wang in J Comput Appl Math 380:1–11,2020)for a one-dimensional stationary Schrödinger equation.Previous work showed that penalty parameters were required to be positive in error analysis,but the methods with zero penalty parameters worked fine in numerical simulations on coarse meshes.In this work,by performing extensive numerical experiments,we discover that zero penalty parameters lead to resonance errors in the multiscale DG methods,and taking positive penalty parameters can effectively reduce resonance errors and make the matrix in the global linear system have better condition numbers.展开更多
In this paper,we propose a novel Local Macroscopic Conservative(LoMaC)low rank tensor method with discontinuous Galerkin(DG)discretization for the physical and phase spaces for simulating the Vlasov-Poisson(VP)system....In this paper,we propose a novel Local Macroscopic Conservative(LoMaC)low rank tensor method with discontinuous Galerkin(DG)discretization for the physical and phase spaces for simulating the Vlasov-Poisson(VP)system.The LoMaC property refers to the exact local conservation of macroscopic mass,momentum,and energy at the discrete level.The recently developed LoMaC low rank tensor algorithm(arXiv:2207.00518)simultaneously evolves the macroscopic conservation laws of mass,momentum,and energy using the kinetic flux vector splitting;then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables.This paper is a generalization of our previous work,but with DG discretization to take advantage of its compactness and flexibility in handling boundary conditions and its superior accuracy in the long term.The algorithm is developed in a similar fashion as that for a finite difference scheme,by observing that the DG method can be viewed equivalently in a nodal fashion.With the nodal DG method,assuming a tensorized computational grid,one will be able to(i)derive differentiation matrices for different nodal points based on a DG upwind discretization of transport terms,and(ii)define a weighted inner product space based on the nodal DG grid points.The algorithm can be extended to the high dimensional problems by hierarchical Tucker(HT)decomposition of solution tensors and a corresponding conservative projection algorithm.In a similar spirit,the algorithm can be extended to DG methods on nodal points of an unstructured mesh,or to other types of discretization,e.g.,the spectral method in velocity direction.Extensive numerical results are performed to showcase the efficacy of the method.展开更多
In this paper,the uniform error estimates with respect to t∈[0, ∞ ) of the nonlinear Galerkin method are given for the long time integration of the Kuramoto-Sivashinsky equation. The nonlinear Galerkin method is use...In this paper,the uniform error estimates with respect to t∈[0, ∞ ) of the nonlinear Galerkin method are given for the long time integration of the Kuramoto-Sivashinsky equation. The nonlinear Galerkin method is used to study the asymptotic behaviour of Kuramoto-Sivashinsky equation and to construct the bifurcation diagrams.展开更多
This paper deals with the inertial manifold and the approximate inertialmanifold concepts of the Navier-Stokes equations with nonhomogeneous boundary conditions and inertial algorithm. Furtheremore,we provide the erro...This paper deals with the inertial manifold and the approximate inertialmanifold concepts of the Navier-Stokes equations with nonhomogeneous boundary conditions and inertial algorithm. Furtheremore,we provide the error estimates of the approximate solutions of the Navier-Stokes Equations.展开更多
A computational technique is proposed for the Galerkin discretization of axially moving strings with geometric nonlinearity. The Galerkin discretization is based on the eigenfunctions of stationary strings. The discre...A computational technique is proposed for the Galerkin discretization of axially moving strings with geometric nonlinearity. The Galerkin discretization is based on the eigenfunctions of stationary strings. The discretized equations are simplified by regrouping nonlinear terms to reduce the computation work. The scheme can be easily implemented in the practical programming. Numerical results show the effectiveness of the technique. The results also highlight the feature of Galerkin's discretization of gyroscopic continua that the term number in Galerkin's discretization should be even. The technique is generalized from elastic strings to viscoelastic strings.展开更多
This paper discuss stability of the full discrete nonlinear Galerkin method based on the approximation inertial manifold method for some nonlinear evolution equation, for example, some nonlinear reactor equation and N...This paper discuss stability of the full discrete nonlinear Galerkin method based on the approximation inertial manifold method for some nonlinear evolution equation, for example, some nonlinear reactor equation and Navier-Stokes Equation. In the paper we provide some necessary and sufficient conditions of stability.展开更多
The complex structure and strong heterogeneity of advanced nuclear reactor systems pose challenges for high-fidelity neutron-shielding calculations. Unstructured meshes exhibit strong geometric adaptability and can ov...The complex structure and strong heterogeneity of advanced nuclear reactor systems pose challenges for high-fidelity neutron-shielding calculations. Unstructured meshes exhibit strong geometric adaptability and can overcome the deficiencies of conventionally structured meshes in complex geometry modeling. A multithreaded parallel upwind sweep algorithm for S_(N) transport was proposed to achieve a more accurate geometric description and improve the computational efficiency. The spatial variables were discretized using the standard discontinuous Galerkin finite-element method. The angular flux transmission between neighboring meshes was handled using an upwind scheme. In addition, a combination of a mesh transport sweep and angular iterations was realized using a multithreaded parallel technique. The algorithm was implemented in the 2D/3D S_(N) transport code ThorSNIPE, and numerical evaluations were conducted using three typical benchmark problems:IAEA, Kobayashi-3i, and VENUS-3. These numerical results indicate that the multithreaded parallel upwind sweep algorithm can achieve high computational efficiency. ThorSNIPE, with a multithreaded parallel upwind sweep algorithm, has good reliability, stability, and high efficiency, making it suitable for complex shielding calculations.展开更多
对于结构动力分析中的离散系统运动方程,现有算法的计算精度和效率均依赖于时间步长的选取,这是时间域问题求解的难点.基于EEP(element energy projection)超收敛计算的自适应有限元法,以EEP超收敛解代替未知真解,估计常规有限元解的误...对于结构动力分析中的离散系统运动方程,现有算法的计算精度和效率均依赖于时间步长的选取,这是时间域问题求解的难点.基于EEP(element energy projection)超收敛计算的自适应有限元法,以EEP超收敛解代替未知真解,估计常规有限元解的误差,并自动细分网格,目前已对诸类以空间坐标为自变量的边值问题取得成功.对离散系统运动方程建立弱型Galerkin有限元解,引入基于EEP法的自适应求解策略,在时间域上自动划分网格,最终得到所求时域内任一时刻均满足给定误差限的动位移解,进而建立了一种时间域上的新型自适应求解算法.展开更多
文摘In this article, we develop a fully Discrete Galerkin(DG) method for solving ini- tial value fractional integro-differential equations(FIDEs). We consider Generalized Jacobi polynomials(CJPs) with indexes corresponding to the number of homogeneous initial conditions as natural basis functions for the approximate solution. The fractional derivatives are used in the Caputo sense. The numerical solvability of algebraic system obtained from implementation of proposed method for a special case of FIDEs is investigated. We also provide a suitable convergence analysis to approximate solutions under a more general regularity assumption on the exact solution. Numerical results are presented to demonstrate the effectiveness of the proposed method.
基金supported by the NSF under Grant DMS-1818467Simons Foundation under Grant 961585.
文摘In this paper,we develop bound-preserving discontinuous Galerkin(DG)methods for chemical reactive flows.There are several difficulties in constructing suitable numerical schemes.First of all,the density and internal energy are positive,and the mass fraction of each species is between 0 and 1.Second,due to the rapid reaction rate,the system may contain stiff sources,and the strong-stability-preserving explicit Runge-Kutta method may result in limited time-step sizes.To obtain physically relevant numerical approximations,we apply the bound-preserving technique to the DG methods.Though traditional positivity-preserving techniques can successfully yield positive density,internal energy,and mass fractions,they may not enforce the upper bound 1 of the mass fractions.To solve this problem,we need to(i)make sure the numerical fluxes in the equations of the mass fractions are consistent with that in the equation of the density;(ii)choose conservative time integrations,such that the summation of the mass fractions is preserved.With the above two conditions,the positive mass fractions have summation 1,and then,they are all between 0 and 1.For time discretization,we apply the modified Runge-Kutta/multi-step Patankar methods,which are explicit for the flux while implicit for the source.Such methods can handle stiff sources with relatively large time steps,preserve the positivity of the target variables,and keep the summation of the mass fractions to be 1.Finally,it is not straightforward to combine the bound-preserving DG methods and the Patankar time integrations.The positivity-preserving technique for DG methods requires positive numerical approximations at the cell interfaces,while Patankar methods can keep the positivity of the pre-selected point values of the target variables.To match the degree of freedom,we use polynomials on rectangular meshes for problems in two space dimensions.To evolve in time,we first read the polynomials at the Gaussian points.Then,suitable slope limiters can be applied to enforce the positivity of the solutions at those points,which can be preserved by the Patankar methods,leading to positive updated numerical cell averages.In addition,we use another slope limiter to get positive solutions used for the bound-preserving technique for the flux.Numerical examples are given to demonstrate the good performance of the proposed schemes.
基金supported by the NSFC Grant 11901555,12271499the Cyrus Tang Foundationsupported by the NSFC Grant 11871448 and 12126604.
文摘In this paper,we construct a high-order discontinuous Galerkin(DG)method which can preserve the positivity of the density and the pressure for the viscous and resistive magnetohydrodynamics(VRMHD).To control the divergence error in the magnetic field,both the local divergence-free basis and the Godunov source term would be employed for the multi-dimensional VRMHD.Rigorous theoretical analyses are presented for one-dimensional and multi-dimensional DG schemes,respectively,showing that the scheme can maintain the positivity-preserving(PP)property under some CFL conditions when combined with the strong-stability-preserving time discretization.Then,general frameworks are established to construct the PP limiter for arbitrary order of accuracy DG schemes.Numerical tests demonstrate the effectiveness of the proposed schemes.
基金supported by the National Science Foundation grant DMS-1818998.
文摘In this paper,numerical experiments are carried out to investigate the impact of penalty parameters in the numerical traces on the resonance errors of high-order multiscale discontinuous Galerkin(DG)methods(Dong et al.in J Sci Comput 66:321–345,2016;Dong and Wang in J Comput Appl Math 380:1–11,2020)for a one-dimensional stationary Schrödinger equation.Previous work showed that penalty parameters were required to be positive in error analysis,but the methods with zero penalty parameters worked fine in numerical simulations on coarse meshes.In this work,by performing extensive numerical experiments,we discover that zero penalty parameters lead to resonance errors in the multiscale DG methods,and taking positive penalty parameters can effectively reduce resonance errors and make the matrix in the global linear system have better condition numbers.
基金supported by the NSF(Grant Nos.the NSF-DMS-1818924 and 2111253)the Air Force Office of Scientific Research FA9550-22-1-0390 and Department of Energy DE-SC0023164+1 种基金supported by the NSF(Grant Nos.NSF-DMS-1830838 and NSF-DMS-2111383)the Air Force Office of Scientific Research FA9550-22-1-0390.
文摘In this paper,we propose a novel Local Macroscopic Conservative(LoMaC)low rank tensor method with discontinuous Galerkin(DG)discretization for the physical and phase spaces for simulating the Vlasov-Poisson(VP)system.The LoMaC property refers to the exact local conservation of macroscopic mass,momentum,and energy at the discrete level.The recently developed LoMaC low rank tensor algorithm(arXiv:2207.00518)simultaneously evolves the macroscopic conservation laws of mass,momentum,and energy using the kinetic flux vector splitting;then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables.This paper is a generalization of our previous work,but with DG discretization to take advantage of its compactness and flexibility in handling boundary conditions and its superior accuracy in the long term.The algorithm is developed in a similar fashion as that for a finite difference scheme,by observing that the DG method can be viewed equivalently in a nodal fashion.With the nodal DG method,assuming a tensorized computational grid,one will be able to(i)derive differentiation matrices for different nodal points based on a DG upwind discretization of transport terms,and(ii)define a weighted inner product space based on the nodal DG grid points.The algorithm can be extended to the high dimensional problems by hierarchical Tucker(HT)decomposition of solution tensors and a corresponding conservative projection algorithm.In a similar spirit,the algorithm can be extended to DG methods on nodal points of an unstructured mesh,or to other types of discretization,e.g.,the spectral method in velocity direction.Extensive numerical results are performed to showcase the efficacy of the method.
文摘In this paper,the uniform error estimates with respect to t∈[0, ∞ ) of the nonlinear Galerkin method are given for the long time integration of the Kuramoto-Sivashinsky equation. The nonlinear Galerkin method is used to study the asymptotic behaviour of Kuramoto-Sivashinsky equation and to construct the bifurcation diagrams.
文摘This paper deals with the inertial manifold and the approximate inertialmanifold concepts of the Navier-Stokes equations with nonhomogeneous boundary conditions and inertial algorithm. Furtheremore,we provide the error estimates of the approximate solutions of the Navier-Stokes Equations.
基金supported by the National Outstanding Young Scientists Fund of China(No.10725209)the National Natural Science Foundation of China(No.10672092)+3 种基金Shanghai Subject Chief Scientist Project(No.09XD1401700)Shanghai Municipal Education Commission Scientific Research Project(No.07ZZ07)Shanghai Leading Academic Discipline Project (No.S30106)Changjiang Scholars and Innovative Research Team in University Program(No.IRT0844).
文摘A computational technique is proposed for the Galerkin discretization of axially moving strings with geometric nonlinearity. The Galerkin discretization is based on the eigenfunctions of stationary strings. The discretized equations are simplified by regrouping nonlinear terms to reduce the computation work. The scheme can be easily implemented in the practical programming. Numerical results show the effectiveness of the technique. The results also highlight the feature of Galerkin's discretization of gyroscopic continua that the term number in Galerkin's discretization should be even. The technique is generalized from elastic strings to viscoelastic strings.
文摘This paper discuss stability of the full discrete nonlinear Galerkin method based on the approximation inertial manifold method for some nonlinear evolution equation, for example, some nonlinear reactor equation and Navier-Stokes Equation. In the paper we provide some necessary and sufficient conditions of stability.
文摘The complex structure and strong heterogeneity of advanced nuclear reactor systems pose challenges for high-fidelity neutron-shielding calculations. Unstructured meshes exhibit strong geometric adaptability and can overcome the deficiencies of conventionally structured meshes in complex geometry modeling. A multithreaded parallel upwind sweep algorithm for S_(N) transport was proposed to achieve a more accurate geometric description and improve the computational efficiency. The spatial variables were discretized using the standard discontinuous Galerkin finite-element method. The angular flux transmission between neighboring meshes was handled using an upwind scheme. In addition, a combination of a mesh transport sweep and angular iterations was realized using a multithreaded parallel technique. The algorithm was implemented in the 2D/3D S_(N) transport code ThorSNIPE, and numerical evaluations were conducted using three typical benchmark problems:IAEA, Kobayashi-3i, and VENUS-3. These numerical results indicate that the multithreaded parallel upwind sweep algorithm can achieve high computational efficiency. ThorSNIPE, with a multithreaded parallel upwind sweep algorithm, has good reliability, stability, and high efficiency, making it suitable for complex shielding calculations.
文摘对于结构动力分析中的离散系统运动方程,现有算法的计算精度和效率均依赖于时间步长的选取,这是时间域问题求解的难点.基于EEP(element energy projection)超收敛计算的自适应有限元法,以EEP超收敛解代替未知真解,估计常规有限元解的误差,并自动细分网格,目前已对诸类以空间坐标为自变量的边值问题取得成功.对离散系统运动方程建立弱型Galerkin有限元解,引入基于EEP法的自适应求解策略,在时间域上自动划分网格,最终得到所求时域内任一时刻均满足给定误差限的动位移解,进而建立了一种时间域上的新型自适应求解算法.
基金Supported by the National Natural Science Foundation of China(1067118410971203)the National Natural Science Foundation of the Education Department of Henan Province(2010A110018)