The error‐minimization‐based rezone strategy for arbitrary Lagrangian‐Eulerian methods

The objective of the Arbitrary Lagrangian‐Eulerian (ALE) methodology for solving multidimensional fluid flow problems is to move the computational mesh, using the flow as a guide, to improve the robustness, accuracy and efficiency of a simulation. The main elements in the ALE simulation are an explicit Lagrangian phase, a rezone phase in which a new mesh is defined, and a remapping (conservative interpolation) phase, in which the Lagrangian solution is transferred to the new mesh. In most ALE codes, the main goal of the rezone phase is to maintain high quality of the rezoned mesh. In this article, we describe a new rezone strategy which minimizes the L₂ norm of the solution error and maintains smoothness of the mesh. The efficiency of the new method is demonstrated with numerical experiments. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

A 2D Staggered Multi-Material ALE Code Using MOF Interface Reconstruction

Hydrocodes are necessary numerical tools in the fields of implosion and high-velocity impact, which often involve large deformations with changing-topology interfaces. It is very difficult for Lagrangian or Simplified Arbitrary Lagrangian-Eulerian (SALE) codes to tackle these kinds of large-deformation problems, so a staggered Multi-Material ALE (MMALE) code is developed in this paper, which is the explicit time-marching Lagrange plus remap type. We use the Moment Of Fluid (MOF) method to reconstruct the interfaces of multi-material cells and present an adaptive bisection method to search for the global minimum value of the nonlinear objective function. To keep the Lagrangian computations as long as possible, we develop a robust rezoning method named as Combined Rezoning Method (CRM) to generate the convex, smooth grids for the large-deformation domain. Regarding the staggered remap phase, we use two methods to remap the variables of Lagrangian mesh to the rezoned one. One is the first-order intersection-based remapping method that doesn't limit the distances between the rezoned and Lagrangian meshes, so it can be used in the applications of wide scope. The other one is the conservative second-order flux-based remapping method developed by Kucharika and Shashkov [22] that requires the rezoned element to locate in its adjacent old elements. Numerical results of triple point problem show that the result of first-order remapping method using ALE computations is gradually convergent to that of second-order remapping method using Eulerian computations with the decrease of rezoning, thereby telling us that MMALE computations should be performed as few as possible to reduce the errors of the interface reconstruction and the remapping. Numerical results provide a clear evidence of the robustness and the accuracy of this MMALE scheme, and that our MMALE code is powerful for the large-deformation problems.     

Polynomial discrepancy of sequences

Generalizing E. Hlawka's concept of polynomial discrepancy we introduce a similar concept for sequences in the unit cube and on the sphere. We investigate the relation of this polynomial discrepancy to the usual discrepancy and obtain lower and upper bounds. In a final section some computational results are established.     

The hyperbolic mean curvature flow

We introduce a geometric evolution equation of hyperbolic type, which governs the evolution of a hypersurface moving in the direction of its mean curvature vector. The flow stems from a geometrically natural action containing kinetic and internal energy terms. As the mean curvature of the hypersurface is the main driving factor, we refer to this model as the hyperbolic mean curvature flow (HMCF). The case that the initial velocity field is normal to the hypersurface is of particular interest: this property is preserved during the evolution and gives rise to a comparatively simpler evolution equation. We also consider the case where the manifold can be viewed as a graph over a fixed manifold. Our main results are as follows. First, we derive several balance laws satisfied by the hypersurface during the evolution. Second, we establish that the initial-value problem is locally well-posed in Sobolev spaces; this is achieved by exhibiting a convexity property satisfied by the energy density which is naturally associated with the flow. Third, we provide some criteria ensuring that the flow will blow-up in finite time. Fourth, in the case of graphs, we introduce a concept of weak solutions suitably restricted by an entropy inequality, and we prove that a classical solution is unique in the larger class of entropy solutions. In the special case of one-dimensional graphs, a global-in-time existence result is established.     

The hyperbolic mean curvature flow

