Engineering Papers⌕ Search

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.

At least 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

An IIPG-Based Finite Element Framework in MOOSE for Modeling Fiber Reinforced Composite Failure Governed by Extrinsic Cohesive Laws

Many material and structure failures are initiated at the interface between two distinctive materials, such as the debonding of interfaces of matrix/fiber of composites or bulk matrix/inclusion in metals at micro-scales. Accurate and robust modeling of these interface failures is critical to the design of novel material and structure with improved functionality. This paper presents a robust implementation of a discontinuous Galerkin finite element method in MOOSE based on the Incomplete Interior Penalty Galerkin scheme for modeling material interface behavior. This DG-based interface method naturally accommodates important extrinsic cohesive zone material models and is capable of modeling the failures of material interfaces across which material properties are highly distinctive. We demonstrate a good performance of the proposed method using single fiber and multiple fiber debonding problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A mass conservative, well balanced, tangency preserving and energy decaying method for the shallow water equations on a sphere

Here a fully discrete surface finite element method is proposed for solving the viscous shallow water equations in a bounded Lipschitz domain on the sphere based on a general triangular mesh. The method consists of a modified Crank–Nicolson method in time and a Galerkin surface finite element method in space for the fluid thickness H and the fluid velocity u. A finite element space tangential to the sphere at all finite element nodes is proposed to approximate the fluid velocity u. The proposed method has second-order accuracy in time and first-order accuracy in space, and preserves mass conservation, well balancedness, tangency of velocity to the sphere, and energy decay. Numerical experiments are presented to illustrate the accuracy of the proposed method and the preservation of the physical properties, including mass conservation, well balancedness, and energy decay. A numerical simulation of ocean mesoscale activity on a circular basin with a continental shelf is provided.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Low-dissipation centred schemes for hyperbolic equations in conservative and non-conservative form

We propose a one-parameter family of low-dissipation centred numerical schemes for solving hyperbolic equations in conservative or non-conservative form, using finite volume or discontinuous Galerkin finite element methods. The new schemes spring out from the multi-dimensional FORCE method and are determined by a single parameter α ≥ 1. Given an increasing sequence of real numbers 1 ≤ α 1 < α 2 < . . . < α K , there corresponds a sequence of numerical schemes with stability restriction associated to a decreasing sequence of Courant numbers 1 > c 1 > c 2 > . . . > c K > 0 and a decreasing sequence of corresponding numerical viscosity functions d 1 > d 2 > . . . > d K . For a given Courant number c k ≤ 1 there is a real number α k > 0 and a corresponding stable scheme with minimal numerical viscosity d k . The proposed schemes suit very well the family of high-order discontinuous Galerkin finite element methods and the recently proposed class of ADER-TR schemes, whose orders of accuracy define decreasing sequences of Courant numbers, as the order of accuracy increases. The centred methods of this paper are stable in 2D and 3D in the frame of simultaneous updating formulae, unlike other centred methods, such as 1D FORCE, which are not. Furthermore, the schemes are highly accurate for slowly-moving waves, which is precisely the kind of waves that traditional centred methods smear disastrously. Additional features of the proposed schemes include ease of implementation and applicability to any hyperbolic system either in conservative or non-conservative form. Here, the proposed schemes are analysed and computationally assessed through a suite of test problems for a linear model system, for the Euler equations in one and two space dimensions, and for the Baer-Nunziato equations for compressible two-phase flow.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Verification Suite of Test Cases for the Barotropic Solver of Ocean Models

Abstract The development of any atmosphere or ocean model warrants a suite of test cases (TCs) to verify its spatial and temporal discretizations, order of accuracy, stability, reproducibility, portability, scalability, etc. In this paper, we present a suite of shallow water TCs designed to verify the barotropic solver of atmosphere and ocean models. These include the non‐dispersive coastal Kelvin wave; the dispersive inertia‐gravity wave; the dispersive planetary and topographic Rossby waves; the barotropic tide; and a non‐linear manufactured solution. These TCs check the implementation of the linear pressure gradient term; the linear constant or variable‐coefficient Coriolis and bathymetry terms; and the non‐linear advection terms. Simulation results are presented for a variety of time‐stepping methods as well as two spatial discretizations: a mimetic finite volume method based on the TRiSK scheme, and a high‐order discontinuous Galerkin spectral element method. The experimental procedure for conducting these numerical experiments is detailed. It underscores several key considerations that vary depending on the chosen spatial discretization method. Finally, convergence studies of every TC are conducted with refinement in both space and time, only in space, and only in time. The convergence slopes match the expected theoretical predictions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

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↗
DOE OSTI2023

