In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and di...In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.展开更多
In this paper, the Ito-Taylor expansion of stochastic differential equation is briefly introduced. The colored rooted tree theory is applied to derive strong order 1.0 implicit stochastic Runge-Kutta method(SRK). Two ...In this paper, the Ito-Taylor expansion of stochastic differential equation is briefly introduced. The colored rooted tree theory is applied to derive strong order 1.0 implicit stochastic Runge-Kutta method(SRK). Two fully implicit schemes are presented and their stability qualities are discussed. And the numerical report illustrates the better numerical behavior.展开更多
Efficient and accurate simulation of unsteady flow presents a significant challenge that needs to be overcome in computational fluid dynamics.Temporal discretization method plays a crucial role in the simulation of un...Efficient and accurate simulation of unsteady flow presents a significant challenge that needs to be overcome in computational fluid dynamics.Temporal discretization method plays a crucial role in the simulation of unsteady flows.To enhance computational efficiency,we propose the Implicit-Explicit Two-Step Runge-Kutta(IMEX-TSRK)time-stepping discretization methods for unsteady flows,and develop a novel adaptive algorithm that correctly partitions spatial regions to apply implicit or explicit methods.The novel adaptive IMEX-TSRK schemes effectively handle the numerical stiffness of the small grid size and improve computational efficiency.Compared to implicit and explicit Runge-Kutta(RK)schemes,the IMEX-TSRK methods achieve the same order of accuracy with fewer first derivative calculations.Numerical case tests demonstrate that the IMEX-TSRK methods maintain numerical stability while enhancing computational efficiency.Specifically,in high Reynolds number flows,the computational efficiency of the IMEX-TSRK methods surpasses that of explicit RK schemes by more than one order of magnitude,and that of implicit RK schemes several times over.展开更多
This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either...This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either finite difference(FD)or local discontinuous Galerkin(DG)spatial discretization.We analyze the stability of the fully discrete scheme,on a uniform mesh with periodic boundary conditions,using the Fourier method.For the linearized KdV equation,the IMEX schemes are stable under the standard Courant-Friedrichs-Lewy(CFL)conditionτ≤λh.Here,λis the CFL number,τis the time-step size,and h is the spatial mesh size.We study several IMEX schemes and characterize their CFL number as a function ofθ=d/h^(2)with d being the dispersion coefficient,which leads to several interesting observations.We also investigate the asymptotic behaviors of the CFL number for sufficiently refined meshes and derive the necessary conditions for the asymptotic stability of the IMEX-RK methods.Some numerical experiments are provided in the paper to illustrate the performance of IMEX methods under different time-step constraints.展开更多
It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the...It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the order of an s-stage monoimplicit Runge-Kutta method is at most s+1 and the stage order is at most 3. In this paper, it is shown that the order of an s-stage mono-implicit Runge-Kutta method being algebraically stable is at most min((s) over tilde, 4), and the stage order together with the optimal B-convergence order is at most min(s, 2), where [GRAPHICS]展开更多
Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were previously proposed and analyzed.These specially designed methods use reduced precision for the implic...Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were previously proposed and analyzed.These specially designed methods use reduced precision for the implicit computations and full precision for the explicit computations.In this work,we analyze the stability properties of these methods and their sensitivity to the low-precision rounding errors,and demonstrate their performance in terms of accuracy and efficiency.We develop codes in FORTRAN and Julia to solve nonlinear systems of ODEs and PDEs using the mixed-precision additive Runge-Kutta(MP-ARK)methods.The convergence,accuracy,and runtime of these methods are explored.We show that for a given level of accuracy,suitably chosen MP-ARK methods may provide significant reductions in runtime.展开更多
We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal eq...We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal equation.We replace the differential operator on the interface with a typical Cartesian differential operator in the surface neighborhood.Our proposed algorithm is easy to implement and efficient.We will give some two-and three-dimensional numerical examples to demonstrate the effectiveness of our proposed approach.展开更多
We propose a suite of strategies for the parallel solution of fully implicit monolithic fluid-structure interaction(FSI).The solver is based on a modeling approach that uses the velocity and pressure as the primitive ...We propose a suite of strategies for the parallel solution of fully implicit monolithic fluid-structure interaction(FSI).The solver is based on a modeling approach that uses the velocity and pressure as the primitive variables,which offers a bridge between computational fluid dynamics(CFD)and computational structural dynamics.The spatiotemporal discretization leverages the variational multiscale formulation and the generalized-αmethod as a means of providing a robust discrete scheme.In particular,the time integration scheme does not suffer from the overshoot phenomenon and optimally dissipates high-frequency spurious modes in both subproblems of FSI.Based on the chosen fully implicit scheme,we systematically develop a combined suite of nonlinear and linear solver strategies.Invoking a block factorization of the Jacobian matrix,the Newton-Raphson procedure is reduced to solving two smaller linear systems in the multi-corrector stage.The first is of the elliptic type,indicating that the algebraic multigrid method serves as a well-suited option.The second exhibits a two-by-two block structure that is analogous to the system arising in CFD.Inspired by prior studies,the additive Schwarz domain decomposition method and the block-factorization-based preconditioners are invoked to address the linear problem.Since the number of unknowns matches in both subdomains,it is straightforward to balance loads when parallelizing the algorithm for distributed-memory architectures.We use two representative FSI benchmarks to demonstrate the robustness,efficiency,and scalability of the overall FSI solver framework.In particular,it is found that the developed FSI solver is comparable to the CFD solver in several aspects,including fixed-size and isogranular scalability as well as robustness.展开更多
We propose a symplectic partitioned Runge-Kutta （SPRK） method with eighth-order spatial accuracy based on the extended Hamiltonian system of the acoustic waveequation. Known as the eighth-order NSPRK method, this te...We propose a symplectic partitioned Runge-Kutta （SPRK） method with eighth-order spatial accuracy based on the extended Hamiltonian system of the acoustic waveequation. Known as the eighth-order NSPRK method, this technique uses an eighth-orderaccurate nearly analytic discrete （NAD） operator to discretize high-order spatial differentialoperators and employs a second-order SPRK method to discretize temporal derivatives.The stability criteria and numerical dispersion relations of the eighth-order NSPRK methodare given by a semi-analytical method and are tested by numerical experiments. We alsoshow the differences of the numerical dispersions between the eighth-order NSPRK methodand conventional numerical methods such as the fourth-order NSPRK method, the eighth-order Lax-Wendroff correction （LWC） method and the eighth-order staggered-grid （SG）method. The result shows that the ability of the eighth-order NSPRK method to suppress thenumerical dispersion is obviously superior to that of the conventional numerical methods. Inthe same computational environment, to eliminate visible numerical dispersions, the eighth-order NSPRK is approximately 2.5 times faster than the fourth-order NSPRK and 3.4 timesfaster than the fourth-order SPRK, and the memory requirement is only approximately47.17% of the fourth-order NSPRK method and 49.41% of the fourth-order SPRK method,which indicates the highest computational efficiency. Modeling examples for the two-layermodels such as the heterogeneous and Marmousi models show that the wavefields generatedby the eighth-order NSPRK method are very clear with no visible numerical dispersion.These numerical experiments illustrate that the eighth-order NSPRK method can effectivelysuppress numerical dispersion when coarse grids are adopted. Therefore, this methodcan greatly decrease computer memory requirement and accelerate the forward modelingproductivity. In general, the eighth-order NSPRK method has tremendous potential value forseismic exploration and seismology research.展开更多
The Runge-Kutta discontinuous Galerkin finite element method （RK-DGFEM） is introduced to solve the classical resonator problem in the time domain. DGFEM uses unstructured grid discretization in the space domain and ...The Runge-Kutta discontinuous Galerkin finite element method （RK-DGFEM） is introduced to solve the classical resonator problem in the time domain. DGFEM uses unstructured grid discretization in the space domain and it is explicit in the time domain. Consequently it is a best mixture of FEM and finite volume method （FVM）. RK-DGFEM can obtain local high-order accuracy by using high-order polynomial basis. Numerical experiments of transverse magnetic （TM） wave propagation in a 2-D resonator are performed. A high-order Lagrange polynomial basis is adopted. Numerical results agree well with analytical solution. And different order Lagrange interpolation polynomial basis impacts on simulation result accuracy are discussed. Computational results indicate that the accuracy is evidently improved when the order of interpolation basis is increased. Finally, L^2 errors of different order polynomial basis in RK-DGFEM are presented. Computational results show that L^2 error declines exponentially as the order of basis increases.展开更多
Natural gas hydrate, as a potential energy resource, deposits in permafrost and marine sediment with large quantities. The current exploitation methods include depressurization, thermal stimulation, and inhibitor inje...Natural gas hydrate, as a potential energy resource, deposits in permafrost and marine sediment with large quantities. The current exploitation methods include depressurization, thermal stimulation, and inhibitor injection. However, many issues have to be resolved before the commercial production. In the present study, a 2-D axisymmetric simulator for gas production from hydrate reservoirs is developed. The simulator includes equations of conductive and convective heat transfer, kinetic of hydrate decomposition, and multiphase flow. These equations are discretized based on the finite difference method and are solved with the fully implicit simultaneous solution method. The process of laboratory-scale hydrate decomposition by depressurization is simulated. For different surrounding temperatures and outlet pressures, time evolutions of gas and water generations during hydrate dissociation are evaluated, and variations of temperature, pressure, and multiphase fluid flow conditions are analyzed. The results suggest that the rate of heat transfer plays an important role in the process. Furthermore, high surrounding temperature and low outlet valve pressure may increase the rate of hydrate dissociation with insignificant impact on final cumulative gas volume.展开更多
This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using prec...This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using precise integration method. With the operator splitting procedure, the precise integration method is introduced to determine the material derivative in the convection-diffusion equation, consequently, the physical quantities of material points. An implicit algorithm with a combination of both the precise and the traditional numerical integration procedures in time domain in the Lagrange coordinates for the characteristic Galerkin method is formulated. The stability analysis of the algorithm shows that the unconditional stability of present implicit algorithm is enhanced as compared with that of the traditional implicit numerical integration procedure. The numerical results validate the presented method in solving convection-diffusion equations. As compared with SUPG method and explicit characteristic Galerkin method, the present method gives the results with higher accuracy and better stability.展开更多
This article deals with a class of numerical methods for retarded differential algebraic systems with time-variable delay. The methods can be viewed as a combination of Runge-Kutta methods and Lagrange interpolation. ...This article deals with a class of numerical methods for retarded differential algebraic systems with time-variable delay. The methods can be viewed as a combination of Runge-Kutta methods and Lagrange interpolation. A new convergence concept, called DA-convergence, is introduced. The DA-convergence result for the methods is derived. At the end, a numerical example is given to verify the computational effectiveness and the theoretical result.展开更多
The symplectic algorithm and the energy conservation algorithm are two important kinds of algorithms to solve Hamiltonian systems. The symplectic Runge- Kutta （RK） method is an important part of the former, and the ...The symplectic algorithm and the energy conservation algorithm are two important kinds of algorithms to solve Hamiltonian systems. The symplectic Runge- Kutta （RK） method is an important part of the former, and the continuous finite element method （CFEM） belongs to the later. We find and prove the equivalence of one kind of the implicit RK method and the CFEM, give the coefficient table of the CFEM to simplify its computation, propose a new standard to measure algorithms for Hamiltonian systems, and define another class of algorithms --the regular method. Finally, numerical experiments are given to verify the theoretical results.展开更多
This paper presents a method for tracing a planar implicit curve f（x, y）=0 on a rectangular region based on continuation scheme. First, according to the starting track-point and the starting track-direction of the c...This paper presents a method for tracing a planar implicit curve f（x, y）=0 on a rectangular region based on continuation scheme. First, according to the starting track-point and the starting track-direction of the curve, make a new fimction F（x, y）=0 where the same curve withf（x, y）=0 is defined. Then we trace the curve between the two domains where F（x, y）〉0 and F（x, y）〈0 alternately, according to the two rules presented in this paper. Equal step size or adaptive step size can be used, when we trace the curve. An irregular planar implicit curve （such as the curve with large curvatures at some points on the curve）, can be plotted if an adaptive step size is used. Moreover, this paper presents a scheme to search for the multiple points on the curve. Our method has the following advantages： （1） it can plot Co planar implicit curves; （2） it can plot the planar implicit curves with multiple points; （3） by the help of using the two rules, our method does not need to compute the tangent vector at the points on the curve, and directly searches for the direction of the tracing curve; （4） the tracing procedure costs only one of two evaluations of function f（x, y）=0 per moving step, while most existing similar methods cost more evaluations of the function.展开更多
Projected Runge-Kutta （R-K） methods for constrained Hamiltonian systems are proposed. Dynamic equations of the systems, which are index-3 differential-algebraic equations （DAEs） in the Heisenberg form, are establi...Projected Runge-Kutta （R-K） methods for constrained Hamiltonian systems are proposed. Dynamic equations of the systems, which are index-3 differential-algebraic equations （DAEs） in the Heisenberg form, are established under the framework of Lagrangian multipliers. R-K methods combined with the technique of projections are then used to solve the DAEs. The basic idea of projections is to eliminate the constraint violations at the position, velocity, and acceleration levels, and to preserve the total energy of constrained Hamiltonian systems by correcting variables of the position, velocity, acceleration, and energy. Numerical results confirm the validity and show the high precision of the proposed method in preserving three levels of constraints and total energy compared with results reported in the literature.展开更多
This paper presents a quasi-static implicit generalized interpolation material point method(i GIMP)with B-bar approach for large deformation geotechnical problems.The i GIMP algorithm is an extension of the implicit m...This paper presents a quasi-static implicit generalized interpolation material point method(i GIMP)with B-bar approach for large deformation geotechnical problems.The i GIMP algorithm is an extension of the implicit material point method(iMPM).The global stiffness matrix is formed explicitly and the Newton-Raphson iterative method is used to solve the equilibrium equations.Where possible,the implementation procedure closely follows standard finite element method(FEM)approaches to allow easy conversion of other FEM codes.The generalized interpolation function is assigned to eliminate the inherent cell crossing noise within conventional MPM.For the first time,the B-bar approach is used to overcome volumetric locking in standard GIMP method for near-incompressible non-linear geomechanics.The proposed i GIMP was tested and compared with i MPM and analytical solutions via a 1 D column compression problem.Results highlighted the superiority of the i GIMP approach in reducing stress oscillations,thereby improving computational accuracy.Then,elasto-plastic slope stabilities and rigid footing problems were considered,further illustrating the ability of the proposed method to overcome volumetric locking due to incompressibility.Results showed that the proposed i GIMP with B-bar approach can be used to simulate geotechnical problems with large deformations.展开更多
A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first ...A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first sub-step, but evaluated and doubly used in the second sub-step. The order of two sub-steps is reversed for each transverse magnetic field component so that the cross-coupling terms are always expressed in implicit form, thus the calculation is very efficient and stable. Moreover, an improved six-point finite-difference scheme with high accuracy independent of specific structures of waveguide is also constructed to approximate the cross-coupling terms along the transverse directions. The imaginary-distance procedure is used to assess the validity and utility of the present method. The field patterns and the normalized propagation constants of the fundamental mode for a buried rectangular waveguide and a rib waveguide are presented. Solutions are in excellent agreement with the benchmark results from the modal transverse resonance method.展开更多
Nonlinear wave equations have been extensively investigated in the last sev- eral decades. The Landau-Ginzburg-Higgs equation, a typical nonlinear wave equation, is studied in this paper based on the multi-symplectic ...Nonlinear wave equations have been extensively investigated in the last sev- eral decades. The Landau-Ginzburg-Higgs equation, a typical nonlinear wave equation, is studied in this paper based on the multi-symplectic theory in the Hamilton space. The multi-symplectic Runge-Kutta method is reviewed, and a semi-implicit scheme with certain discrete conservation laws is constructed to solve the first-order partial differential equations （PDEs） derived from the Landau-Ginzburg-Higgs equation. The numerical re- sults for the soliton solution of the Landau-Ginzburg-Higgs equation are reported, showing that the multi-symplectic Runge-Kutta method is an efficient algorithm with excellent long-time numerical behaviors.展开更多
基金national natural science foundation natural science foundation of Gansu province.
文摘In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.
文摘In this paper, the Ito-Taylor expansion of stochastic differential equation is briefly introduced. The colored rooted tree theory is applied to derive strong order 1.0 implicit stochastic Runge-Kutta method(SRK). Two fully implicit schemes are presented and their stability qualities are discussed. And the numerical report illustrates the better numerical behavior.
基金supported by the National Natural Science Foundation of China(No.92252201)the Fundamental Research Funds for the Central Universitiesthe Academic Excellence Foundation of Beihang University(BUAA)for PhD Students。
文摘Efficient and accurate simulation of unsteady flow presents a significant challenge that needs to be overcome in computational fluid dynamics.Temporal discretization method plays a crucial role in the simulation of unsteady flows.To enhance computational efficiency,we propose the Implicit-Explicit Two-Step Runge-Kutta(IMEX-TSRK)time-stepping discretization methods for unsteady flows,and develop a novel adaptive algorithm that correctly partitions spatial regions to apply implicit or explicit methods.The novel adaptive IMEX-TSRK schemes effectively handle the numerical stiffness of the small grid size and improve computational efficiency.Compared to implicit and explicit Runge-Kutta(RK)schemes,the IMEX-TSRK methods achieve the same order of accuracy with fewer first derivative calculations.Numerical case tests demonstrate that the IMEX-TSRK methods maintain numerical stability while enhancing computational efficiency.Specifically,in high Reynolds number flows,the computational efficiency of the IMEX-TSRK methods surpasses that of explicit RK schemes by more than one order of magnitude,and that of implicit RK schemes several times over.
基金supported by the NSF under Grant DMS-2208391sponsored by the NSF under Grant DMS-1753581.
文摘This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either finite difference(FD)or local discontinuous Galerkin(DG)spatial discretization.We analyze the stability of the fully discrete scheme,on a uniform mesh with periodic boundary conditions,using the Fourier method.For the linearized KdV equation,the IMEX schemes are stable under the standard Courant-Friedrichs-Lewy(CFL)conditionτ≤λh.Here,λis the CFL number,τis the time-step size,and h is the spatial mesh size.We study several IMEX schemes and characterize their CFL number as a function ofθ=d/h^(2)with d being the dispersion coefficient,which leads to several interesting observations.We also investigate the asymptotic behaviors of the CFL number for sufficiently refined meshes and derive the necessary conditions for the asymptotic stability of the IMEX-RK methods.Some numerical experiments are provided in the paper to illustrate the performance of IMEX methods under different time-step constraints.
文摘It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the order of an s-stage monoimplicit Runge-Kutta method is at most s+1 and the stage order is at most 3. In this paper, it is shown that the order of an s-stage mono-implicit Runge-Kutta method being algebraically stable is at most min((s) over tilde, 4), and the stage order together with the optimal B-convergence order is at most min(s, 2), where [GRAPHICS]
基金supported by ONR UMass Dartmouth Marine and UnderSea Technology(MUST)grant N00014-20-1-2849 under the project S31320000049160by DOE grant DE-SC0023164 sub-award RC114586-UMD+2 种基金by AFOSR grants FA9550-18-1-0383 and FA9550-23-1-0037supported by Michigan State University,by AFOSR grants FA9550-19-1-0281 and FA9550-18-1-0383by DOE grant DE-SC0023164.
文摘Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were previously proposed and analyzed.These specially designed methods use reduced precision for the implicit computations and full precision for the explicit computations.In this work,we analyze the stability properties of these methods and their sensitivity to the low-precision rounding errors,and demonstrate their performance in terms of accuracy and efficiency.We develop codes in FORTRAN and Julia to solve nonlinear systems of ODEs and PDEs using the mixed-precision additive Runge-Kutta(MP-ARK)methods.The convergence,accuracy,and runtime of these methods are explored.We show that for a given level of accuracy,suitably chosen MP-ARK methods may provide significant reductions in runtime.
基金supported in part by the Hong Kong RGC 16302223.
文摘We propose a simple embedding method for computing the eigenvalues and eigenfunctions of the Laplace-Beltrami operator on implicit surfaces.The approach follows an embedding approach for solving the surface eikonal equation.We replace the differential operator on the interface with a typical Cartesian differential operator in the surface neighborhood.Our proposed algorithm is easy to implement and efficient.We will give some two-and three-dimensional numerical examples to demonstrate the effectiveness of our proposed approach.
基金This work was supported by the National Natural Science Foundation of China(Grant No.12172160)Shenzhen Science and Technology Program(Grant No.JCYJ20220818100600002)+1 种基金South-ern University of Science and Technology(Grant No.Y01326127)the Department of Science and Technology of Guangdong Province(Grant Nos.2020B1212030001 and 2021QN020642).
文摘We propose a suite of strategies for the parallel solution of fully implicit monolithic fluid-structure interaction(FSI).The solver is based on a modeling approach that uses the velocity and pressure as the primitive variables,which offers a bridge between computational fluid dynamics(CFD)and computational structural dynamics.The spatiotemporal discretization leverages the variational multiscale formulation and the generalized-αmethod as a means of providing a robust discrete scheme.In particular,the time integration scheme does not suffer from the overshoot phenomenon and optimally dissipates high-frequency spurious modes in both subproblems of FSI.Based on the chosen fully implicit scheme,we systematically develop a combined suite of nonlinear and linear solver strategies.Invoking a block factorization of the Jacobian matrix,the Newton-Raphson procedure is reduced to solving two smaller linear systems in the multi-corrector stage.The first is of the elliptic type,indicating that the algebraic multigrid method serves as a well-suited option.The second exhibits a two-by-two block structure that is analogous to the system arising in CFD.Inspired by prior studies,the additive Schwarz domain decomposition method and the block-factorization-based preconditioners are invoked to address the linear problem.Since the number of unknowns matches in both subdomains,it is straightforward to balance loads when parallelizing the algorithm for distributed-memory architectures.We use two representative FSI benchmarks to demonstrate the robustness,efficiency,and scalability of the overall FSI solver framework.In particular,it is found that the developed FSI solver is comparable to the CFD solver in several aspects,including fixed-size and isogranular scalability as well as robustness.
基金This research was supported by the National Natural Science Foundation of China （Nos. 41230210 and 41204074）, the Science Foundation of the Education Department of Yunnan Province （No. 2013Z152）, and Statoil Company （Contract No. 4502502663）.
文摘We propose a symplectic partitioned Runge-Kutta （SPRK） method with eighth-order spatial accuracy based on the extended Hamiltonian system of the acoustic waveequation. Known as the eighth-order NSPRK method, this technique uses an eighth-orderaccurate nearly analytic discrete （NAD） operator to discretize high-order spatial differentialoperators and employs a second-order SPRK method to discretize temporal derivatives.The stability criteria and numerical dispersion relations of the eighth-order NSPRK methodare given by a semi-analytical method and are tested by numerical experiments. We alsoshow the differences of the numerical dispersions between the eighth-order NSPRK methodand conventional numerical methods such as the fourth-order NSPRK method, the eighth-order Lax-Wendroff correction （LWC） method and the eighth-order staggered-grid （SG）method. The result shows that the ability of the eighth-order NSPRK method to suppress thenumerical dispersion is obviously superior to that of the conventional numerical methods. Inthe same computational environment, to eliminate visible numerical dispersions, the eighth-order NSPRK is approximately 2.5 times faster than the fourth-order NSPRK and 3.4 timesfaster than the fourth-order SPRK, and the memory requirement is only approximately47.17% of the fourth-order NSPRK method and 49.41% of the fourth-order SPRK method,which indicates the highest computational efficiency. Modeling examples for the two-layermodels such as the heterogeneous and Marmousi models show that the wavefields generatedby the eighth-order NSPRK method are very clear with no visible numerical dispersion.These numerical experiments illustrate that the eighth-order NSPRK method can effectivelysuppress numerical dispersion when coarse grids are adopted. Therefore, this methodcan greatly decrease computer memory requirement and accelerate the forward modelingproductivity. In general, the eighth-order NSPRK method has tremendous potential value forseismic exploration and seismology research.
文摘The Runge-Kutta discontinuous Galerkin finite element method （RK-DGFEM） is introduced to solve the classical resonator problem in the time domain. DGFEM uses unstructured grid discretization in the space domain and it is explicit in the time domain. Consequently it is a best mixture of FEM and finite volume method （FVM）. RK-DGFEM can obtain local high-order accuracy by using high-order polynomial basis. Numerical experiments of transverse magnetic （TM） wave propagation in a 2-D resonator are performed. A high-order Lagrange polynomial basis is adopted. Numerical results agree well with analytical solution. And different order Lagrange interpolation polynomial basis impacts on simulation result accuracy are discussed. Computational results indicate that the accuracy is evidently improved when the order of interpolation basis is increased. Finally, L^2 errors of different order polynomial basis in RK-DGFEM are presented. Computational results show that L^2 error declines exponentially as the order of basis increases.
基金supported by the National High Technology Research and Development Program of China(863 Program, Grant No.2006AA09A209-5)the National Natural Science Foundation of China (Key Program,Grant No.50736001)the Major Research Project of Ministry of Education of China (Grant No.306005)
文摘Natural gas hydrate, as a potential energy resource, deposits in permafrost and marine sediment with large quantities. The current exploitation methods include depressurization, thermal stimulation, and inhibitor injection. However, many issues have to be resolved before the commercial production. In the present study, a 2-D axisymmetric simulator for gas production from hydrate reservoirs is developed. The simulator includes equations of conductive and convective heat transfer, kinetic of hydrate decomposition, and multiphase flow. These equations are discretized based on the finite difference method and are solved with the fully implicit simultaneous solution method. The process of laboratory-scale hydrate decomposition by depressurization is simulated. For different surrounding temperatures and outlet pressures, time evolutions of gas and water generations during hydrate dissociation are evaluated, and variations of temperature, pressure, and multiphase fluid flow conditions are analyzed. The results suggest that the rate of heat transfer plays an important role in the process. Furthermore, high surrounding temperature and low outlet valve pressure may increase the rate of hydrate dissociation with insignificant impact on final cumulative gas volume.
文摘This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using precise integration method. With the operator splitting procedure, the precise integration method is introduced to determine the material derivative in the convection-diffusion equation, consequently, the physical quantities of material points. An implicit algorithm with a combination of both the precise and the traditional numerical integration procedures in time domain in the Lagrange coordinates for the characteristic Galerkin method is formulated. The stability analysis of the algorithm shows that the unconditional stability of present implicit algorithm is enhanced as compared with that of the traditional implicit numerical integration procedure. The numerical results validate the presented method in solving convection-diffusion equations. As compared with SUPG method and explicit characteristic Galerkin method, the present method gives the results with higher accuracy and better stability.
文摘This article deals with a class of numerical methods for retarded differential algebraic systems with time-variable delay. The methods can be viewed as a combination of Runge-Kutta methods and Lagrange interpolation. A new convergence concept, called DA-convergence, is introduced. The DA-convergence result for the methods is derived. At the end, a numerical example is given to verify the computational effectiveness and the theoretical result.
基金Project supported by the National Natural Science Foundation of China (No. 11071067)the Hunan Graduate Student Science and Technology Innovation Project (No. CX2011B184)
文摘The symplectic algorithm and the energy conservation algorithm are two important kinds of algorithms to solve Hamiltonian systems. The symplectic Runge- Kutta （RK） method is an important part of the former, and the continuous finite element method （CFEM） belongs to the later. We find and prove the equivalence of one kind of the implicit RK method and the CFEM, give the coefficient table of the CFEM to simplify its computation, propose a new standard to measure algorithms for Hamiltonian systems, and define another class of algorithms --the regular method. Finally, numerical experiments are given to verify the theoretical results.
文摘This paper presents a method for tracing a planar implicit curve f（x, y）=0 on a rectangular region based on continuation scheme. First, according to the starting track-point and the starting track-direction of the curve, make a new fimction F（x, y）=0 where the same curve withf（x, y）=0 is defined. Then we trace the curve between the two domains where F（x, y）〉0 and F（x, y）〈0 alternately, according to the two rules presented in this paper. Equal step size or adaptive step size can be used, when we trace the curve. An irregular planar implicit curve （such as the curve with large curvatures at some points on the curve）, can be plotted if an adaptive step size is used. Moreover, this paper presents a scheme to search for the multiple points on the curve. Our method has the following advantages： （1） it can plot Co planar implicit curves; （2） it can plot the planar implicit curves with multiple points; （3） by the help of using the two rules, our method does not need to compute the tangent vector at the points on the curve, and directly searches for the direction of the tracing curve; （4） the tracing procedure costs only one of two evaluations of function f（x, y）=0 per moving step, while most existing similar methods cost more evaluations of the function.
基金Project supported by the National Natural Science Foundation of China(No.11432010)the Doctoral Program Foundation of Education Ministry of China(No.20126102110023)+2 种基金the 111Project of China(No.B07050)the Fundamental Research Funds for the Central Universities(No.310201401JCQ01001)the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University(No.CX201517)
文摘Projected Runge-Kutta （R-K） methods for constrained Hamiltonian systems are proposed. Dynamic equations of the systems, which are index-3 differential-algebraic equations （DAEs） in the Heisenberg form, are established under the framework of Lagrangian multipliers. R-K methods combined with the technique of projections are then used to solve the DAEs. The basic idea of projections is to eliminate the constraint violations at the position, velocity, and acceleration levels, and to preserve the total energy of constrained Hamiltonian systems by correcting variables of the position, velocity, acceleration, and energy. Numerical results confirm the validity and show the high precision of the proposed method in preserving three levels of constraints and total energy compared with results reported in the literature.
基金the National Natural Science Foundation of China(Nos.41807223 and 51908175)the Fundamental Research Funds for the Central Universities(No.B210202096)+1 种基金the Natural Science Foundation of Guangdong Province(No.2018A030310346)the Water Conservancy Science and Technology Innovation Project of Guangdong Province(No.2020-11),China。
文摘This paper presents a quasi-static implicit generalized interpolation material point method(i GIMP)with B-bar approach for large deformation geotechnical problems.The i GIMP algorithm is an extension of the implicit material point method(iMPM).The global stiffness matrix is formed explicitly and the Newton-Raphson iterative method is used to solve the equilibrium equations.Where possible,the implementation procedure closely follows standard finite element method(FEM)approaches to allow easy conversion of other FEM codes.The generalized interpolation function is assigned to eliminate the inherent cell crossing noise within conventional MPM.For the first time,the B-bar approach is used to overcome volumetric locking in standard GIMP method for near-incompressible non-linear geomechanics.The proposed i GIMP was tested and compared with i MPM and analytical solutions via a 1 D column compression problem.Results highlighted the superiority of the i GIMP approach in reducing stress oscillations,thereby improving computational accuracy.Then,elasto-plastic slope stabilities and rigid footing problems were considered,further illustrating the ability of the proposed method to overcome volumetric locking due to incompressibility.Results showed that the proposed i GIMP with B-bar approach can be used to simulate geotechnical problems with large deformations.
文摘A modified alternating direction implicit algorithm is proposed to solve the full-vectorial finite-difference beam propagation method formulation based on H fields. The cross-coupling terms are neglected in the first sub-step, but evaluated and doubly used in the second sub-step. The order of two sub-steps is reversed for each transverse magnetic field component so that the cross-coupling terms are always expressed in implicit form, thus the calculation is very efficient and stable. Moreover, an improved six-point finite-difference scheme with high accuracy independent of specific structures of waveguide is also constructed to approximate the cross-coupling terms along the transverse directions. The imaginary-distance procedure is used to assess the validity and utility of the present method. The field patterns and the normalized propagation constants of the fundamental mode for a buried rectangular waveguide and a rib waveguide are presented. Solutions are in excellent agreement with the benchmark results from the modal transverse resonance method.
基金supported by the National Natural Science Foundation of China (Nos. 10772147 and10632030)the Ph. D. Program Foundation of Ministry of Education of China (No. 20070699028)+2 种基金the Natural Science Foundation of Shaanxi Province of China (No. 2006A07)the Open Foundationof State Key Laboratory of Structural Analysis of Industrial Equipment (No. GZ0802)the Foundation for Fundamental Research of Northwestern Polytechnical University
文摘Nonlinear wave equations have been extensively investigated in the last sev- eral decades. The Landau-Ginzburg-Higgs equation, a typical nonlinear wave equation, is studied in this paper based on the multi-symplectic theory in the Hamilton space. The multi-symplectic Runge-Kutta method is reviewed, and a semi-implicit scheme with certain discrete conservation laws is constructed to solve the first-order partial differential equations （PDEs） derived from the Landau-Ginzburg-Higgs equation. The numerical re- sults for the soliton solution of the Landau-Ginzburg-Higgs equation are reported, showing that the multi-symplectic Runge-Kutta method is an efficient algorithm with excellent long-time numerical behaviors.