We introduce a geometric evolution equation of hyperbolic type, which governs the evolution of a hypersurface moving in the direction of its mean curvature vector. The flow stems from a geometrically natural action containing kinetic and internal energy terms. As the mean curvature of the hypersurface is the main driving factor, we refer to this model as the hyperbolic mean curvature flow (HMCF). The case that the initial velocity field is normal to the hypersurface is of particular interest: this property is preserved during the evolution and gives rise to a comparatively simpler evolution equation. We also consider the case where the manifold can be viewed as a graph over a fixed manifold. Our main results are as follows. First, we derive several balance laws satisfied by the hypersurface during the evolution. Second, we establish that the initial-value problem is locally well-posed in Sobolev spaces; this is achieved by exhibiting a convexity property satisfied by the energy density which is naturally associated with the flow. Third, we provide some criteria ensuring that the flow will blow-up in finite time. Fourth, in the case of graphs, we introduce a concept of weak solutions suitably restricted by an entropy inequality, and we prove that a classical solution is unique in the larger class of entropy solutions. In the special case of one-dimensional graphs, a global-in-time existence result is established.     

The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks

In this paper, we introduce a new optimization problem, the Minimum Cost Hop-and-root Constrained Forest Problem, which arises in the design of energy efficient Wireless Sensor Networks. An Integer Program, a heuristic solution approach and computational experiments with the proposed models and algorithms are presented.     

A Cross-Entropy Approach to the Estimation of Generalized Linear Multilevel Models

In this article, we use the cross-entropy method for noisy optimization for fitting generalized linear multilevel models through maximum likelihood. We propose specifications of the instrumental distributions for positive and bounded parameters that improve the computational performance. We also introduce a new stopping criterion, which has the advantage of being problem-independent. In a second step we find, by means of extensive Monte Carlo experiments, the most suitable values of the input parameters of the algorithm. Finally, we compare the method to the benchmark estimation technique based on numerical integration. The cross-entropy approach turns out to be preferable from both the statistical and the computational point of view. In the last part of the article, the method is used to model the probability of firm exits in the healthcare industry in Italy. Supplemental materials are available online.     

The small anisotropy formulation of elastic deformation

The specific internal energy defines the constitutive relation (stress-strain function) in elastic deformations. We introduce a form for the specific internal energy that expresses the idea of small anisotropy. In this formulation, only one parameter is needed to specify the anisotropic part of the deformation.Supported in part by AFOSR-88-0025.     

Computing arbitrary Lagrangian Eulerian maps for evolving surfaces

The good mesh quality of a discretized closed evolving surface is often compromised during time evolution. In recent years this phenomenon has been theoretically addressed in a few ways, one of them uses arbitrary Lagrangian Eulerian (ALE) maps. However, the numerical computation of such maps still remained an unsolved problem in the literature. An approach, using differential algebraic problems, is proposed here to numerically compute an arbitrary Lagrangian Eulerian map, which preserves the mesh properties over time. The ALE velocity is obtained by finding an equilibrium of a simple spring system, based on the connectivity of the nodes in the mesh. We also consider the algorithmic question of constructing acute surface meshes. We present various numerical experiments illustrating the good properties of the obtained meshes and the low computational cost of the proposed approach.     

A new computational approach for solving optimal control of linear PDEs problem

In this paper, we present a new computational approach for solving an internal optimal control problem, which is governed by a linear parabolic partial differential equation. Our approach is to approximate the PDE problem by a nonhomogeneous ordinary differential equation system in higher dimension. Then, the homogeneous part of ODES is solved using semigroup theory. In the next step, the convergence of this approach is verified by means of Toeplitz matrix. In the rest of the paper, the optimal control problem is solved by utilizing the solution of homogeneous part. Finally, a numerical example is given.     

Diffuse Interface Methods for Multiple Phase Materials: An Energetic Variational Approach

In this paper, we introduce a diffuse interface model for describing the dynamics of mixtures involving multiple (two or more) phases. The coupled hydrodynamical system is derived through an energetic variational approach. The total energy of the system includes the kinetic energy and the mixing (interfacial) energies. The least action principle (or the principle of virtual work) is applied to derive the conservative part of the dynamics, with a focus on the reversible part of the stress tensor arising from the mixing energies. The dissipative part of the dynamics is then introduced through a dissipation function in the energy law, in line with Onsager's principle of maximum dissipation. The final system, formed by a set of coupled time-dependent partial differential equations, reflects a balance among various conservative and dissipative forces and governs the evolution of velocity and phase fields. To demonstrate the applicability of the proposed model, a few two-dimensional simulations have been carried out, including (1) the force balance at the three-phase contact line in equilibrium, (2) a rising bubble penetrating a fluid-fluid interface, and (3) a solid particle falling in a binary fluid. The effects of slip at solid surface have been examined in connection with contact line motion and a pinch-off phenomenon.     

