Supersonic flow past a flat lattice of cylindrical rods

Two-dimensional supersonic laminar ideal gas flows past a regular flat lattice of identical circular cylinders lying in a plane perpendicular to the free-stream velocity are numerically simulated. The flows are computed by applying a multiblock numerical technique with local boundary-fitted curvilinear grids that have finite regions overlapping the global rectangular grid covering the entire computational domain. Viscous boundary layers are resolved on the local grids by applying the Navier–Stokes equations, while the aerodynamic interference of shock wave structures occurring between the lattice elements is described by the Euler equations. In the overlapping grid regions, the functions are interpolated to the grid interfaces. The regimes of supersonic lattice flow are classified. The parameter ranges in which the steady flow around the lattice is not unique are detected, and the mechanisms of hysteresis phenomena are examined.     

Grid construction for discretely defined configurations

An important element of global software codes for computing real-life three-dimensional problems with singularities (such as boundary and internal layers, shocks, detonation waves, combustion fronts, high-speed jets, and phase transition zones) is automatic adaptive grid generation, which can considerably enhance the efficiency of computer resource management. In three-dimensional domains with boundaries of complex geometry, in particular, with discretely defined boundaries, adaptive grids are generated by applying inverted Beltrami and diffusion equations for a spherical monitor tensor.     

A high order central-upwind scheme for hyperbolic conservation laws

A high order central-upwind scheme for approximating hyperbolic conservation laws is proposed. This construction is based on the evaluation of the local propagation speeds of the discontinuities and Peer's fourth order non-oscillatory reconstruction. The presented scheme shares the simplicity of central schemes, namely no Riemann solvers are involved. Furthermore, it avoids alternating between two staggered grids, which is particularly a challenge for problems which involve complex geometries and boundary conditions. Numerical experiments demonstrate the high resolution and non-oscillatory properties of our scheme.     

Repeated Richardson extrapolation applied to the two-dimensional Laplace equation using triangular and square grids

The focus of this work is to verify the efficiency of the Repeated Richardson Extrapolation (RRE) to reduce the discretization error in a triangular grid and to compare the result to the one obtained for a square grid for the two-dimensional Laplace equation. Two different geometries were employed: the first one, a unitary square domain, was discretized into a square or triangular grid; and the second, a half square triangle, was discretized into a triangular grid. The methodology employed used the following conditions: the finite volume method, uniform grids, second-order accurate approximations, several variables of interest, Dirichlet boundary conditions, grids with up to 16,777,216 nodes for the square domain and up to 2097,152 nodes for the half square triangle domain, multigrid method, double precision, up to eleven Richardson extrapolations for the first domain and up to ten Richardson extrapolations for the second domain. It was verified that (1) RRE is efficient in reducing the discretization error in a triangular grid, achieving an effective order of approximately 11 for all the variables of interest for the first geometry; (2) for the same number of nodes and with or without RRE, the discretization error is smaller in a square grid than in a triangular grid; and (3) the magnitude of the numerical error reduction depends on, among other factors, the variable of interest and the domain geometry.     

A holistic finite difference approach models linear dynamics consistently

I prove that a centre manifold approach to creating finite difference models will consistently model linear dynamics as the grid spacing becomes small. Using such tools of dynamical systems theory gives new assurances about the quality of finite difference models under nonlinear and other perturbations on grids with finite spacing. For example, the linear advection-diffusion equation is found to be stably modelled for all advection speeds and all grid spacings. The theorems establish an extremely good form for the artificial internal boundary conditions that need to be introduced to apply centre manifold theory. When numerically solving nonlinear partial differential equations, this approach can be used to systematically derive finite difference models which automatically have excellent characteristics. Their good performance for finite grid spacing implies that fewer grid points may be used and consequently there will be less difficulties with stiff rapidly decaying modes in continuum problems.

     

Conditional ɛ-uniform convergence of adaptive algorithms in the finite element method as applied to singularly perturbed problems

