Search NASA⌕ Search

Engineering topics

Shashkov, Mikhail

Publications and source records attributed to Shashkov, Mikhail.

At least 19 records

An adaptive moments-based interface reconstruction using intersection of the cell with one half-plane, two half-planes and a circle

We present a new adaptive moment-of-fluid (A-MOF) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to construct a shape that approximates the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The adaptive method chooses between shapes obtained by the intersection of the cell with one half-plane, two half-planes, or a circle. The A-MOF method allows to exactly reproduce several convex shapes: corners, filaments, and their concave cell-complements; as well as pieces of the circles and its cell-compliments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. In conclusion, we present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on the entire mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A positivity-preserving and conservative intersection-distribution-based remapping algorithm for staggered ALE hydrodynamics on arbitrary meshes

In this study, we introduce new intersection-distribution-based remapping tools for indirect staggered arbitrary Lagrangian-Eulerian (ALE) simulations of multi-material shock hydrodynamics on arbitrary meshes. In addition to conserving momentum and total energy, the three-stage remapper proposed in this work preserves non-negativity of the internal energy. At the first stage, we construct slope-limited piecewise-linear reconstructions of all conserved quantities on zones of the source mesh and perform intersection-based remap to obtain bound-preserving zonal quantities on the target mesh. At the second stage, we define bound-preserving nodal quantities of the staggered ALE discretization as convex combinations of corner quantities. The nodal internal energy is corrected in a way which keeps it non-negative, while providing exact conservation of total energy. At the final stage, we distribute the non-negative nodal internal energy to corners, zones and materials using non-negative weights. Proofs of positivity preservation are provided for each stage. This work is a natural extension of our paper [14] in which a similar intersection-distribution-based remapping procedure was employed. The original version used a nodal kinetic energy fix which did not provably ensure positivity preservation for the zonal internal energy after the final distribution stage. The new algorithm cures this potential drawback by using ‘coordinated’ limiters for piecewise-linear reconstructions, remapping the internal energy to nodes and correcting it before redistribution. The effectiveness of the new nodal fix is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗

Constrained optimization framework for interface-aware sub-scale dynamics discrete closure model for multimaterial cells in Lagrangian cell-centered hydrodynamics

In this paper, we present the new discrete optimization-based interface-aware sub-scale dynamics (IA-SSD) closure model for multimaterial cells for Lagrangian cell-centered hydrodynamics. For the multimaterial cell, the kinematic and thermodynamic properties (e.g., velocity, density, pressure and internal energy) will typically vary between the materials. The discrete closure model is responsible for an accurate update of the thermodynamic states of the individual material components in the multimaterial cell, and for determining the nodal forces that move the vertices of the cell. The IA-SSD closure model consists of two stages — a bulk stage followed by a sub-scale stage. During the bulk stage, the total change in the volume of the cell, total force applied to the cell, and total work done on the cell are distributed between the materials to update their volume, velocity and total energy. This distribution is performed using volume fractions of the materials. During the second stage, sub-scale interactions of the materials inside the multimaterial cell are taken into account. At this stage, information about the topology of the materials inside the multimaterial cell is used, allowing the orientations of internal interfaces to be included in the model. Each material interacts in a pair-wise fashion with the materials with which it has a common boundary. The interactions are based on the solution of the acoustic Riemann problem between each pair of materials and are limited using physically justified constraints: positivity of volume, positivity of internal energy, and controlled rate of pressure relaxation. To determine the values of the limiter coefficients, a constrained-optimization framework is employed using a quadratic objective function with linear constraints. It is a first-of-its kind application of constrained optimization to develop discrete closure models in a more rigorous fashion. The pair-wise interaction between materials is essentially one dimensional in the direction that is normal to interface. Finally, for this reason, we demonstrate in this paper the performance of our new model on one dimensional numerical examples.

97 MATHEMATICS AND COMPUTING↗

Constrained optimization framework for interface-aware sub-scale dynamics models for voids closure in Lagrangian hydrodynamics

In hydrocodes, voids are used to represent vacuum and model free boundaries between vacuum and real materials. We give a systematic description of a new treatment of void closure in the framework of the multimaterial arbitrary Lagrangian–Eulerian (ALE) methods. This includes a new formulation of the interface-aware sub-scale-dynamics (IA-SSD) closure model for multimaterial cells with voids, which is used in the Lagrangian stage of our indirect ALE scheme. The results of the comprehensive testing of the new model are presented for one- and two-dimensional multimaterial calculations in the presence of voids. Finally, we also present a sneak peek of a realistic shaped charge calculation in the presence of voids and solids.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate static condensation algorithm for solving multi-material diffusion problems on meshes non-aligned with material interfaces

In this study, we describe a new algorithm for solving multi-material diffusion problem when material interfaces are not aligned with the mesh. In this case interface reconstruction methods are used to construct approximate representation of interfaces between materials. They produce so-called multi-material cells, in which materials are represented by material polygons that contain only one material. The reconstructed interface is not continuous between cells. Finally, we suggest the new method for solving multi-material diffusion problems on such meshes and compare its performance with known homogenization methods.

36 MATERIALS SCIENCE↗

Local Error Analysis and Comparison of the Swept- and Intersection-Based Remapping Methods