The mathematical model and optimistic algorithm of two protein structures alignment

Protein structure alignment is one of the most important computational problems in molecular biology. From the viewpoint of computational complexity, a pairwise structure alignment is a NP-hard problem. In this paper, based on the discrepancy of two proteins, we define the structure alignment as a mixed integer-programming (MIP) problem with the simpler form and prove the existence of optimal solution. The optimal alignment is achieved by incorporating improved complete information set method used to modify the score matrix into iterative double dynamic programming algorithm. Convergence of algorithm is proved. A number of benchmark examples are tested. The results show that our model and approach are general and improve computational efficiency as well as quality of the structure alignment.     

Formulation and survey of ALE method in nonlinear solid mechanics

This paper investigates the applicability and accuracy of existing formulation methods in general purpose finite element programs to the finite strain deformation problems. The basic shortcomings in using such programs in these applications are then pointed out and the need for a different type of formulation is discussed. An arbitrary Lagrangian-Eulerian (ALE) method is proposed and a concise survey of ALE formulation is given. A consistent and complete ALE formulation is derived from the virtual work equation transformed to arbitrary computational reference configurations. Differences between the proposed formulations and similar ones in the literature are discussed. The proposed formulation presents a general approach to ALE method. It includes load correction terms and is suitable for rate-dependent and rate-independent material constitutive law. The proposed formulation reduces to both updated Lagrangian and Eulerian formulations as special cases.     

Multigrid fictitious boundary and grid deformation methods for flow-induced rotation of wing

Numerical simulations of flow-induced rotation of wing by multigrid fictitious boundary and grid deformation methods are presented. The flow is computed by a special ALE formulation with a multigrid finite element solver. The solid wing is allowed to move freely through the computational mesh which is adaptively aligned by a special mesh deformation method. The advantage of this approach is that no expensive remeshing has to be performed. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An eigenvalue search method using the Orr–Sommerfeld equation for shear flow

A physically-based computational technique was investigated which is intended to estimate an initial guess for complex values of the wavenumber of a disturbance leading to the solution of the fourth-order Orr–Sommerfeld (O–S) equation. The complex wavenumbers, or eigenvalues, were associated with the stability characteristics of a semi-infinite shear flow represented by a hyperbolic-tangent function. This study was devoted to the examination of unstable flow assuming a spatially growing disturbance and is predicated on the fact that flow instability is correlated with elevated levels of perturbation kinetic energy per unit mass. A MATLAB computer program was developed such that the computational domain was selected to be in quadrant IV, where the real part of the wavenumber is positive and the imaginary part is negative to establish the conditions for unstable flow. For a given Reynolds number and disturbance wave speed, the perturbation kinetic energy per unit mass was computed at various node points in the selected subdomain of the complex plane. The initial guess for the complex wavenumber to start the solution process was assumed to be associated with the highest calculated perturbation kinetic energy per unit mass. Once the initial guess had been approximated, it was used to obtain the solution to the O–S equation by performing a Runge–Kutta integration scheme that computationally marched from the far field region in the shear layer down to the lower solid boundary. Results compared favorably with the stability characteristics obtained from an earlier study for semi-infinite Blasius flow over a flat boundary.     

A new model of Saint Venant and Savage–Hutter type for gravity driven shallow water flows

We introduce a new model for shallow water flows with non-flat bottom. A prototype is the Saint Venant equation for rivers and coastal areas, which is valid for small slopes. An improved model, due to Savage–Hutter, is valid for small slope variations. We introduce a new model which relaxes all restrictions on the topography. Moreover it satisfies the properties (i) to provide an energy dissipation inequality, (ii) to be an exact hydrostatic solution of Euler equations. The difficulty we overcome here is the normal dependence of the velocity field, that we are able to establish exactly. Applications we have in mind concern, in particular, computational aspects of flows of granular material (for example in debris avalanches) where such models are especially relevant. To cite this article: F. Bouchut et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

