SEARCH · Engineering Papers
Results for “Galerkin method”
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.
A p-adaptive Discontinuous Galerkin Methods for Compressible Flows Using CHARM++
Explore the source record for details and available documents.
Direct Discontinuous Galerkin Methods for the Reacting, Multi-Species, 3D Compressible Navier-Stokes Equations
Explore the source record for details and available documents.
A New Galerkin Quadrature Method Not Requiring a Matrix Inverse
We derive a new Galerkin quadrature (GQ) method for S 𝑛 calculations that differs from the two methods preceding it in that a matrix inverse for an 𝑁 𝑑 × 𝑁 𝑑 matrix, where 𝑁𝑑 is the number of directions in the quadrature set, is no longer required. Galerkin quadrature methods are designed for calculations with highly anisotropic scattering. Such methods are not simply special angular quadratures but also are methods for representing the S 𝑛 scattering source that offers several advantages relative to the standard scattering source representation when highly truncated Legendre cross-section expansions must be used. Galerkin quadrature methods are also useful when the scattering is moderately anisotropic, but the quadrature being used is not sufficiently accurate for the order of the scattering source expansion that is required. Furthermore, we derive the new method and present computational results showing that its performance for two challenging problems is comparable to those of the two GQ methods that preceded it.
Simulation of dynamic crystal plasticity with a Lagrangian discontinuous Galerkin hydrodynamic method
Here we present a new Lagrangian modal discontinuous Galerkin (DG) hydrodynamic method that supports a dynamic dislocation based crystal plasticity model for simulating the mechanical behavior of crystallographic materials, both single crystal and polycrystalline, under dynamic conditions. A modal DG approach is used to evolve fields relevant to conservation laws. These fields are approximated by Taylor series polynomials of varying degree. These polynomials describe macro-scale hydrodynamic behavior while their evolution is determined by evaluating the dynamic crystal plasticity model at material points within the element. The dynamic crystal plasticity model is sensitive to the time increment size, with too large of time increments leading to instability in the model. To mitigate this, the temporal evolution of the dynamic crystal plasticity model is achieved with the combination of a sub-incrementing scheme with Heun’s third-order time integration scheme, which is also used to temporally evolve the governing equations. The implementation of the dynamic crystal plasticity model within the DG framework is tested using a 2D approximation of the Taylor impact test with a single crystal material, using quadratic elements that have faces that can bend. In addition to the standard continuous material modeling, we propose a new simulation method that would represent the heterogeneous behavior of polycrystalline microstructures within an element by varying the position and material properties of the material points within the element. This method is demonstrated using random orientation distributions on materials points that are arranged in both structured and random configurations.
Efficient discontinuous Galerkin implementations and preconditioners for implicit unsteady compressible flow simulations
This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of HDG, applied to the implicit solution of unsteady compressible flows. The matrix-free implementation allows for a reduction of the memory footprint of the solver when dealing with implicit time-accurate discretizations. HDG reduces the number of globally-coupled degrees of freedom relative to DG, at high order, by statically condensing element-interior degrees of freedom from the system in favor of face unknowns. The primal formulation further reduces the element-interior degrees of freedom by eliminating the gradient as a separate unknown. This paper introduces a p-multigrid preconditioner implementation for these discretizations and presents results for various flow problems. Benefits of the p-multigrid strategy relative to simpler, less expensive, preconditioners are observed for stiff systems, such as those arising from low-Mach number flows at high-order approximation. The p-multigrid preconditioner also shows excellent scalability for parallel computations. Finally, additional savings in both speed and memory occur with a matrix-free/reduced version of the preconditioner.
Generalized Korn’s inequalities for piecewise $H¹$ and $H²$ vector fields
The purpose of this paper is to construct a new class of discrete generalized Korn’s inequalities for piecewise $H^1$ vector fields and piecewise $H^2$ vector fields in three-dimensional space. The resulting Korn’s inequalities are different from the standard Korn’s inequalities, as they involve the trace-free symmetric gradient operator, in place of the usual symmetric gradient operator. Furthermore, it is anticipated that the new generalized Korn’s inequalities will be useful for the analysis of a broad range of finite element methods, including mixed finite element methods and discontinuous Galerkin methods.
A multiphase Lagrangian discontinuous Galerkin hydrodynamic method for high-explosive detonation physics
Not Available
A New Integration Approach in Surface Integral Equation Discontinuous Galerkin(IEDG) Method.
Abstract not provided.
A consistent and stable quadrature scheme for Galerkin meshfree methods for applications in nonlinear solid mechanics.
Abstract not provided.
Discontinuous Galerkin sparse grids methods for time domain Maxwell’s equations
In this paper, we present a time-explicit sparse grid discontinuous Galerkin method for solving the three-dimensional time-domain Maxwell equations. The conservation properties and convergence rates are established for different choices of numerical fluxes. The convergence rates are proved theoretically and then verified by several numerical examples. Even though our scheme does not preserve the divergence, but by implying the higher order polynomial, one can observe the same convergence rate as numerical solution. Several numerical tests are presented to validate these conclusions.
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.
Multiscale modeling high-order methods and data-driven modeling
Projection-based reduced-order models (ROMs) comprise a promising set of data-driven approaches for accelerating the simulation of high-fidelity numerical simulations. Standard projection-based ROM approaches, however, suffer from several drawbacks when applied to the complex nonlinear dynamical systems commonly encountered in science and engineering. These limitations include a lack of stability, accuracy, and sharp a posteriori error estimators. This work addresses these limitations by leveraging multiscale modeling, least-squares principles, and machine learning to develop novel reduced-order modeling approaches, along with data-driven a posteriori error estimators, for dynamical systems. Theoretical and numerical results demonstrate that the two ROM approaches developed in this work - namely the windowed least-squares method and the Adjoint Petrov - Galerkin method - yield substantial improvements over state-of-the-art approaches. Additionally, numerical results demonstrate the capability of the a posteriori error models developed in this work.
Agglomeration-based geometric multigrid solvers for compact discontinuous Galerkin discretizations on unstructured meshes
Here, we present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is easily extendable to other discontinuous Galerkin discretizations, including the Local DG method and the Interior Penalty method. We demonstrate excellent solver performance for Poisson's equation, provided a flux formulation is used for the operator coarsening and a suitable switch function chosen for the numerical fluxes.
A low-rank solver for the stochastic unsteady Navier–Stokes problem
Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.
FIERRO V.X
FIERRO is a modern C++ code intended to simulate quasi-static solid mechanics problems and transient, compressible material dynamic problems with Lagrangian methods, which have meshes with constant mass elements that move with the material. FIERRO is designed to aid a) material model research that has historically been done using commercial implicit and explicit finite element codes, b) numerical methods research, and c) computer science research. FIERRO supports user developed material models that adhere to several industry standard formats by using a C++ to Fortran interface to couple the model to the numerical solvers. FIERRO is built on the ELEMENTS library that supports a diverse suite of element types, including high-order elements, and quadrature rules. The mesh class within the ELEMENTS library is designed for efficient calculations on unstructured meshes and to minimize memory usage. FIERRO is designed to readily accommodate a range of numerical methods including continuous finite element, finite volume, and discontinuous Galerkin methods. FIERRO is designed to support explicit and implicit time integration methods. FIERRO only supports a single material in an element. No physical data exists within the code.
A Refinement-by-Superposition -Method for (curl)- and (div)-Conforming Discretizations
Here, we present refinement-by-superposition (RBS) hp-refinement infrastructure for computational electromagnetics (CEMs), which permits exponential rates of convergence. In contrast to dominant approaches to hp-refinement for continuous Galerkin methods, which rely on explicit constraint equations, the multilevel strategy presented drastically reduces the implementation complexity. Through the RBS methodology, enforcement of continuity occurs by construction, enabling arbitrary levels of refinement with ease, and without the practical (but not theoretical) limitations of constrained-node refinement. We outline the construction of the RBS hp-method for refinement with H (curl)- and H (div)-conforming finite cells. Numerical simulations for the 2-D finite element method (FEM) solution of the Maxwell eigenvalue problem demonstrate the effectiveness of RBS hp-refinement. As an additional goal of this work, we aim to promote the use of mixed-order (low- and high-order) elements in practical CEM applications.