Generation of three-dimensional block-structured grids based on rotation of two-dimensional multiply connected cross sections

An algorithm for generating curvilinear block-structured grids in axisymmetric three-dimensional domains of any connectivity is developed. The organization of the connection between the blocks is automated. The grids constructed are used to compute ideal gas steady flows past axisymmetric bodies at a nonzero angle of attack.     

A family of symmetric mixed finite elements for linear elasticity on tetrahedral grids

A family of stable mixed finite elements for the linear elasticity on tetrahedral grids are constructed,where the stress is approximated by symmetric H(div)-Pk polynomial tensors and the displacement is approximated by C-1-Pk-1polynomial vectors,for all k 4.The main ingredients for the analysis are a new basis of the space of symmetric matrices,an intrinsic H(div)bubble function space on each element,and a new technique for establishing the discrete inf-sup condition.In particular,they enable us to prove that the divergence space of the H(div)bubble function space is identical to the orthogonal complement space of the rigid motion space with respect to the vector-valued Pk-1polynomial space on each tetrahedron.The optimal error estimate is proved,verified by numerical examples.     

Mixing via the extended family

In this paper,the relationship between the extended family and several mixing properties in measuretheoretical dynamical systems is investigated.The extended family eF related to a given family F can be regarded as the collection of all sets obtained as"piecewise shifted"members of F.For a measure preserving transformation T on a Lebesgue space(X,B,μ),the sets of"accurate intersections of order k"defined below are studied,Nε(A0,A1,...,Ak)=n∈Z+:μk i=0T inAiμ(A0)μ(A1)μ(Ak)ε,for k∈N,A0,A1,...,Ak∈B and ε0.It is shown that if T is weakly mixing(mildly mixing)then for any k∈N,all the sets Nε(A0,A1,...,Ak)have Banach density 1(are in(eFip),i.e.,the dual of the extended family related to IP-sets).     

A family of mixed finite elements for the biharmonic equations on triangular and tetrahedral grids

Science China Mathematics - This paper introduces a new family of mixed finite elements for solving a mixed formulation of the biharmonic equations in two and three dimensions. The symmetric stress...     

Efficient embeddings of grids into grids

In this paper we explore one-to-one embeddings of two-dimensional grids into their ideal two-dimensional grids. The presented results are optimal or considerably close to the optimum. For embedding grids into grids of smaller aspect ratio, we prove a new lower bound on the dilation matching a known upper bound. The edge-congestion provided by our matrix-based construction differs from the here presented lower bound by at most one. For embedding grids into grids of larger aspect ratio, we establish five as an upper bound on the dilation and four as an upper bound on the edge-congestion, which are improvements over previous results.     

A characterization of mapping unstructured grids onto structured grids and using multigrid as a preconditioner

Many problems based on unstructured grids provide a natural multigrid framework due to using an adaptive gridding procedure. When the grids are saved, even starting from just a fine grid problem poses no serious theoretical difficulties in applying multigrid. A more difficult case occurs when a highly unstructured grid problem is to be solved with no hints how the grid was produced. Here, there may be no natural multigrid structure and applying such a solver may be quite difficult to do. Since unstructured grids play a vital role in scientific computing, many modifications have been proposed in order to apply a fast, robust multigrid solver. One suggested solution is to map the unstructured grid onto a structured grid and then apply multigrid to a sequence of structured grids as a preconditioner. In this paper, we derive both general upper and lower bounds on the condition number of this procedure in terms of computable grid parameters. We provide examples to illuminate when this preconditioner is a useful (e. g.,p orh-p formulated finite element problems on semi-structured grids) or should be avoided (e.g., typical computational fluid dynamics (CFD) or boundary layer problems). We show that unless great care is taken, this mapping can lead to a system with a high condition number which eliminates the advantage of the multigrid method. This work was partially supported by ONR Grant # N0014-91-J-1576.     

A Lax-Wendroff type theorem for unstructured quasi-uniform grids

A well-known theorem of Lax and Wendroff states that if the sequence of approximate solutions to a system of hyperbolic conservation laws generated by a conservative consistent numerical scheme converges boundedly a.e. as the mesh parameter goes to zero, then the limit is a weak solution of the system. Moreover, if the scheme satisfies a discrete entropy inequality as well, the limit is an entropy solution. The original theorem applies to uniform Cartesian grids; this article presents a generalization for quasi-uniform grids (with Lipschitz-boundary cells) uniformly continuous inhomogeneous numerical fluxes and nonlinear inhomogeneous sources. The added generality allows a discussion of novel applications like local time stepping, grids with moving vertices and conservative remapping. A counterexample demonstrates that the theorem is not valid for arbitrary non-quasi-uniform grids.

     

A cops and robber game in multidimensional grids

We theoretically analyze the ‘cops and robber’ game for the first time in a multidimensional grid. It is shown that in an n-dimensional grid, at least n cops are necessary if one wants to catch the robber for all possible initial configurations. We also present a set of cop strategies for which n cops are provably sufficient to catch the robber. Further, we revisit the game in a two-dimensional grid and provide an independent proof of the fact that the robber can be caught even by a single cop under certain conditions.     

A study of high-order grid-characteristic methods on unstructured grids

