Numerical simulation on an interaction of a vortex street with an elliptical leading edge using an unstructured grid

An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd.     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

A novel method for automated grid generation of ice shapes for local‐flow analysis

Modelling a complex geometry, such as ice roughness, plays a key role for the computational flow analysis over rough surfaces. This paper presents two enhancement ideas in modelling roughness geometry for local flow analysis over an aerodynamic surface. The first enhancement is use of the leading‐edge region of an airfoil as a perturbation to the parabola surface. The reasons for using a parabola as the base geometry are: it resembles the airfoil leading edge in the vicinity of its apex and it allows the use of a lower apparent Reynolds number. The second enhancement makes use of the Fourier analysis for modelling complex ice roughness on the leading edge of airfoils. This method of modelling provides an analytical expression, which describes the roughness geometry and the corresponding derivatives. The factors affecting the performance of the Fourier analysis were also investigated. It was shown that the number of sine–cosine terms and the number of control points are of importance. Finally, these enhancements are incorporated into an automated grid generation method over the airfoil ice accretion surface. The validations for both enhancements demonstrate that they can improve the current capability of grid generation and computational flow field analysis around airfoils with ice roughness. Copyright © 2004 John Wiley & Sons, Ltd.     

Least‐squares finite element method on adaptive grid for PDEs with shocks

We apply the least‐squares finite element method with adaptive grid to nonlinear time‐dependent PDEs with shocks. The least‐squares finite element method is also used in applying the deformation method to generate the adaptive moving grids. The effectiveness of this method is demonstrated by solving a Burgers' equation with shocks. Computational results on uniform grids and adaptive grids are compared for the purpose of evaluation. The results show that the adaptive grids can capture the shock more sharply with significantly less computational time. For moving shock, the adaptive grid moves correctly with the shock. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

泡沫铅对VRLA电池负极活性物质结构及性能影响

