一种新的重排方法在二维三温问题求解中的应用

针对二维三温问题离散化得到的稀疏线性方程组,提出一种新的重排技术(交替hyperplane重排),并结合ILU分解预条件技术,在Krylov子空间迭代法下进行测试.数值实验表明,在一定的填充模式及预处理消耗大致相同的前提下,使用交替hyperplane重排技术的迭代收敛效果明显优于红黑排序、hyperplane排序等方法.     

二维三温耦合差分方程组的解法

针对二维三温耦合热传导差分议程组的特点,给出并比较了块G－S算法与ICCG算法,数值结果表明,ICCG算法的收敛速度比块G－S算法的收敛速度可以快数千倍,并且,在二维激光黑腔靶耦合的数值计算中,如果能够实现向量化计算,使用ICCG方法将会大大提高数值模拟的计算效率。     

三维非结构网格Euler方程的LU-SGS算法及其改进

将LU-SGS隐式时间推进格式运用到非结构网格Euler方程的求解中,并对传统LU-SGS格式进行改进,结合网格重排序,发展了一套效率更高的三维Euler方程求解器.以M6机翼及超临界LANN机翼的跨音速无粘流场为算例,将改进LU-SGS格式与四步龙格-库塔显式格式及传统LU-SGS格式进行了比较.计算结果表明:所有格式的计算结果与实验结果都符合很好;传统LU-SGS格式计算效率为显式格式的3倍多,而改进LU-SGS格式计算效率为显式格式的7倍多.     

Using chaos to generate variations on movement sequences

We describe a method for introducing variations into predefined motion sequences using a chaotic symbol-sequence reordering technique. A progression of symbols representing the body positions in a dance piece, martial arts form, or other motion sequence is mapped onto a chaotic trajectory, establishing a symbolic dynamics that links the movement sequence and the attractor structure. A variation on the original piece is created by generating a trajectory with slightly different initial conditions, inverting the mapping, and using special corpus-based graph-theoretic interpolation schemes to smooth any abrupt transitions. Sensitive dependence guarantees that the variation is different from the original; the attractor structure and the symbolic dynamics guarantee that the two resemble one another in both aesthetic and mathematical senses. (c) 1998 American Institute of Physics.     

基于符号分析的极大联合熵延迟时间求取方法

本文通过符号分析法求取联合熵的极大值点, 进而得到相空间重构的最佳延迟时间, 通过对几个典型的混沌系统进行数值仿真试验, 结果表明, 该方法简化了计算, 提高了效率, 能够准确快速地获得最佳延迟时间, 从而有效地重构原系统的相空间, 为混沌信号识别提供一种快速有效的途径. 关键词： 相空间重构 延迟时间 联合熵 符号分析     

A Solver for Helmholtz System Generated by the Discretization of Wave Shape Functions

An interesting discretization method for Helmholtz equations was introduced in B. Després [1]. This method is based on the ultra weak variational formulation (UWVF) and the wave shape functions, which are exact solutions of the governing Helmholtz equation. In this paper we are concerned with fast solver for the system generated by the method in [1]. We propose a new preconditioner for such system, which can be viewed as a combination between a coarse solver and the block diagonal preconditioner introduced in [13]. In our numerical experiments, this preconditioner is applied to solve both two-dimensional and three-dimensional Helmholtz equations, and the numerical results illustrate that the new preconditioner is much more efficient than the original block diagonal preconditioner.     

Adaptive multilayer method of fundamental solutions using a weighted greedy QR decomposition for the Laplace equation

The mixed boundary value problem of the Laplace equation is considered. The method of fundamental solutions (MFS) approximates the exact solution to the Laplace equation by a linear combination of independent fundamental solutions with different source points. The accuracy of the numerical solution depends on the distribution of source points. In this paper, a weighted greedy QR decomposition (GQRD) is proposed to choose significant source points by introducing a weighting parameter. An index called an average degree of approximation is defined to show the efficiency of the proposed method. From numerical experiments, it is concluded that the numerical solution tends to be more accurate when the average degree of approximation is larger, and that the proposed method can yield more accurate solutions with a less number of source points than the conventional GQRD.     

二维三温流体力学计算中时间步长的自动控制

研究了二维三温流体力学计算中时间步长的控制问题,提出了控制时间步长的多种约束条件:既考虑了显式流体力学离散方程的CFL(Courant-Friedrichs-Lewy)条件,又考虑了隐式三温能量方程温度的相对变化,还考虑了Lagrange网格密度(或体积)的相对变化以及三温能量方程的迭代次数等.在计算过程中这些约束条件可以随时自动地改变时间步长,以最经济和合理的时间步长完成计算.最后给出了数值实验结果.     