In this paper, grid-characteristic methods for solving hyperbolic systems using approximation with high-order interpolation on unstructured tetrahedral and triangular grids are studied. Interpolation methods of order from 1 through 5 inclusive are considered. One-dimensional finite difference schemes for these methods are presented. The stability of these schemes is investigated. The grid-characteristic methods on unstructured triangular and tetrahedral grids are successfully used in seismic prospecting, specifically under the Arctic shelf and permafrost conditions. They are also used to solve problems of seismics, dynamic deformation and destruction, and to study anisotropic composite materials.     

Optimization of computational grids

We consider the problem of mesh grading or gridr-point redistribution using optimization techniques. Some representate forms of the objective functions are considered and the assocated scaling parameterization and nonlinear programming algorithms examined. Numerical results for representative test problems involving two-and three-dimensional grids are presented.     

A note on fast Fourier transforms for nonequispaced grids

In this paper, we are concerned with fast Fourier transforms for nonequispaced grids. We propose a general efficient method for the fast evaluation of trigonometric polynomials at nonequispaced nodes based on the approximation of the polynomials by special linear combinations of translates of suitable functions ϕ. We derive estimates for the approximation error. In particular, we improve the estimates given by Dutt and Rokhlin [7]. As a practical consequence, we obtain a criterion for the choice of the parameters involved in the fast transforms. This revised version was published online in August 2006 with corrections to the Cover Date.     

A mortar mimetic finite difference method on non-matching grids

We consider mimetic finite difference approximations to second order elliptic problems on non-matching multiblock grids. Mortar finite elements are employed on the non-matching interfaces to impose weak flux continuity. Optimal convergence and, in certain cases, superconvergence is established for both the scalar variable and its flux. The theory is confirmed by computational results. Supported by the US Department of Energy, under contractW-7405-ENG-36. LA-UR-04-4740. Partially supported by NSF grants EIA 0121523 and DMS 0411413, by NPACI grant UCSD 10181410, and by DOE grant DE-FGO2-04ER25617. Partially supported by NSF grants DMS 0107389, DMS 0112239 and DMS 0411694 and by DOE grant DE-FG02-04ER25618.     

A lowest order divergence-free finite element on rectangular grids

It is shown that the conforming Q _2,1;1,2-Q′₁ mixed element is stable, and provides optimal order of approximation for the Stokes equations on rectangular grids. Here, Q _2,1;1,2 = Q _2,1 × Q _1,2, and Q _2,1 denotes the space of continuous piecewise-polynomials of degree 2 or less in the x direction but of degree 1 in the y direction. Q′₁ is the space of discontinuous bilinear polynomials, with spurious modes filtered. To be precise, Q′₁ is the divergence of the discrete velocity space Q _2,1;1,2. Therefore, the resulting finite element solution for the velocity is divergence-free pointwise, when solving the Stokes equations. This element is the lowest order one in a family of divergence-free element, similar to the families of the Bernardi-Raugel element and the Raviart-Thomas element.     

Interpolation on spherical geodesic grids: A comparative study

Most operational models in atmospheric physics, meteorology and climatology nowadays adopt spherical geodesic grids and require “ad hoc” developed interpolation procedures. The author does a comparison between chosen representatives of linear, distance-based and cubic interpolation schemes outlining their advantages and drawbacks in this specific application field. Numerical experiments on a standard test problem, while confirming a good performance of linear and distance-based schemes in a single interpolation step, also show their minor accuracy with respect to the cubic scheme in the more realistic simulation of advection of a meteorological field.     

A distributed combustion solver for engine simulations on grids

Multi-dimensional models for predictive simulations of modern engines are an example of multi-physics and multi-scale mathematical models, since lots of thermofluiddynamic processes in complex geometrical configurations have to be considered. Typical models involve different submodels, including turbulence, spray and combustion models, with different characteristic time scales. The predictive capability of the complete models depends on the accuracy of the submodels as well as on the reliability of the numerical solution algorithms. In this work we propose a multi-solver approach for reliable and efficient solution of the stiff Ordinary Differential Equation (ODE) systems arising from detailed chemical reaction mechanisms for combustion modeling. Main aim was to obtain high-performance parallel solution of combustion submodels in the overall procedure for simulation of engines on distributed heterogeneous computing platforms. To this aim we interfaced our solver with the CHEMKIN-II package and the KIVA3V-II code and carried out multi-computer simulations of realistic engines. Numerical experiments devoted to test reliability of the simulation results and efficiency of the distributed combustion solver are presented and discussed.     

A characterization of extended monotone metrics

Classical information geometry has emerged from the study of geometrical aspect of the statistical estimation. Cencov characterized the Fisher metric as a canonical metric on probability simplexes from a statistical point of view, and Campbell extended the characterization of the Fisher metric from probability simplexes to positive cone . In quantum information geometry, quantum states which are represented by positive Hermitian matrices with trace one are regarded as an extension of probability distributions. A quantum version of the Fisher metric is introduced, and is called a monotone metric. Petz characterized the monotone metrics on the space of all quantum states in terms of operator monotone functions. A purpose of the present paper is to extend a characterization of monotone metrics from the space of all states to the space of all positive Hermitian matrices on finite dimensional Hilbert space. This characterization corresponds quantum modification of Campbell’s work.     

A parallel extended GCD algorithm

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O(n/logn) time using at most n¹⁺ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bits of the integers u and v, with uv. This approach is more suitable for extended GCD algorithms since the coefficients of the extended version a and b, such that au+bv=gcd(u,v), are deeply linked with the order of magnitude of the rational v/u and its continuants. Consequently, the computation of such coefficients is much easier.