Finite volume multigrid method of the planar contraction flow of a viscoelastic fluid

This paper reports on a numerical algorithm for the steady flow of viscoelastic fluid. The conservative and constitutive equations are solved using the finite volume method (FVM) with a hybrid scheme for the velocities and first‐order upwind approximation for the viscoelastic stress. A non‐uniform staggered grid system is used. The iterative SIMPLE algorithm is employed to relax the coupled momentum and continuity equations. The non‐linear algebraic equations over the flow domain are solved iteratively by the symmetrical coupled Gauss–Seidel (SCGS) method. In both, the full approximation storage (FAS) multigrid algorithm is used. An Oldroyd‐B fluid model was selected for the calculation. Results are reported for planar 4:1 abrupt contraction at various Weissenberg numbers. The solutions are found to be stable and smooth. The solutions show that at high Weissenberg number the domain must be long enough. The convergence of the method has been verified with grid refinement. All the calculations have been performed on a PC equipped with a Pentium III processor at 550 MHz. Copyright © 2001 John Wiley & Sons, Ltd.     

4D variational data assimilation for locally nested models: Complementary theoretical aspects and application to a 2D shallow water model

We consider the application of a four‐dimensional variational data assimilation method to a numerical model, which employs local mesh refinement to improve its solution. We focus on structured meshes where a high‐resolution grid is embedded in a coarser resolution one, which covers the entire domain. The formulation of the nested variational data assimilation algorithm was derived in a preliminary work (Int. J. Numer. Meth. Fluids 2008; under review). We are interested here in complementary theoretical aspects. We present first a model for the multi‐grid background error covariance matrix. Then, we propose a variant of our algorithms based on the addition of control variables in the inter‐grid transfers in order to allow for a reduction of the errors linked to the interactions between the grids. These formulations are illustrated and discussed in the test case experiment of a 2D shallow water model. Copyright © 2010 John Wiley & Sons, Ltd.     

Grid‐independent depth‐averaged simulations with a collocated unstructured finite volume scheme

In this article, the depth‐averaged transport equations are written in a new way so that it is possible to solve the transport equations for very small water depths. Variables are interpolated into the cell face with two different schemes and, the schemes are compared in terms of computational cost and accuracy. The bed source terms are computed using two different assumptions. The effect of these assumptions on numerical simulations is then investigated. Solutions of transport equations on different types of unstructured triangular grids are compared and, an appropriate choice of grid is suggested. Copyright © 2011 John Wiley & Sons, Ltd.     

An aspect ratio agglomeration multigrid for unstructured grids

A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Cell face velocity alternatives in a structured colocated grid for the unsteady Navier–Stokes equations

The use of a colocated variable arrangement for the numerical solution of fluid flow is becoming more and more popular due to its coding simplicity. The inherent decoupling of the pressure and velocity fields in this arrangement can be handled via a special interpolation procedure for the calculation of the cell face velocity named pressure‐weighted interpolation method (PWIM) (AIAA J. 1983; 21 (11):1525–1532). In this paper a discussion on the alternatives to extend PWIM to unsteady flows is presented along with a very simple criterion to ascertain if a given interpolation practice will produce steady results that are relaxation dependent or time step dependent. Following this criterion it will be shown that some prior schemes presented as time step independent are actually not, although by using special interpolations can be readily adapted to be. A systematic way of deriving different cell face velocity expressions will be presented and new formulae free of Δt dependence will be derived. Several computational exercises will accompany the theoretical discussion to support our claims. Copyright © 2009 John Wiley & Sons, Ltd.     

Routing of 2-D switching networks by their embedding into cubes

The proposed all-optical 2-D switching networks are (i) M×N-gon prism switches (M2, N3) and (ii) 3-D grids of any geometry N3. For the routing we assume (1) the projection of the spatial architectures onto plane graphs (2) the embedding of the latter guest graphs into (in)complete host hypercubes (N=4) and generally, into N-cube networks (N3) and (3) routing by means of the cube algorithms of the host. By the embedding mainly faulty cubes (synonyms: injured cubes, incomplete cubes) arise which complicate the routing and analysis. The application of N-cube networks (i) extend the hypercube principles to any N3 (ii) increase the number of plane host graphs and (iii) reduce the incompleteness of the host cubes. Several different embeddings of the intersection graphs (IGs) of 2-D switching networks and several different routings are explained for N=4 and 6 by various examples. By the expansion of the grids (enlargement) internal waveguides (WGs) and internal switches are introduced which interact with the switches of the original 3-D grid without increasing the number of stages (NS). The embeddings by expansion apply to interconnection networks whereas dilation-2 embeddings (dilation ≡ distance of the nearest-neighbour nodes of the guest graph at the host) are rather suitable for the emulation of algorithms. Concepts for fault-tolerant routing and algorithm mapping are briefly explained.     

四阶奇异摄动边值问题在自适应网格上的一致收敛分析

we study a difference scheme for the fourth-order singular pertur-bation differential equation on the Bakhvalov-Shishkin grid by Green‘‘s function.The method is shown to be uniformly convergent with respect to the perturbation parameter,of order N^-2 in the maxmum norm on Bakhvalov-Shishkin meshes.Numerical results support our theoretical results.     

A Consistent Grid Coupling Method for Lattice-Boltzmann Schemes

A method of coupling grids of different mesh size is developed for classical Lattice-Boltzmann (LB) algorithms on uniform grids. The approach is based on an asymptotic analysis revealing suitable quantities equalized along the grid interfaces for exchanging information between the subgrids. In contrast to other couplings the method works without overlap zones. Moreover the grid velocity (Mach number) is not kept constant, as the time step depends not linearly but quadratically on the grid spacing. To illustrate the basic idea we use a simple LB algorithm solving the advection-diffusion equation. The proposed grid coupling is validated by numerical convergence studies indicating, that the coupling does not affect the second-order convergence behavior of the LB algorithm which is observed on uniform grids. In order to demonstrate its principal applicability to other LB models, the coupling is generalized to the standard D2P9 model for (Navier-)Stokes flow and tested numerically. As we use analytic tools different from the Chapman-Enskog expansion, the theoretical background material is given in two appendices. In particular, the results of numerical experiments are confirmed with a consistency analysis.     

A moving grid finite element method applied to a model biological pattern generator

Many problems in biology involve growth. In numerical simulations it can therefore be very convenient to employ a moving computational grid on a continuously deforming domain. In this paper we present a novel application of the moving grid finite element method to compute solutions of reaction–diffusion systems in two-dimensional continuously deforming Euclidean domains. A numerical software package has been developed as a result of this research that is capable of solving generalised Turing models for morphogenesis.     

Grid method: Application to the characterization of cracks

In this paper we present an application of the grid method to the assessment of crack initiation and growth in brittle materials. It is shown that a grid deposited on the surface of a structure can be utilized to characterize the crack location and opening. Furthermore, one single picture only is required to carry out a control over a predefined area. First, the principle of the method is introduced, showing that a periodical pattern encoding a cracked surface can be analyzed by signal processing. The phase modulation of the grid can be calculated very accurately for any small deformation of the structure. Discontinuities due to cracks are easily detected on the phase field and the crack width is proportional to the amplitude of the discontinuity. Secondly, the performances of the method are presented, mainly depending on the spatial frequency of both the pattern and the sampling. It is shown that good results can generally be obtained with few setting difficulties and equipment investment. Finally, we sum up some basic recommendations for the practical use of the technique.