Mapping Closure Approximation for Reactive Scalars in Random Flows

The Mapping Closure Approximation (MCA) approach is developed to describe the statistics of both conserved and reactive scalars in random flows. The statistics include Probability Density Function (PDF), Conditional Dissipation Rate (CDR) and Conditional Laplacian (CL). The statistical quantities are calculated using the MCA and compared with the results of the Direct Numerical Simulation (DNS). The results obtained from the MCA are in agreement with those from the DNS. It is shown that the MCA approach can predict the statistics of reactive scalars in random flows.

Optimal bounded control of first-passage failure of quasi-integrable Hamiltonian systems with wide-band random excitation

The optimal bounded control of quasi-integrable Hamiltonian systems with wide-band random excitation for minimizing their first-passage failure is investigated. First, a stochastic averaging method for multi-degrees-of-freedom (MDOF) strongly nonlinear quasi-integrable Hamiltonian systems with wide-band stationary random excitations using generalized harmonic functions is proposed. Then, the dynamical programming equations and their associated boundary and final time conditions for the control problems of maximizinig reliability and maximizing mean first-passage time are formulated based on the averaged It$\ddot{\rm o}$ equations by applying the dynamical programming principle. The optimal control law is derived from the dynamical programming equations and control constraints. The relationship between the dynamical programming equations and the backward Kolmogorov equation for the conditional reliability function and the Pontryagin equation for the conditional mean first-passage time of optimally controlled system is discussed. Finally, the conditional reliability function, the conditional probability density and mean of first-passage time of an optimally controlled system are obtained by solving the backward Kolmogorov equation and Pontryagin equation. The application of the proposed procedure and effectiveness of control strategy are illustrated with an example.

Study on current-random wave forces acting on a framework

The forces of random wave plus current acting on a simplified offshore platform (jacket) model have been studied numerically and experimentally. The numerical results are in good agreement with experiments. The mean force can be approximated as a function of equivalent velocity parameter and the root-mean-square force as a function of equivalent significant wave height parameter.

Planar Thermocapillary Migration of Two Bubbles in Microgravity Environment

A theoretical investigation is performed on the thermocapillary motion of two bubbles in arbitrary configuration in microgravity environment under the assumption that the surface tension is high enough to keep the bubbles spherical. The two bubbles are dr

Flows with Inertia in a Three-Dimensional Random Fiber Network

A fiber web is modeled as a three-dimensional random cylindrical fiber network. Nonlinear behavior of fluid flowing through the fiber network is numerically simulated by using the lattice Boltzmann (LB) method. A nonlinear relationship between the friction factor and the modified Reynolds number is clearly observed and analyzed by using the Fochheimer equation, which includes the quadratic term of velocity. We obtain a transition from linear to nonlinear region when the Reynolds numbers are sufficiently high, reflecting the inertial effect of the flows. The simulated permeability of such fiber network has relatively good agreement with the experimental results and finite element simulations.

Computer Simulation Of Random Sphere Packing In An Arbitrarily Shaped Container

Most simulations of random sphere packing concern a cubic or cylindric container with periodic boundary, containers of other shapes are rarely studied. In this paper, a new relaxation algorithm with pre-expanding procedure for random sphere packing in an arbitrarily shaped container is presented. Boundaries of the container are simulated by overlapping spheres which covers the boundary surface of the container. We find 0.4 similar to 0.6 of the overlap rate is a proper value for boundary spheres. The algorithm begins with a random distribution of small internal spheres. Then the expansion and relaxation procedures are performed alternately to increase the packing density. The pre-expanding procedure stops when the packing density of internal spheres reaches a preset value. Following the pre-expanding procedure, the relaxation and shrinking iterations are carried out alternately to reduce the overlaps of internal spheres. The pre-expanding procedure avoids the overflow problem and gives a uniform distribution of initial spheres. Efficiency of the algorithm is increased with the cubic cell background system and double link data structure. Examples show the packing results agree well with both computational and experimental results. Packing density about 0.63 is obtained by the algorithm for random sphere packing in containers of various shapes.