The boundary value problem for the ordinary differential equation of reaction-diffusion on the interval [−1, 1] is examined. The highest derivative in this equation appears with a small parameter ɛ² (ɛ ∈ (0, 1]). As the small parameter approaches zero, boundary layers arise in the neighborhood of the interval endpoints. An algorithm for the construction of a posteriori adaptive piecewise uniform grids is proposed. In the adaptation process, the edges of the boundary layers are located more accurately and the grid on the boundary layers is repeatedly refined. To find an approximate solution, the finite element method is used. The sequence of grids constructed by the algorithm is shown to converge “conditionally ɛ-uniformly” to some limit partition for which the error estimate O(N ⁻²ln³ N) is proved. The main results are obtained under the assumption that ɛ ≪ N ⁻¹, where N is number of grid nodes; thus, conditional ɛ-uniform convergence is dealt with. The proofs use the Galerkin projector and its property to be quasi-optimal.     

A new type of boundary treatment for wave propagation

Numerical approximation of wave propagation can be done very efficiently on uniform grids. The Yee scheme is a good example. A serious problem with uniform grids is the approximation of boundary conditions at a boundary not aligned with the grid. In this paper, boundary conditions are introduced by modifying appropriate material coefficients at a few grid points close to the embedded boundary. This procedure is applied to the Yee scheme and the resulting method is proven to be \(L^2\)-stable in one space dimension. Depending on the boundary approximation technique it is of first or second order accuracy even if the boundary is located at an arbitrary point relative to the grid. This boundary treatment is applied also to a higher order discretization resulting in a third order accurate method. All algorithms have the same staggered grid structure in the interior as well as across the boundaries for efficiency. A numerical example with the extension to two space dimensions is included.     

关于Hamilton栅图

A complete grid G_m,n is the cartesian product of two paths P_m and P_n. In this paper, it is proved that a class of complete grids with two vertices removed are hamiltonian. This result settles a conjecture of S.M. Hedetniemi, S.T. Hede tniemi and P .J . Slater in positive.     

Strong-form approach to elasticity: Hybrid finite difference-meshless collocation method (FDMCM)

We propose a numerical method that combines the finite difference (FD) and strong form (collocation) meshless method (MM) for solving linear elasticity equations. We call this new method FDMCM. The FDMCM scheme uses a uniform Cartesian grid embedded in complex geometries and applies both methods to calculate spatial derivatives. The spatial domain is represented by a set of nodes categorized as (i) boundary and near boundary nodes, and (ii) interior nodes. For boundary and near boundary nodes, where the finite difference stencil cannot be defined, the Discretization Corrected Particle Strength Exchange (DC PSE) scheme is used for derivative evaluation, while for interior nodes standard second order finite differences are used. FDMCM method combines the advantages of both FD and DC PSE methods. It supports a fast and simple generation of grids and provides convergence rates comparable to weak formulations. We demonstrate the appropriateness and robustness of the proposed scheme through various benchmark problems in 2D and 3D. Numerical results show good accuracy and h-convergence properties. The ease of computational grid generation makes the method particularly suited for problems where geometries are very complicated and known only imperfectly from images, frequently occurring in e.g. geomechanics and patient-specific biomechanics, where the proposed FDMCM method, after its extension to non-linear regime, appears to be a promising alternative to the traditional weak form-based numerical schemes used in the field.     

Application of the spherical metric tensor to grid adaptation and the solution of applied problems

New results concerning the construction and application of adaptive numerical grids for solving applied problems are presented. The grid generation technique is based on the numerical solution of inverted Beltrami and diffusion equations for a monitor metric. The capabilities of the spherical metric tensor as applied to adaptive grid generation are examined in detail. Adaptive hexahedral grids are used to numerically solve a boundary value problem for the three-dimensional heat equation with a moving boundary in a continuous medium with discontinuous thermophysical parameters; this problem models the interaction of a thermal wave with a thermocouple embedded in the solid.     

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.     

Mathematical simulation of laser induced melting and evaporation of multilayer materials