On some integral-consistent methods for calculating magnetohydrodynamic phenomena in problems of computational astrophysics

When constructing difference schemes for calculating complex problems of computational astrophysics considering magnetohydrodynamic and gravitational phenomena, the processes of matter overcompression (with a change in density by several orders of magnitude) should be taken into account, and it is important at a discrete level to take into account the corresponding energy transformations of magnetohydrodynamic, gravitational, kinetic, and internal energy during the evolution of a star. This problem is solved by constructing completely conservative difference schemes in a view of these magnetohydrodynamic processes and self-gravitating phenomena. In this work, to study and apply the difference methods for solving problems of magnetic gas dynamics, a discrete representation of symmetrized spatial deformations of the medium was obtained. The representation is consistent with changes in the magnetic, kinetic, and internal energies and does not lead to their distortions when the matter is overcompressed.     

Dynamic modeling of a Stewart platform using the generalized momentum approach

Dynamic modeling of parallel manipulators presents an inherent complexity, mainly due to system closed-loop structure and kinematic constraints.In this paper, an approach based on the manipulator generalized momentum is explored and applied to the dynamic modeling of a Stewart platform. The generalized momentum is used to compute the kinetic component of the generalized force acting on each manipulator rigid body. Analytic expressions for the rigid bodies inertia and Coriolis and centripetal terms matrices are obtained, which can be added, as they are expressed in the same frame. Gravitational part of the generalized force is obtained using the manipulator potential energy. The computational load of the dynamic model is evaluated, measured by the number of arithmetic operations involved in the computation of the inertia and Coriolis and centripetal terms matrices. It is shown the model obtained using the proposed approach presents a low computational load. This could be an important advantage if fast simulation or model-based real-time control are envisaged.     

R-Adaptive Reconnection-Based Arbitrary Lagrangian Eulerian Method-R-ReALE

We present a new R-adaptive Arbitrary Lagrangian Eulerian (ALE) method, based on the reconnection-based ALE - ReALE methodology [5, 41, 42]. The main elements in a standard ReALE method are: an explicit Lagrangian phase on an arbitrary polygonal (in 2D) mesh, followed by a rezoning phase in which a new grid is defined, and a remapping phase in which the Lagrangian solution is transferred onto the new grid. The rezoned mesh is smoothed by using one or several steps toward centroidal Voronoi tessellation, but it is not adapted to the solution in any way. We present a new R-adaptive ReALE method (R-ReALE, where R stands for Relocation). The new method is based on the following design principles. First, a monitor function (or error indicator) based on Hessian of some flow parameter(s), is utilized. Second, the new algorithm uses the equidistribution principle with respect to the monitor function as criterion for defining an adaptive mesh. Third, centroidal Voronoi tessellation is used for the construction of the adaptive mesh. Fourth, we modify the raw monitor function (scale it to avoid extremely small and large cells and smooth it to create a smooth mesh), in order to utilize theoretical results related to centroidal Voronoi tessellation. In the R-ReALE method, the number of mesh cells is chosen at the beginning of the calculation and does not change with time, but the mesh is adapted according to the modified monitor function during the rezone stage at each time step. We present all details required for implementation of the new adaptive R-ReALE method and demonstrate its performance relative to standard ReALE method on a series of numerical examples.     

Scheduling tests in automotive R&D projects

In automotive R&D projects a major part of development cost is caused by tests which utilize expensive experimental vehicles. In this paper, we introduce an approach for scheduling the individual tests such that the number of required experimental vehicles is minimized. The proposed approach is based on a new type of multi-mode resource-constrained project scheduling model with minimum and maximum time lags as well as renewable and cumulative resources. We propose a MILP formulation, which is solvable for small problem instances, as well as several variants of a priority-rule based method that serve to solve large problem instances. The developed solution methods are examined in a comprehensive computational study. For a real-world problem instance it is shown that the introduced approach may enhance the current methods applied in practice.