Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “arbitrary meshes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

3D mesh regularization within an ALE code using a weighted line sweeping method

The Lagrangian formalism is widely used to simulate hydrodynamic responses in complex engineering applications, particularly those involving strong shock waves. However, as the mesh moves with the fluid, it can become highly distorted, requiring a regularization step. This involves constructing a new grid and remapping conservative quantities onto it to restore mesh quality. This work introduces a regularization method for block-structured meshes within a 3D ALE (Arbitrary Lagrangian-Eulerian) code. The proposed approach prevents mesh tangling while preserving the anisotropic features of the initial Lagrangian mesh. This regularization technique incorporates aspect ratio-based weights to control mesh smoothing. Unlike uniform rezoning techniques, this weighted approach maintains proximity to the Lagrangian mesh while improving mesh quality. Here, the method effectively handles concave geometries by mitigating the grid attraction phenomenon, which typically leads to mesh concentration along concave edges. Numerical experiments demonstrate its efficiency in regularizing severely deformed meshes, and its integration within the ALE framework is validated on challenging hydrodynamic test cases, including the triple point problem.

42 ENGINEERING↗

An FEM-Based Peridynamic Model for Failure Analysis of Unidirectional Fiber-Reinforced Laminates

To predict the mixed damage modes of unidirectional fiber-reinforced polymer (FRP) laminates under dynamic loading, an FEM-based peridynamic model is introduced in this paper. Based on its geometric structure and material composition, a long fiber lamina is considered a transversely isotropic medium as a result of homogenization at the meso-scale. The laminated structure is modeled by stacking surface mesh layers with arbitrary fiber angles along the thickness direction. The peridynamic bonds between Gauss points connect the separated elements. These bonds are classified as inner-layer bonds and inter-layer bonds. To represent the anisotropy of a laminate, the micro-elastic modulus of the inner-layer and inter-layer bonds is calculated from the anisotropic engineering material constants separately. To capture complex failure behaviors of laminate structures, an empirical damage model is proposed for the tension/ compression breakage of peridynamic bonds. This damage model can control the in-plane and delamination failure process. Finally, benchmark tests are conducted to validate the elastic response of laminates under dynamic loading. In terms of damage analysis, the proposed model can capture the complex damage modes and resistive force of laminate structures.

36 MATERIALS SCIENCE↗

SOMAFOAM: An OpenFOAM based solver for continuum simulations of low-temperature plasmas

Here, we report the development of SOMAFOAM, a finite volume framework for performing continuum simulations of low-temperature plasmas. The primary goal of this work is to discuss the features of SOMAFOAM along with representative results provided as examples for a range of operating conditions and geometries. This includes plasma and plasma–dielectric systems operating in direct current, radio frequency, and microwave regimes from pressures as low as 100 mTorr to atmospheric pressure. The code has several useful features including the ability to run massively parallel simulations using arbitrary geometries, structured/unstructured meshes, choice of models such as drift–diffusion/full-momentum at runtime, and species-dependent timesteps to name a few. The verification/validation studies presented include comparison with previously published continuum simulations (low-pressure direct current and radio frequency plasma), with experiments (Gaseous Electronics Conference Reference Cell and microwave microplasma ignited in a split ring resonator), and previously published kinetic simulations (low-pressure radio frequency plasma). Other examples provided include a direct current atmospheric pressure microplasma bounded by dielectric sidewalls and a helium–nitrogen plasma ignited using a needle electrode facing a dielectric. The performance of the code is also discussed with serial and distributed memory parallel runs demonstrated up to 512 cores. The design and implementation of the code in a modular object-oriented framework allows for easy extension and seamless coupling with other codes and can be expected to play an important role in both academia and industry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational, stable, and self-consistent coupling of 3D electromagnetics to 1D transmission lines in the time domain