Using the laser induced remelting of a three-layer target Al + Ni + Cr as an example, the use of the dynamic adaptation for solving the multifront Stefan problem with explicit tracking of the melting and evaporation fronts is considered. The dynamic adaptation is used to construct quasi-uniform grids in regions with moving boundaries. The characteristic size of those regions may vary by several orders of magnitude in the process of computations. The algorithm used to construct the grids takes into account the varying size of the region and the velocity of the boundary motion, which makes it possible to automatically distribute the grid points without using fitting parameters. The mathematical simulation of the doping process using the melt with respect to the thick substrate and thin doping layers showed the importance of the sequencing of coatings. The computations showed that if the upper exposed layer is chromium, then it can completely evaporate or sublimate by the end of the pulse due to its heat-transfer properties. This can be easily changed if the doping layers are arranged according to the scheme Al + Cr + Ni. Then, the upper exposed layer is nickel, which is not so easily evaporated.     

Saturated-unsaturated groundwater modeling using 3D Richards equation with a coordinate transform of nonorthogonal grids

Saturated-unsaturated flow under a complex terrain is usually solved using the Richards equation. Finite difference or finite volume methods are commonly employed for discretization of Richards equation because of simplicity of coding. Complex subsurface boundary geometries lead to nonorthogonal grids in curvilinear grid systems, which leads to difficulty in discretization and mesh generation. This paper develops a vertical coordinate transform, enabling a computational domain regular in the vertical direction. As a result, the grid of curvilinear surfaces can be successfully transformed to a computational grid that allows solution of the Richards equation with efficient computation and simpler coding. The anisotropic Richards equation in the Cartesian coordinate system is transformed to the equation in the arbitrary coordinate system and further expressed as a form appropriate to the orthogonal coordinate system. The generalized third boundary condition is transformed to a form suited to the orthogonal coordinate system. The finite volume method is used to solve the Richards equation in the orthogonal coordinate system. Four cases are used to validate the present orthogonal coordinate system. The computational results from the orthogonal coordinate system are in good agreement with the results from Ansys Fluent solved in a Cartesian coordinate system for the subsurface flow case. For the coupled case of hill slopes, a good agreement between the computational results and the experimental data is obtained. The present results for V-titled catchment and slab case accord well with the results obtained from HydroGeoSphere and PAWS. The present algorithm can improve grid generation for solution of Richards equation in a hydrological model for a complex domain.     

Numerical multi-block grids in coastal ocean circulation modeling

In coastal ocean modeling, one desires to capture the evolution and interaction of multi-scales of physical phenomena in a complicated physical domain. With limited computer resources, an appropriate choice of the numerical grid has a key role in determining the quality of the solution of a numerical coastal ocean model. Traditionally, single-block rectangular grids have been most commonly used in coastal ocean modeling for their simplicity. An effective coastal ocean model represents the dynamics of the coastal ocean flow on a numerical grid, including the effects of complicated features such as coastlines, bottom topography (submarine canyons, seamounts, narrow straits), and multi-scale physical phenomena. These problems require a model grid system more efficient than a traditional single-block rectangular grid. The model grids must give better resolution of coastlines and boundary conditions, multi-scale physical phenomenon, and save computer resources. These grids can also easily increase horizontal resolution in a subregion of the model domain without increasing computer expense with high resolution over the entire domain. The multi-block numerical generation grid technique is used in developing a coastal ocean system applied to the Mediterranean Sea (MED) with complicated coastlines, bottom topography and multi-scale physical features. The MED coastal ocean system consists of the MED model based on the Princeton Ocean Model, numerical grid generation routines, and a grid package which allows the model to be coupled with model grids. The traditional, nine-block orthogonal grid, and eight-block curvilinear nearly orthogonal coastline-following grid are used in the study. The numerical solutions with the three grids are compared in term of effectiveness. The numerical simulations show some MED basic physical features.     

Solving the problem of non-stationary filtration of substance by the discontinuous Galerkin method on unstructured grids

