Transformation hydrodynamics and the corresponding metamaterials have been proposed as a means to exclude the drag force acting on an object. Here, we report a strategy to deploy the hydrodynamic cloaks in a more practical manner by assembling different-shaped cloaking parts. Our strategy is to first model a square-shaped cloak and a carpet cloak and then combine them to conceal a more complex-shaped space in the three-dimensional hydrodynamic flow. With the derivation of transformation hydrodynamics, the coordinate transformations for each hydrodynamic cloaking are demonstrated with the calculated viscosity tensors. The pressure and velocity fields of the square, triangular (carpet), and exemplary three-dimensional house-shaped cloaks are numerically simulated, thus showing a cloaking effect and reduced drag. This study suggests an efficient way of cloaking complex architectures from fluid-dynamic forces. 相似文献
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.
High temperature oxidation of metals leads to residual stresses both in the metal and in the growing oxide. In this work, the evolution of this residual stresses is theoretically predicted in the growing oxide layers. The origin of these stresses is based on a microstructural model. Using experimental results providing from the oxidation kinetics, and an analysis proposed to describe the growth strain occurring in the thin layers, a set of equations is established allowing determining the stresses evolution with oxidation time. Then, the model is compared with experimental results obtained on both α-Fe and phosphated α-Fe, oxidised at different temperatures. Numerical data are extracted from experiments either with an asymptotic formulation or with an inverse method. These two methods give good agreement with experiments and allow extracting the model parameters. 相似文献
The synergetic effect of corrosion and corrosion induced hydrogen embrittlement damage processes which occur at local scale has been found to result in a dramatic macroscopic tensile ductility loss of the 2024 aluminum alloy. In the present work, the tensile behaviour of corroded 2024 T351 specimens has been estimated on the basis of FE analysis by taking into account the local material properties in the damaged areas. A parametric study is involved to account for the effect of thickness in the results. Calculated tensile properties obtained with the analysis agree well with experimental data. 相似文献
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.
We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.
We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.