This work presents a new multiscale method for coupling the 3D Maxwell's equations to the 1D telegrapher's equations. While Maxwell's equations are appropriate for modeling complex electromagnetics in arbitrary-geometry domains, simulation cost for many applications (e.g. pulsed power) can be dramatically reduced by representing less complex transmission line regions of the domain with a 1D model. By assuming a transverse electromagnetic (TEM) ansatz for the solution in a transmission line region, we reduce the Maxwell's equations to the telegrapher's equations. Here, we propose a self-consistent finite element formulation of the fully coupled system that uses boundary integrals to couple between the 3D and 1D domains and supports arbitrary unstructured 3D meshes. Additionally, by using a Lagrange multiplier to enforce continuity at the coupling interface, we allow for an absorbing boundary condition to also be applied to non-TEM modes on this boundary. We demonstrate that this feature reduces non-physical reflection and ringing of non-TEM modes off of the coupling boundary. By employing implicit time integration, we ensure a stable coupling, and we introduce an efficient method for solving the resulting linear systems. We demonstrate the accuracy of the new method on two verification problems, a transient O-wave in a rectilinear prism and a steady-state problem in a coaxial geometry, and show the efficiency and weak scalability of our implementation on a cold test of the Z-machine MITL and post-hole convolute.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Framework for Compressing Unstructured Scientific Data via Serialization

We present a general framework for compressing unstructured scientific data with known local connectivity. A common application is simulation data defined on arbitrary finite element meshes. The framework employs a greedy topology preserving reordering of original nodes which allows for seamless integration into existing data processing pipelines. This reordering process depends solely on mesh connectivity and can be performed offline for optimal efficiency. However, the algorithm’s greedy nature also supports on-the-fly implementation. The proposed method is compatible with any compression algorithm that leverages spatial correlations within the data. The effectiveness of this approach is demonstrated on a large-scale real dataset using several compression methods, including MGARD, SZ, and ZFP.

Reshniak, Viktor [ORNL] (ORCID:0000000315454462)↗

Rotational symmetry relation for efficient response function generation in the coarse mesh transport method COMET

The coarse mesh transport code COMET is a continuous energy hybrid stochastic-deterministic neutronics solver with high fidelity and formidable computation speed in solving reactor core problems. Its method is based on the incident flux expansion theory. In this work, we take advantage of the local geometric symmetry in many reactor cores lattices (e.g., fuel lattices and reflector blocks) to develop relations among the flux response expansion coefficients for symmetric surfaces to further improve the computational efficiency of the COMET response function generation tool (method). This is done by a rigorous derivation of the transformation matrices for the angular and spatial expansion moments resulting from a rotation of a coarse mesh by an arbitrary angle. The relations for the response coefficients for the symmetric surfaces can be then written as the Kronecker product of those transformation matrices. The method is implemented into COMET and tested on two advanced high temperature reactor (AHTR) full-length single assembly benchmark problems. The COMET results using the response function library based on the symmetry relations were compared to those using the library directly generated by continuous energy Monte Carlo for all surfaces. It was found that the eigenvalues and stripe-wise fission densities using the two libraries are in statistical agreement as expected. This indicates that the new method maintains the high fidelity of the original COMET method while improving the computational efficiency in the response function generation by 270% to 400%, depending on the local geometric symmetry. This method also reduces the size of the response function library by the same magnitude (270% to 400%). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part II: linesweep ALE rezoning for nonconformal block-structured AMR meshes

The simulation of flows presenting contact discontinuities, vorticity, and large variations in spatial scales can be performed in a framework coupling Arbitrary Lagrangian Eulerian (ALE) algorithms and Adaptive Mesh Refinement (AMR). This coupling requires adaptation of ALE rezoning techniques to meshes containing nonconformal nodes arising from both the AMR topology and the junction of mesh blocks. Here, in this paper, we present an ALE rezoning strategy that is compatible with such meshes, and that can also act as a disentangling algorithm. Emphasis is put on an algorithm that respects intrinsic Lagrangian mesh properties in order to preserve accuracy around discontinuities. To that end, we adapt the weighted linesweep algorithm to nonconformal block-structured AMR meshes. Then, we present control parameters introduced in the method for it to be applicable in practical situations. Notably, the method is coupled to a specific metric optimization in order to palliate some shortcomings of the linesweep method. Finally, numerical test cases are presented that feature the capabilities of the ALE-AMR algorithm for flows that present discontinuities, vorticity, and a variety of scales. Notably, we show that our ALE-AMR algorithm gives results at least similar to Euler-AMR, but provides better accuracy in cases where discontinuities are involved, thanks to a method that respects the Lagrangian features of the mesh. Additionally, it enables Euler-AMR-like computations on domains with temporally varying domain boundaries.