A robust interface finite element formulation for modeling brittle material failure problems

Abstract Failure of many brittle materials and structures can be modeled using interface‐oriented finite elements combined with intrinsic cohesive zone models. The discontinuous Galerkin (DG) finite element method provides an innovative framework for modeling brittle crack propagation with zero‐thickness interface elements, which can accommodate extrinsic cohesive laws to avoid the artificial compliance required in intrinsic cohesive models. However, robust formulations and implementations of DG methods are critical in alleviating the well‐known convergence issues for both crack nucleation and propagation with reduced instability. This paper presents a robust interface element formulation by modifying the incomplete interior penalty Galerkin (IIPG) method, which successfully avoids the initial element interface penetration across elements that occurs prior to crack nucleation, and thereby greatly reduces the instability issue as cracks open. We further verified and validated our implementation by using a bar tension test and a beam fracturing benchmark. The robustness of our proposed interface element method was demonstrated by a micromechanics fiber/matrix debonding problem with 64 fibers embedded in a bulk matrix.

Liu, Ruijie↗
DOE OSTI2020

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

SAM Finite Volume Method Development Status Update: GCR Application, Restart, and MultiApp

The System Analysis Module (SAM) is being developed as a modern system analysis code for advanced non-light-water-reactor safety analysis under the U.S. DOE NEAMS program. Previous feasibility studies have demonstrated that a staggered-grid finite volume method (SG-FVM), implemented under the MOOSE framework, can deliver more than an order of magnitude speedup over the existing continuous Galerkin finite element method (CG-FEM) solver for liquid-cooled, incompressible but thermally expandable flow systems. This work extends the previous effort to compressible, gas-cooled reactor applications, where pressure couples directly into the mass equation adding additional nonlinearity into the equation system. New code capabilities are implemented for pebble bed high-temperature gas-cooled reactor (PB-HTGR) analysis, including a pebble bed CoreChannel component, built-in pebble bed effective thermal conductivity model and channel-to-channel crossflow model. The capabilities are tested, benchmarked, and demonstrated for problems with increased level of model and physical complexities, including the HTTU effective thermal conductivity test, the SANA passive cooling test, and a demonstration case using the GPBR200 reactor design covering steady-state operation, DLOFC and PLOFC transients. Across all cases, the SG-FVM solver demonstrated strong robustness and efficiency, and the solutions agree well with reference results and data. The finding of this work proves that SG-FVM is a viable and efficient solver pathway for compressible, gas-cooled reactor system analysis in SAM. In addition, work has been done to successfully support SAM-FVM recover/restart code feature that is essential to reactor safety analysis applications, and MultiApp code feature that is essential to multi-scale and multi-physics simulations. In summary, this work continued from previous feasibility studies, and further demonstrated that the SG-FVM will serve as a strong foundation for SAM’s advanced solver algorithm for future deployment.

Zou, Ling↗
DOE OSTI2023

An Efficient High-Order Solver for Diffusion Equations with Strong Anisotropy on Non-Anisotropy-Aligned Meshes

This paper concerns numerical solution of the diffusion equation with strong anisotropy on meshes not aligned with the anisotropic vector field. In order to resolve the numerical pollution for simulations on a non-anisotropy-aligned mesh and reduce the associated high computational cost we propose an effective preconditioner, extending our previous work. Similar to the anisotropy-aligned mesh case, we apply the auxiliary space preconditioning framework to design a preconditioner where a continuous finite element space is used as the auxiliary space for the discontinuous finite element space. The key component is an effective line smoother that can mitigate the high-frequency errors perpendicular to the magnetic field. We design a graph-based approach to find such a line smoother that is approximately perpendicular to the vector fields when the mesh does not align with the anisotropy. Finally, numerical experiments for several benchmark problems are presented, demonstrating the effectiveness and robustness of the proposed preconditioner when applied to Krylov iterative methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Computational Evaluation of Thermal Response of Open-Cell Foam With Circular Pore (Computional Evaluation of Thermal Response of Open-Cell Foam with Circular Pore)