A numerical algorithm is proposed for solving the problem of non-stationary filtration of substance in anisotropic media by the Galerkin method with discontinuous basis functions on unstructured triangular grids. A characteristic feature of this method is that the flux variables are considered on the dual grid. The dual grid comprises median control volumes around the nodes of the original triangular grid. The flux values of the quantities on the boundary of an element are calculated with the help of stabilizing additions. For averaging the permeability tensor over the cells of the dual grid, the method of support operators is applied. The method is studied on the example of a two-dimensional boundary value problem. The convergence and approximation of the numerical method are analyzed, and results of mathematical modeling are presented. The numerical results demonstrate the applicability of this approach for solving problems of non-stationary filtration of substance in anisotropic media by the discontinuous Galerkin method on unstructured triangular grids.     

Barrier variational generation of quasi‐isometric grids

A grid generation method based on the minimization of the discrete barrier functional with feasible set consisting of quasi‐isometric grids is suggested. The deviation from isometry for given grid connectivity and prescribed boundary conditions is minimized via the contraction of the feasible set into a small vicinity of the optimal grid. Formulation of functional with given metrics in both physical and logical spaces allows to consider the adaptive grid generation in terms of quasi‐isometric grids and cover many practical applications. A fast and reliable grid untangling procedure based on the penalty‐like reformulation of barrier functional and the continuation technique is described. Numerical experiments demonstrate that the suggested functional produces high‐quality grids with small global condition numbers. Copyright © 2001 John Wiley & Sons, Ltd.     

Optimal adaptive grids of least-squares finite element methods in two spatial dimensions

This article concerns a procedure to generate optimal adaptive grids for convection dominated problems in two spatial dimensions based on least-squares finite element approximations. The procedure extends a one dimensional equidistribution principle which minimizes the interpolation error in some norms. The idea is to select two directions which can reflect the physics of the problems and then apply the one dimensional equidistribution principle to the chosen directions. Model problems considered are the two dimensional convection-diffusion problems where boundary and interior layers occur. Numerical results of model problems illustrating the efficiency of the proposed scheme are presented. In addition, to avoid skewed mesh in the optimal grids generated by the algorithm, an unstructured local mesh smoothing will be considered in the least-squares approximations. Comparisons with the Gakerkin finite element method will also be provided.     

Local defect correction with different grid types

For a Poisson problem with a solution having large gradients in (nearly) circular subregions a local defect correction method is considered. The problem on the global domain is discretized on a cartesian grid, whereas the restriction of the problem to a circular subdomain is discretized on a polar grid. The two discretizations are then combined in an iterative way. We show that LDC can be viewed as an iterative method for the Poisson equation on a single composite cartesian‐polar grid. The efficiency of methods is illustrated by numerical examples. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 454–468, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10018     

Grid approximation of a parabolic convection-diffusion equation on a priori adapted grids: ε-uniformly convergent schemes

The boundary value problem for a singularly perturbed parabolic convection-diffusion equation is considered. A finite difference scheme on a priori (sequentially) adapted grids is constructed and its convergence is examined. The construction of the scheme on a priori adapted grids is based on a majorant of the singular component of the grid solution that makes it possible to a priori find a subdomain in which the grid solution should be further refined given the perturbation parameter ε, the size of the uniform mesh in x, the desired accuracy of the grid solution, and the prescribed number of iterations K used to refine the solution. In the subdomains where the solution is refined, the grid problems are solved on uniform grids. The error of the solution thus constructed weakly depends on ε. The scheme converges almost ε-uniformly; namely, it converges under the condition N ^?1 = o(ε^v), where v = v(K) can be chosen arbitrarily small when K is sufficiently large. If a piecewise uniform grid is used instead of a uniform one at the final Kth iteration, the difference scheme converges ε-uniformly. For this piecewise uniform grid, the ratio of the mesh sizes in x on the parts of the mesh with a constant size (outside the boundary layer and inside it) is considerably less than that for the known ε-uniformly convergent schemes on piecewise uniform grids.