Adaptive mesh refinement↗

A conservative implicit-PIC scheme for the hybrid kinetic-ion fluid-electron plasma model on curvilinear meshes

We report that the hybrid kinetic-ion fluid-electron plasma model is widely used to study challenging multi-scale problems in space and laboratory plasma physics. Here, a novel conservative scheme for this model employing implicit particle-in-cell techniques is extended to arbitrary coordinate systems via curvilinear maps from logical to physical space. The scheme features a fully non-linear electromagnetic formulation with a multi-rate time advance - including sub-cycling and orbit-averaging for the kinetic ions. By careful choice of compatible particle-based kinetic-ion and mesh-based fluid-electron discretizations in curvilinear coordinates, as well as particle-mesh interpolations and implicit midpoint time advance, the scheme is proven to conserve total energy for arbitrary curvilinear meshes. In the electrostatic limit, the method is also proven to conserve total momentum for arbitrary curvilinear meshes. Although momentum is not conserved for arbitrary curvilinear meshes in the electromagnetic case, it is for an important subset of Cartesian tensor-packed meshes. The scheme and its novel conservation properties are demonstrated for several challenging numerical problems using different curvilinear meshes, including a merging flux-rope simulation for a space weather application, and a helical m = 1 mode simulation for magnetic fusion energy application.

97 MATHEMATICS AND COMPUTING↗

Numerical integration in the virtual element method with the scaled boundary cubature scheme

Abstract The virtual element method (VEM) is a stabilized Galerkin method on meshes that consist of arbitrary (convex and nonconvex) polygonal and polyhedral elements. A crucial ingredient in the implementation of low‐ and high‐order VEM is the numerical integration of monomials and nonpolynomial functions over such elements. In this article, we apply the recently proposed scaled boundary cubature (SBC) scheme to compute the weak form integrals in various virtual element formulations over polygonal and polyhedral meshes. In doing so, we demonstrate the flexibility of the approach and the accuracy that it delivers on a broad suite of boundary‐value problems in 2D and 3D over polytopes with affine faces as well as on elements with curved boundaries. In addition, the use of the SBC scheme is exemplified in an enriched Poisson formulation of the VEM in which weakly singular functions are required to be integrated. This study establishes the SBC method as a simple, accurate and efficient integration scheme for use in the VEM.

Chin, Eric B.↗

Thirty years at LANL - case study [Slides]

Outline: Different perspective on interface reconstruction; Moments-based interface reconstruction - moment of fluid (MOF), MOF 2 ; Moments and their meaning, reference ellipse; Examples of reconstruction in one cell; Interface reconstruction in one cell; Interface reconstruction on full mesh; Advection; Interface remapping; Arbitrary Langrangian-Eulerian Methods - Sketch; Possible Extensions; Conclusion and Future Work.

97 MATHEMATICS AND COMPUTING↗

Non-conformal interface-cohesive modeling with the shifted boundary method