The evaluation of effective material properties in heterogeneous materials (e.g., composites or multicomponent structures) critically relevant to a wide spectrum of applications, including nuclear power, electronic packaging, flame retardants, hypersonics, and gas turbine power. The work described in this paper is centered around the numerical assessment of the thermal behavior of porous materials obtained from finite element thermal modeling and simulation. Here, two-dimensional, steady state analyses were performed on unit cells with centered, circular pores using a second order accurate Galerkin finite element method (FEM). The effective thermal conductivities of the porous systems were examined, encompassing a range of porosities from 4.9% to 60.1%. The geometries of the models were generated based on ordered circular pores for each modeled porosity level. The system response quantity (SRQ) under investigation was the dimensionless effective thermal conductivity across the unit cell. The dimensionless effective thermal conductivity was compared across all simulated cases, producing a trend between porosity and effective thermal conductivity. In the presented investigation, the method of manufactured solutions (MMS) was used to perform code verification, and the grid convergence index (GCI) was employed to estimate discretization uncertainty as solution verification. Code verification concluded an approximately second order accurate Galerkin FEM solver. It was found that the introduction of porosity to the unit cell material structure reduces effective thermal conductivity, as anticipated. Numerical results obtained in this study are compared to an analytical solution and to a sample of empirical data.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗
DOE OSTI2025

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Directing the far-from-equilibrium assembly of nanoparticles in confined liquid crystals by hydrodynamic fields

The assembly of nematic colloids relies on long-range elastic interactions that can be manipulated through external stimuli. Confinement and the presence of a hydrodynamic field alter the defect structures and the energetic interactions between the particles. Here, the assembly landscape of nanoparticles embedded in a nematic liquid crystal confined in a nanochannel under a pressure-driven flow is determined. The dynamics of the liquid crystal tensor alignment field is determined through a Poisson-Bracket framework, namely the Stark–Lubensky equations, coupled with the zero-Reynolds momentum equations and the liquid crystal Landau-de Gennes free energy functional. A second order semi-implicit time integration and a three-dimensional Galerkin finite element method are used to resolve flow and nematic fields under several conditions. In general, the zero Reynolds flow displaces the defects around the particles in the upstream direction and renders the surface anchoring ineffective when the flow strength dominates over the nematic elasticity. More importantly, the potential of mean force for particle assembly is non-monotonic independent of surface anchoring. Our results show that the confinement length scale determines the repulsion/attraction transition between colloids, while the flow strength modifies the static defect structure surrounding the particles and determines the magnitude of the energetic barrier for successful assembly. In the attractive regime, the particles move at different rates through the nematic until one particle eventually catches up with the other. This process occurs against or along the direction of flow depending on the flow strength. Ultimately, these results provide a template for engineering and controlling the transport and assembly of nanoparticles under far-from equilibrium conditions in anisotropic media.

36 MATERIALS SCIENCE↗
DOE OSTI2026

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗
DOE OSTI2022

An Advanced Meso-Scale Peridynamic Modeling Technology using High-Performance Computing for Cost-Effective Product Design and Testing of Carbon Fiber Reinforced Polymer Composites in Light-weight Vehicles

We study a peridynamic composite modeling technology based on the discontinuous Galerkin finite element method, implemented in the commercial LS-DYNA software, for modeling and prediction of failure in carbon fiber reinforced polymer composites. The proposed technology is developed for the material failure analysis at the meso-scale, which provides the prevailing fiber-matrix interaction mechanism, without adoption of the representative volume element method and thus avoiding complicated numerical calibration procedures. Three types of experimental tests—in-plane coupon test, out-of-plane coupon test, and a component crash test—are simulated in a high-performance computing environment to assess the performance of the proposed peridynamic composite modeling technology.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