Abstract In this paper, the numerical error of two widely used methods for remapping of discrete quantities from one computational mesh to another is investigated. We compare the intuitive, but resource intensive method utilizing intersections of computational cells with the faster and simpler swept-region-based method. Both algorithms are formally second order accurate, however, they are known to produce slightly different quantity profiles in practical applications. The second-order estimate of the error formula is constructed algebraically for both algorithms so that their local accuracy can be evaluated. This general estimate is then used to assess the dependence of the performance of both methods on parameters such as the second derivatives of the remapped distribution, mesh geometry or mesh movement. Due to the complexity of such analysis, it is performed on a set of simplified elementary mesh patterns such as cell corner expansion, rotation or shear. On selected numerical tests it is demonstrated that the swept-based method can distort a symmetric quantity distribution more substantially than the intersection-based approach when the computational mesh moves in an unsuitable direction.

Klima, Matej↗

Divergence preserving reconstruction of the nodal components of a vector field from its normal components to edges

We have developed a new divergence preserving method for the reconstruction of the Cartesian components of a vector field from the orthogonal projection of a vector field to the normals to edges in two dimensional. In this method, discrete divergences computed from the nodal components and from the normal ones are exactly the same. Our new method consists of two stages. At the first stage, we use an extended version of the local procedure described in [J. Comput. Phys., 139:406–409, 1998] to obtain a ‘reference’ nodal vector. This local procedure is exact for linear vector fields; however, the discrete divergence is not preserved. Then, we formulate a constrained optimization problem, in which this reference vector plays the role of a target, and the divergence constraints are enforced by using Lagrange multipliers. It leads to the solution of ‘elliptic’ like discrete equations for the cell-centered Lagrange multipliers. The new global divergence preserving method is exact for linear vector fields. Here in this paper, we describe all details of our new method and present numerical results, which confirm our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The mimetic finite difference method for elliptic and parabolic problems with a staggered discretization of diffusion coefficient

Numerical schemes for nonlinear parabolic equations based on the harmonic averaging of cell-centered diffusion coefficients break down when some of these coefficients go to zero or their ratio grows. To tackle this problem, we propose new mimetic finite difference schemes that use a staggered discretization of the diffusion coefficient. The primary mimetic operator approximates div (k•); the derived (dual) mimetic operator approximates - ∇(•). The new mimetic schemes preserve symmetry and positive-definiteness of the continuum problem which allows us to use algebraic solvers with optimal complexity. We perform detailed numerical analysis of the new schemes for linear elliptic problems and a specially designed linear parabolic problem that has solution dynamics typical for nonlinear problems. We also show that the new schemes are competitive with the state-of-the-art schemes for steady-state problems but provide much more accurate solution dynamics for the transient problem.

97 MATHEMATICS AND COMPUTING↗

Adaptive reconnection-based arbitrary Lagrangian Eulerian method

We present a new adaptive Arbitrary Lagrangian Eulerian (ALE) method. This method is based on the reconnection-based ALE (ReALE) methodology of Refs. [35], [34] and [6]. The main elements in a standard ReALE method are: an explicit Lagrangian phase on an arbitrary polygonal (in 2D) mesh in which the solution and positions of grid nodes are updated; a rezoning phase in which a new grid is defined by changing the connectivity (using Voronoi tessellation) but not the number of cells; and a remapping phase in which the Lagrangian solution is transferred onto the new grid. Furthermore, in the standard ReALE method, 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.

97 MATHEMATICS AND COMPUTING↗

Filament capturing with the Multimaterial Moment-of-Fluid method

A novel method for capturing two-dimensional, thin, under-resolved material configurations, known as “filaments,” is presented in the context of interface reconstruction. This technique uses a partitioning procedure to detect disconnected regions of material in the advective preimage of a cell (indicative of a filament) and makes use of the existing functionality of the Multimaterial Moment-of-Fluid interface reconstruction method to accurately capture the under-resolved feature, while exactly conserving volume. An algorithm for Adaptive Mesh Refinement in the presence of filaments is developed so that refinement is introduced only near the tips of filaments and where the Moment-of-Fluid reconstruction error is still large. Comparison to the standard Moment-of-Fluid method is made. It is demonstrated that using filament capturing at a given resolution yields gains in accuracy comparable to introducing an additional level of mesh refinement at significantly lower cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A framework for developing a mimetic tensor artificial viscosity for Lagrangian hydrocodes on arbitrary polygonal and polyhedral meshes (u)

We construct a new mimetic tensor artificial viscosity on general polygonal and polyhedral meshes. The tensor artificial viscosity is based on a mimetic discretization of coordinate invariant operators, divergence of a tensor and gradient of a vector. The focus of this paper is on the symmetric form, div ({mu},{var_epsilon}(u)), of the tensor artificial viscosity where {var_epsilon}(u) is the symmetrized gradient of u and {mu}, is a tensor. The mimetic discretizations of this operator is derived for the case of a full tensor coefficient {mu}, that may reflect a shock direction. We demonstrate performance of the new viscosity for the Noh implosion, Sedov explosion and Saltzman piston problems in both Cartesian and axisymmetric coordinate systems.

99 GENERAL AND MISCELLANEOUS↗