Numerical solution of Helmholtz equation of barotropic atmosphere using wavelets

The numerical solution of the Helmholtz equation for barotropic atmosphere is estimated by use of the wavelet-Galerkin method. The solution involves the decomposition of a circulant matrix consisting up of 2-term connection coefficients of wavelet scaling functions. Three matrix decompositions, i.e. fast Fourier transformation (FFT), Jacobian and QR decomposition methods, are tested numerically. The Jacobian method has the smallest matrix-reconstruction error with the best orthogonality while the FFT method causes the biggest errors. Numerical result reveals that the numerical solution of the equation is very sensitive to the decomposition methods, and the QR and Jacobian decomposition methods, whose errors are of the order of 10^{-3}, much smaller than that with the FFT method, are more suitable to the numerical solution of the equation. With the two methods the solutions are also proved to have much higher accuracy than the iteration solution with the finite difference approximation. In addition, the wavelet numerical method is very useful for the solution of a climate model in low resolution. The solution accuracy of the equation may significantly increase with the order of Daubechies wavelet.     

Reduced basis finite element heterogeneous multiscale method for high-order discretizations of elliptic homogenization problems

A new finite element method for the efficient discretization of elliptic homogenization problems is proposed. These problems, characterized by data varying over a wide range of scales cannot be easily solved by classical numerical methods that need mesh resolution down to the finest scales and multiscale methods capable of capturing the large scale components of the solution on macroscopic meshes are needed. Recently, the finite element heterogeneous multiscale method (FE-HMM) has been proposed for such problems, based on a macroscopic solver with effective data recovered from the solution of micro problems on sampling domains at quadrature points of a macroscopic mesh. Departing from the approach used in the FE-HMM, we show that interpolation techniques based on the reduced basis methodology (an offline-online strategy) allow one to design an efficient numerical method relying only on a small number of accurately computed micro solutions. This new method, called the reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) is significantly more efficient than the FE-HMM for high order macroscopic discretizations and for three-dimensional problems, when the repeated computation of micro problems over the whole computational domain is expensive. A priori error estimates of the RB-FE-HMM are derived. Numerical computations for two and three dimensional problems illustrate the applicability and efficiency of the numerical method.     

An evaluation of solution algorithms and numerical approximation methods for modeling an ion exchange process

The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte-Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward difference formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte-Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC–FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications.     

Numerical Complexiton Solutions of Complex KdV Equation

In this paper, we directly extend the applications of the Adomian decomposition method to investigate the complex KdV equation. By choosing different forms of wave functions as the initial values, three new types of realistic numerical solutions: numerical positon, negaton solution, and particularly the numerical analytical complexiton solution are obtained, which can rapidly converge to the exact ones obtained by Lou et al. Numerical simulation figures are used to illustrate the efficiency and accuracy of the proposed method.     

A new electromagnetic particle-in-cell model with adaptive mesh refinement for high-performance parallel computation

A new electromagnetic particle-in-cell (EMPIC) model with adaptive mesh refinement (AMR) has been developed to achieve high-performance parallel computation in distributed memory system. For minimizing the amount and frequency of inter-processor communications, the present study uses the staggering grid scheme with the charge conservation method, which consists only of the local operations. However, the scheme provides no numerical damping for electromagnetic waves regardless of the wavenumber, which results in significant noise in the refinement region that eventually covers over physical signals. In order to suppress the electromagnetic noise, the present study introduces a smoothing method which gives numerical damping preferentially for short wavelength modes. The test simulations show that only a weak smoothing results in drastic reduction in the noise, so that the implementation of the AMR is possible in the staggering grid scheme. The computational load balance among the processors is maintained by a new method termed the adaptive block technique for the domain decomposition parallelization. The adaptive block technique controls the subdomain (block) structure dynamically associated with the system evolution, such that all the blocks have almost the same number of particles. The performance of the present code is evaluated for the simulations of the current sheet evolution. The test simulations demonstrate that the usage of the adaptive block technique as well as the staggering grid scheme enhances significantly the parallel efficiency of the AMR-EMPIC model.     

Fast sweeping method for the factored eikonal equation

