ANALYSIS OF MOVING MESH METHODS BASED ON GEOMETRICAL VARIABLES

1. IntroductionMany methods have been proposed for adapting the mesh to aChieve spatial resolution in thesolution of partial dthereatial equations. In addition to the capability of concedrating sufficientpoints about regions of rapid variation of the solution, a satisfactory mesh equatioll should besample, easy to program, and reasonably insensitive to the choice of its adjustable parameters.The earliest work on adaptive tecboques, based on moving trite element method (MFEM) wdone by Miller …     

Fuzzy同余和正规Fuzzy子群(英文)

自从A. Rosenfeld在1971年提出Fuzzy子群的概念以来,在Fuzzy群的研究方面已有不少进展,例如见[1,2,5,6,10,11,14]。另一方面,L.A.Zadeh首创的Fuzzy关系理论的研究也是硕果累累,例如见[3,4,8,12,13,15]。本文通过Fuzzy同余关系和正规Fuzzy子群的相互联系,将这两个方向的研究成果进行“嫁接”和“杂交”,得到许多有趣的结果。主要结果是定理2.7,定理3.1和3.6。本文另一主题是引入T-Fuzzy群的正规T-Fuzzy子群的新概念,当T是正则t-范算子时,得到了T-Fuzzy群的三个同构定理,作者认为它比现有的相应同构定理更为简洁、广泛和自然。     

On the limiting behavior of randomly weighted partial sums

We study the almost sure limiting behavior and convergence in probability of weighted partial sums of the form where {W_nj, 1jn, n1} and {X_nj, 1jn, n1} are triangular arrays of random variables. The results obtain irrespective of the joint distributions of the random variables within each array. Applications concerning the Efron bootstrap and queueing theory are discussed.     

激光烧蚀瑞利－泰勒不稳定性模拟

 给出了激光烧蚀流体不稳定性计算程序EUL2D的物理方程,介绍了计算中使用的活动网格和一些技术问题处理。EUL2D程序的计算结果与Takabe公式、FAST2D程序和LASNEX程序的结果较好符合。数值计算日本大阪大学激光烧蚀瑞利－泰勒不稳定性实验,再现了实验结果。发现了横向电子热传导烧蚀在长波长扰动的非线性瑞利－泰勒不稳定性演变中起重要作用。     

Laminar flow and heat transfer over a two-dimensional triangular step

The velocity correction algorithm is used in the finite element method to solve forced convection problems between parallel plates with a triangular step, for Reynolds numbers up to 1000. Equal-order interpolation functions for velocity, pressure and temperature are used. The solutions show a smooth variation of pressure. The streamfunction, isotherms, isobars and velocity profiles are presented for a typical Reynolds number of 500. The skin friction and heat transfer results are presented for Reynolds numbers up to 1000.     

A deterministic scheme for Smoluchowski's coagulation equation based on binary grid refinement

We present a deterministic scheme for the discrete Smoluchowski's coagulation equation based on a binary grid refinement. Starting from the binary grid Ω₀={1,2,4,8,16,. . .}, we first introduce an appropriate grid refinement by adding at each level 2^l grid points in every binary subsection of the grid Ω_l. In a next step we derive an approximate equation for the dynamic behavior on each level Ω_l based on a piecewise constant approximation of the right hand side of Smoluchowski's equation. Numerical results show that the computational effort can be drastically decreased compared to the corresponding complete integer grid. When considering unbounded kernels in Smoluchowski's equation we use an adaptive time step method to overcome numerical instabilities which may occur at the tails of the density function.     

Fast evaluation of trigonometric polynomials from hyperbolic crosses

The discrete Fourier transform in d dimensions with equispaced knots in space and frequency domain can be computed by the fast Fourier transform (FFT) in arithmetic operations. In order to circumvent the ‘curse of dimensionality’ in multivariate approximation, interpolations on sparse grids were introduced. In particular, for frequencies chosen from an hyperbolic cross and spatial knots on a sparse grid fast Fourier transforms that need only arithmetic operations were developed. Recently, the FFT was generalised to nonequispaced spatial knots by the so-called NFFT. In this paper, we propose an algorithm for the fast Fourier transform on hyperbolic cross points for nonequispaced spatial knots in two and three dimensions. We call this algorithm sparse NFFT (SNFFT). Our new algorithm is based on the NFFT and an appropriate partitioning of the hyperbolic cross. Numerical examples confirm our theoretical results.     

基于二重网格的动网格松弛法改进

相比传统的弹簧法等方法,基于球松弛算法的动网格松弛法在复杂边界大变形条件下可以得到质量更高的边界网格以及更大的极限变形量,但该方法在时间效率上还有提升的空间.引入二重网格,采用动网格松弛法进行稀疏网格的网格变形,将边界位移传递到整个网格计算域;再利用二重网格映射,将稀疏网格位移映射到原有计算网格的节点上.算例表明,改进...     

A first-order system approach for diffusion equation. II: Unification of advection and diffusion

In this paper, we unify advection and diffusion into a single hyperbolic system by extending the first-order system approach introduced for the diffusion equation [J. Comput. Phys., 227 (2007) 315–352] to the advection–diffusion equation. Specifically, we construct a unified hyperbolic advection–diffusion system by expressing the diffusion term as a first-order hyperbolic system and simply adding the advection term to it. Naturally then, we develop upwind schemes for this entire   system; there is thus no need to develop two different schemes, i.e., advection and diffusion schemes. We show that numerical schemes constructed in this way can be automatically uniformly accurate, allow O(h)$O(h)$ time step, and compute the solution gradients (viscous stresses/heat fluxes for the Navier–Stokes equations) simultaneously to the same order of accuracy as the main variable, for all Reynolds numbers. We present numerical results for boundary-layer type problems on non-uniform grids in one dimension and irregular triangular grids in two dimensions to demonstrate various remarkable advantages of the proposed approach. In particular, we show that the schemes solving the first-order advection–diffusion system give a tremendous speed-up in CPU time over traditional scalar schemes despite the additional cost of carrying extra variables and solving equations for them. We conclude the paper with discussions on further developments to come.