The accurate simulation of boundary- and interface-dominated problems on complex geometries remains challenging when boundary- or interface-fitted meshes are difficult to generate, particularly for curved boundaries, polycrystalline microstructures, and dense interface networks. The Shifted Boundary Method (SBM) alleviates this meshing burden by shifting the enforcement of boundary conditions from the true boundary to a nearby surrogate boundary and recovering the effect of the true boundary through geometric correction terms, thereby enabling standard finite element spaces on non-boundary-fitted meshes. In this report, we develop a general shiftedboundary and shifted-interface framework within the open-source MOOSE framework. We first present a general SBM implementation for complex geometries on non-boundary-fitted meshes. We then adopt the Shifted Interface Method (SIM) for internal interfaces and develop a unified shifted-interface treatment in which the interface law is enforced on a surrogate interface and the effect of the true interface is recovered through shifted jumps, fluxes, and tractions. This perspective brings scalar thermal-contact and vector-valued cohesive-zone mechanics into a single framework, the latter realized as the Shifted Cohesive Zone Method (SCZM) and coupled with history-dependent constitutive models from NEML2. We further extend the MOOSE mesh infrastructure to support cohesive-zone calculations on distributed meshes. The framework is verified and demonstrated through three progressive studies: Poisson’s equation on a smoothed starshaped domain, a manufactured thermal-contact problem on a non-interface-fitted mesh, and a two-dimensional polycrystalline representative volume element combining crystal plasticity with cohesive grain-boundary interfaces. Across these studies, the shifted formulations reproduce boundary- and interface-fitted reference solutions with high fidelity, indicating that the proposed framework provides an accurate and efficient route to boundary- and interface-dominated simulations on arbitrary geometries without requiring fitted meshes.

Yang, Cheng-Hau↗

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part I: Lagrangian and indirect Euler AMR algorithms

Many applications of physics and engineering involve wide ranges of time and spatial scales. The numerical simulation of localized small scales such as shock waves and material interfaces requires a large number of computational cells in these regions. For these applications, Lagrangian and Arbitrary-Lagrangian-Eulerian (ALE) related methods are engaging since the moving mesh feature naturally brings mesh cells on shock discontinuities and material interfaces are carefully captured. In addition, Adaptive-Mesh-Refinement (AMR) strategies aim to optimize computational resources by concentrating finer mesh cells only in areas of interest while using coarser cells elsewhere. A key but challenging AMR requirement consists in efficiently distributing the computational effort to achieve high accuracy without the prohibitive computational costs associated with uniformly fine grids. Here, in this document, the coupling of the p4est AMR library with a cell-centered Lagrangian scheme is presented with the goal to perform reliable 3D Lagrangian-AMR and indirect Euler-AMR multi-material simulations. In particular, it is shown that starting from a 3D indirect ALE code, the memory management and load balancing requirements can be delegated to an external library (here the p4est library) to unlock ALE-AMR capabilities. First, we present a strategy to transcribe the octant-based connectivity of the 3D AMR framework with that of an unstructured mesh of polygonal cells used in Lagrangian hydrodynamics. Then, we show how refinement and coarsening operations must be adapted to the particular Lagrangian framework to ensure the conservation of volume during those steps. Finally, several numerical test cases are presented that demonstrate the capabilities of the Lagrangian-AMR and indirect Euler-AMR algorithms.

3D cell-centered Lagrangian numerical scheme↗

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers

We present a family of discretizations for the Variable Eddington Factor (VEF) equations that have high-order accuracy on curved meshes and efficient preconditioned iterative solvers. The VEF discretizations are combined with the Discontinuous Galerkin transport discretization from to form effective high-order, linear transport methods. The VEF discretizations are derived by extending the unified analysis of Discontinuous Galerkin methods for elliptic problems presented by Arnold et al. to the VEF equations. This framework is used to define analogs of the interior penalty, second method of Bassi and Rebay, minimal dissipation local Discontinuous Galerkin, and continuous finite element methods. The analysis of subspace correction preconditioners, which use a continuous operator to iteratively precondition the discontinuous discretization, is extended to the case of the non-symmetric VEF system. Numerical results demonstrate that the VEF discretizations have arbitrary-order accuracy on curved meshes, preserve the thick diffusion limit, and are effective on a proxy problem from thermal radiative transfer in both outer transport iterations and inner preconditioned linear solver iterations. We demonstrate that the VEF solution converges to the S N transport solution as the mesh is refined on both problems with smooth and non-smooth behavior in angle. Parallel performance studies show that the interior penalty VEF discretization's linear solve weak scales out to 1024 processors and strong scales well on a single node. Particular attention is paid to the parallel performance of the VEF algorithm when used in combination with a parallel block Jacobi transport sweep.

97 MATHEMATICS AND COMPUTING↗

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