0引言随着36V/42V汽车电源系统的提出,新一轮汽车用电池的竞争不断加剧。从目前情况看,铅酸电池由于具有成本低廉,使用可靠,原材料来源丰富,铅回收率可高达98%等优点,因此成为电动车电源最实际的选择之一[1]。但作为电动车用电池,需要克服其比能量低、充电接受能力差和负极硫酸盐化等缺点。为此各国科学家开展了大量的研究工作。最近报道用铸造多孔体作为敞口铅酸电池的集流体,它的比表面积为14cm2·cm-3,正极活性物质利用率上升到50%,远高于传统的铸造板栅[2]。在铅酸电池集流体研究领域里另一个重大进步,就是以R V C(R etic-ulated V i…     

Analysis of grid file algorithms

Grid file algorithms were suggested in [12] to provide multi-key access to records in a dynamically growing file. We specify here two algorithms and derive the average sizes of the corresponding directories. We provide an asymptotic analysis. The growth of the indexes appears to be non-linear for uniform distributions:O(v ^c ) orO(v ), wherec=1+b^–1, =1+(s-1)/(sb+1),s is the number of attributes being used,v the file size, andb the page capacity of the system. Finally we give corresponding results for biased distributions and compare transient phases.     

Electrophoresis simulations using Chebyshev pseudo-spectral method on a moving mesh

We present the implementation and demonstration of the Chebyshev pseudo-spectral method coupled with an adaptive mesh method for performing fast and highly accurate electrophoresis simulations. The Chebyshev pseudo-spectral method offers higher numerical accuracy than all other finite difference methods and is applicable for simulating all electrophoresis techniques in channels with open or closed boundaries. To improve the computational efficiency, we use a novel moving mesh scheme that clusters the grid points in the regions with poor numerical resolution. We demonstrate the application of the Chebyshev pseudo-spectral method on a moving mesh for simulating nonlinear electrophoretic processes through examples of isotachophoresis (ITP), isoelectric focusing (IEF), and electromigration-dispersion in capillary zone electrophoresis (CZE) at current densities as high as 1000 A/m. We also show the efficacy of our moving mesh method over existing methods that cluster the grid points in the regions with large concentration gradients. We have integrated the adaptive Chebyshev pseudo-spectral method in the open-source SPYCE simulator and verified its implementation with other electrophoresis simulators.     

Homo- and heterometallic [2x2] grid arrays containing RuII, OsII, and FeII subunits and their mononuclear RuII and OsII precursors: synthesis, absorption spectra, redox behavior, and luminescence properties

The absorption spectra, redox behavior, and luminescence properties (both at 77 K in rigid matrices and at room temperature in fluid solution) of a series of [2x2] molecular grids have been investigated. The latter were prepared either by means of sequential self-assembly, or by a stepwise protection/deprotection procedure, and are based on a ditopic hexadentate ligand 1 in which two terpyridine-like binding sites are fused together in a linear arrangement. The molecular grids studied include the homometallic species [[Fe(1)](4)](8+) (Fe(2)Fe(2)), and the heterometallic species [[Ru(1)](2)[Fe(1)](2)](8+) (Ru(2)Fe(2)) and [[Os(1)](2)[Fe(1)](2)](8+) (Os(2)Fe(2)). For comparison purposes, the properties of the mononuclear complexes [Ru(1)(2)](2+) (1-Ru) and [Os(1)(2)](2+) (1-Os) have been studied. All these compounds exhibit very intense absorption bands in the UV region (epsilon in the 10(5)-10(6) M(-1) cm(-1) range, attributed to spin-allowed ligand-centered (LC) transitions), as well as intense metal-to-ligand charge-transfer (MLCT) transitions (epsilon in the 10(4)-10(5) M(-1) cm(-1) range) that extend to the entire visible region. The mononuclear species 1-Ru and 1-Os exhibit relatively intense luminescence, both in acetonitrile at room temperature (tau=59 and 18 ns, respectively) and in butyronitrile rigid matrices at 77 K. In contrast, the tetranuclear molecular grids do not exhibit any luminescence, either at room temperature or at 77 K. This is attributed to fast intercomponent energy transfer from the Ru- or Os-based subunits to the low-lying metal-centered (MC) levels involving the Fe(II) centers, which leads to fast radiationless decay. The redox behavior of the compounds is characterized by several metal-centered oxidation and ligand-centered reduction processes, most of them reversible in nature (as many as twelve for Fe(2)Fe(2)). Detailed assignment of each redox process has been made, and it is apparent that these systems can be viewed as multilevel molecular electronic species capable of reversibly exchanging a number of electrons at accessible and predetermined potentials. Furthermore, it is shown that the electronic interaction between specific subunits depends on their location in the structure and on the oxidation states of the other components.     

Properties of the random search in global optimization

From theorems which we prove about the behavior of gaps in a set ofN uniformly random points on the interval [0, 1], we determine properties of the random search procedure in one-dimensional global optimization. In particular, we show that the uniform grid search is better than the random search when the optimum is chosen using the deterministic strategy, that a significant proportion of large gaps are contained in the uniformly random search, and that the error in the determination of the point at which the optimum occurs, assuming that it is unique, will on the average be twice as large using the uniformly random search compared with the uniform grid. In addition, some of the properties of the largest gap are verified numerically, and some extensions to higher dimensions are discussed. The latter show that not all of the conclusions derived concerning the inadequacies of the one-dimensional random search extend to higher dimensions, and thaton average the random search is better than the uniform grid for dimensions greater than 6.This paper is based on work started in the Statistics Department of Princeton University when the first author was visiting as a Research Associate. Part of this research was supported by the Office of Naval Research, Contract No. 0014-67-A-0151-0017, and by the US Army Research Office—Durham, Contract No. DA-31-124-ARO-D-215.2 The authors wish to thank B. Omodei for his careful work in preparing the programs for the results of Figs. 1–2 and Table 1. The computations were performed on the IBM 360/50 of the Australian National University's Computer Centre. Thanks are also due to R. Miles for suggestions regarding the extension of the results to multidimensional regions, and to P. A. P. Moran and R. Brent for suggestions regarding the evaluation of the integral ₀ ¹ ... ^0/1 (x ₁ ² + ... +x _n ^/2 )^1/2 dx ₁ ...dx _n.     

A primitive-variable Riemann method for solution of the shallow water equations with wetting and drying

A Riemann flux that uses primitive variables rather than conserved variables is developed for the shallow water equations with nonuniform bathymetry. This primitive-variable flux is both conservative and well behaved at zero depth. The unstructured finite-volume discretization used is suitable for highly nonuniform grids that provide resolution of complex geometries and localized flow structures. A source-term discretization is derived for nonuniform bottom that balances the discrete flux integral both for still water and in dry regions. This primitive-variable formulation is uniformly valid in wet and dry regions with embedded wetting and drying fronts. A fully nonlinear implicit scheme and both nonlinear and time-linearized explicit schemes are developed for the time integration. The implicit scheme is solved by a parallel Newton-iterative algorithm with numerically computed flux Jacobians. A concise treatment of characteristic-variable boundary conditions with source terms is also given. Computed results obtained for the one-dimensional dam break on wet and dry beds and for normal-mode oscillations in a circular parabolic basin are in very close agreement with the analytical solutions. Other results for a forced breaking wave with friction interacting with a sloped bottom demonstrate a complex wave motion with wetting, drying and multiple interacting wave fronts. Finally, a highly nonuniform, coastline-conforming unstructured grid is used to demonstrate an unsteady simulation that models an artificial coastal flooding due to a forced wave entering the Gulf of Mexico.