We develop a fast sweeping method for the factored eikonal equation. By decomposing the solution of a general eikonal equation as the product of two factors: the first factor is the solution to a simple eikonal equation (such as distance) or a previously computed solution to an approximate eikonal equation. The second factor is a necessary modification/correction. Appropriate discretization and a fast sweeping strategy are designed for the equation of the correction part. The key idea is to enforce the causality of the original eikonal equation during the Gauss–Seidel iterations. Using extensive numerical examples we demonstrate that (1) the convergence behavior of the fast sweeping method for the factored eikonal equation is the same as for the original eikonal equation, i.e., the number of iterations for the Gauss–Seidel iterations is independent of the mesh size, (2) the numerical solution from the factored eikonal equation is more accurate than the numerical solution directly computed from the original eikonal equation, especially for point sources.     

一类非线性微分方程的近似解析解

从理论上研究了一类广义扩散方程的求解问题. 利用相似变换和解析拆分技巧给出了求解该类非线性微分方程近似解的一种有效方法, 方程的解可以表示为一个收敛的幂级数. 近似解结果和数值结果非常符合，证明了所提出的方法的准确性和可靠性, 该方法可以用于解决其他科学和工程技术问题. 关键词： 广义扩散方程 非线性边界值问题 解析拆分 近似解析解     

交互式网格生成技术研究

探讨了分区网格生成的交互方法,包括交互输入、图形显示、网格质量检查、网格求解过程的随机可视控制等问题。在此基础上研制了一种具有交互性能的网格生成系统——BIGG。应用该系统生成的网格实例及流场解表明该交互技术是有效可行的,研制的软件系统提高了生成效率和网格质量。     

Focusators for laser-branding

A new method is investigated for synthesis of computer-generated optical elements: focusators that are able to focus the radial-symmetrical laser beam into complex focal contours, in particular into alphanumeric symbols. The method is based on decomposition of the focal contour into segments of straight lines and semi-circles, following corresponding spacing out of the focusator on elementary segments (concentric rings or sectors) and solution of the inverse task of focusing from focusator segments into corresponding elements of the focal contour. The results of numerical computing of the field from synthesized focusators into the letters are presented. The theoretical efficiency of the focusators discussed is no less than 85%. The amplitude masks and the results of operational studies of synthesized focusators are presented.     

数值模拟辐射驱动2维内爆压缩过程

采用2维三温非平衡辐射流体力学程序LARED-H数值模拟辐射驱动内爆过程。针对2维三温能量方程九点差分格式离散后的线性方程组,采用了高效的Krysolv子空间迭代解法,改进了代数解法器。将1维间接驱动内爆总体程序CFJ与LARED-H程序的计算结果进行比对,验证了LARED-H程序数值模拟1维内爆问题的正确性。并数值模拟了不同腔长辐射温度源驱动下的2维靶球运动,数值结果显示：随着腔长的增加,高压缩内爆燃料区分别被压缩成香肠形、球形和铁饼形,数值模拟结果与神光Ⅱ的实验结果定性上相同。     

Analytical and approximate solutions of(2+1)-dimensional time-fractional Burgers-Kadomtsev-Petviashvili equation

In this paper, we applied the sub-equation method to obtain a new exact solution set for the extended version of the time-fractional Kadomtsev-Petviashvili equation, namely BurgersKadomtsev-Petviashvili equation(Burgers-K-P) that arises in shallow water waves.Furthermore, using the residual power series method(RPSM), approximate solutions of the equation were obtained with the help of the Mathematica symbolic computation package. We also presented a few graphical illustrations for some surfaces. The fractional derivatives were considered in the conformable sense. All of the obtained solutions were replaced back in the governing equation to check and ensure the reliability of the method. The numerical outcomes confirmed that both methods are simple, robust and effective to achieve exact and approximate solutions of nonlinear fractional differential equations.     

Effect of Bacterial Memory Dependent Growth by Using Fractional Derivatives Reaction-Diffusion Chemotactic Model

In this paper, numerical solutions of a reaction-diffusion chemotactic model of fractional orders for bacterial growth will be present. A new solution is constructed in power series. The fractional derivatives are described in the Caputo sense. We compare the experimental result obtained with those obtained by simulation of the chemotactic model without fractional derivatives. The results show that the solution continuously depends on the time-fractional derivative. The resulting solutions spread faster than the classical solutions and may exhibit asymmetry, depending on the fractional derivative used. We present results of numerical simulations to illustrate the method, and investigate properties of numerical solutions. The Adomian’s decomposition method (ADM) is used to find the approximate solution of fractional ‘reaction-diffusion chemotactic model. Numerical results show that the approach is easy to implement and accurate when applied to partial differential equations of fractional order.