【摘 要】
：
This paper describes the work on parallelization of the tracer interfaces moving grid method program, and gives some numerical experiments on several computers.
论文部分内容阅读
This paper describes the work on parallelization of the tracer interfaces moving grid method program, and gives some numerical experiments on several computers.
其他文献
In this paper an interval verification algorithm for the solutions of nonlinear systems is presented. The algorithm combines the high convergent speed of the floating-point iterative methods and the r
In this paper, we construct a hybrid evolutionary strategies (HES) for constrained optimization problems. Evolutionary strategies (ES) and hybrid evolutionary strategies (HES) are comparied on two con
In using the methods given by [1] to compute the hypersingular integrals on interval,one should select the mesh carefully in such a way that singular point falls near the center of a subinterval. A nu
The double circle-arc fitting in the same direction and in the opposite direction are given in the original coordinates for arbitrary plane parametric curves, after the straight line, the circular-arc
In this paper, we present a simplified third-order weighted ENO finite volume method on unstructured triangular mesh. The third-order TVD Runge-Kutta time diswcretization is used. A weighted quadratic
Do-loop unrolling is an effective technique for improving performance of applicistion programs. This paper presents a method for unrolling nested Fortran DO-loops using the m4 macro language. m4 is a
Parallel multigrid computations for high Reynolds Steady-state incompressible enterring flows and recirculating flows Navier-Stokes equations are organized in this paper.Based on the existed successfu
In this paper, based on the natural boundary reduction suggested by Feng and Yu,an overlapping domain decomposition method for harmonic boundary value problerns on the unbounded sector domain or the u
The explicit formulation of the surrogate dual of quadratic programming is given in this paper, and the condition on which no gap will occur between the primal and the dual is found by using Karush-Ku
A new algorithm, based on the combination of the evolutionary programming and the classical gradient adustment techniques. Its efficiency is higher than that of general evolutionary programming. Numer