Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Galerkin formulations of isogeometric shell analysis: Alleviating locking with Greville quadratures and higher-order elements

Here we propose new quadrature schemes that asymptotically require only four in-plane points for Reissner–Mindlin shell elements and nine in-plane points for Kirchhoff–Love shell elements in B-spline and NURBS-based isogeometric shell analysis, independent of the polynomial degree p of the elements. The quadrature points are Greville abscissae associated with pth-order B-spline basis functions whose continuities depend on the specific Galerkin formulations, and the quadrature weights are calculated by solving a linear moment fitting problem in each parametric direction. The proposed shell element formulations are shown through numerical studies to be rank sufficient and to be free of spurious modes. The studies reveal comparable accuracy, in terms of both displacement and stress, compared with fully integrated spline-based shell elements, while at the same time reducing storage and computational cost associated with forming element stiffness and mass matrices and force vectors. The high accuracy with low computational cost makes the proposed quadratures along with higher-order spline bases, in particular polynomial orders, p = 5 and 6, good choices for alleviating membrane and shear locking in shells.

42 ENGINEERING↗
DOE OSTI2021

Physically regularized machine learning emulators of aerosol activation

Abstract. The activation of aerosol into cloud droplets is an important step in the formation of clouds and strongly influences the radiative budget of the Earth. Explicitly simulating aerosol activation in Earth system models is challenging due to the computational complexity required to resolve the necessary chemical and physical processes and their interactions. As such, various parameterizations have been developed to approximate these details at reduced computational cost and accuracy. Here, we explore how machine learning emulators can be used to bridge this gap in computational cost and parameterization accuracy. We evaluate a set of emulators of a detailed cloud parcel model using physically regularized machine learning regression techniques. We find that the emulators can reproduce the parcel model at higher accuracy than many existing parameterizations. Furthermore, physical regularization tends to improve emulator accuracy, most significantly when emulating very low activation fractions. This work demonstrates the value of physical constraints in machine learning model development and enables the implementation of improved hybrid physical and machine learning models of aerosol activation into next-generation Earth system models.

58 GEOSCIENCES↗
DOE OSTI2023

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Dynamic Species Reduction for Multi-Cycle CFD Simulations (Final Technical Report)

This project primarily sought to address some of the computational cost concerns of detailed simulations by developing improved methods of handling species transport, and chemical kinetics evaluation in a commercial 3D Computational Fluid Dynamics (CFD) environment. Secondary goals were to apply these techniques to fuels and conditions of interest to better understand the key species and reactions required to adequately capture cycle to cycle coupling. Improved modeling will lead to better understanding of these combustion modes and their dependence on fuel composition, which can then enable more clean and efficient engines, ultimately benefiting the consumer as well as the general public. Two approaches were used to address the computational cost. A “Dynamic Species Reduction” (DSR) procedure was developed to remove chemical species from the simulation during periods when chemical reactions were not expected to be important, particularly during gas exchange when temperatures are low and little fuel remains. This modelling procedure automatically detects relevant species to retain in the simulation domain based on their local concentration, removes species below a specified concentration threshold, and then adjusts the remaining species mass to conserve not only the number of H, C, and O atoms in each cell, but also the relative proportions between species and the heating value of the mixture in every cell. The second procedure was a “Product Directed Remapping” (PDR) updates the algorithm used to group individual computational cells for chemical kinetics evaluation to account for non-uniform temperature distributions and the CO to CO 2 ratio in the cells. The model techniques developed in this work successfully demonstrated computational performance improvements for a range of conditions relevant for Highly Dilute SI and HCCI engine operation. Runtime reductions of 10% were observed for small mechanisms, with further reductions of up to 36% observed for larger mechanisms. Improvements were primarily related to reducing the number of chemical species tracked during the gas exchange process using the Dynamic Species Reduction method. With smaller benefits observed from changes to the kinetics binning and evaluation strategy in the post combustion region using the PDR method. The results of this work show the potential for improved computational runtime for complicated simulations. They can and should be extended to additional conditions and new bio-derived and renewable fuels as they are developed and new kinetic mechanisms become available.

10 SYNTHETIC FUELS↗
DOE OSTI2021

Recent Advances for Improving the Accuracy, Transferability, and Efficiency of Reactive Force Fields

Reactive force fields provide an affordable model for simulating chemical reactions at a fraction of the cost of quantum mechanical approaches. However, classically accounting for chemical reactivity often comes at the expense of accuracy and transferability, while computational cost is still large relative to nonreactive force fields. Here, we summarize recent efforts for improving the performance of reactive force fields in these three areas with a focus on the ReaxFF theoretical model. To improve accuracy, we describe recent reformulations of charge equilibration schemes to overcome unphysical long-range charge transfer, new ReaxFF models that account for explicit electrons, and corrections for energy conservation issues of the ReaxFF model. To enhance transferability we also highlight new advances to include explicit treatment of electrons in the ReaxFF and hybrid nonreactive/reactive simulations that make it possible to model charge transfer, redox chemistry, and large systems such as reverse micelles within the framework of a reactive force field. To address the computational cost, we review recent work in extended Lagrangian schemes and matrix preconditioners for accelerating the charge equilibration method component of ReaxFF and improvements in its software performance in LAMMPS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Matrix Approach to Accelerate Spin-Up of CLM5

Numerical models have been developed to investigate and understand responses of biogeochemical cycle to global changes. Steady state, when a system is in dynamic equilibrium, is generally required to initialize these model simulations. However, the spin-up process that is used to achieve steady state pose a great burden to computational resources, limiting the efficiency of global modeling analysis on biogeochemical cycles. This study introduces a new Semi-Analytical Spin-Up (SASU) to tackle this grand challenge. We applied SASU to Community Land Model version 5 and examined its computational efficiency and accuracy. At the Brazil site, SASU is computationally 7 times more efficient than (or saved up to 86% computational cost in comparison with) the traditional native dynamics (ND) spin-up to reach the same steady state. Globally, SASU is computationally 8 times more efficient than the accelerated decomposition spin-up and 50 times more efficient than ND. In summary, SASU achieves the highest computational efficiency for spin-up on site and globally in comparison with other spin-up methods. It is generalizable to wide biogeochemical models and thus makes computationally costly studies (e.g., parameter perturbation ensemble analysis and data assimilation) possible for a better understanding of biogeochemical cycle under climate change.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

B-DeepONet: An enhanced Bayesian DeepONet for solving noisy parametric PDEs using accelerated replica exchange SGLD

Here, the Deep Operator Network (DeepONet) is a neural network architecture used to approximate operators, including the solution operator of parametric PDEs. DeepONets have shown remarkable approximation ability. However, the performance of DeepONets deteriorates when the training data is polluted with noise, a scenario that occurs in practice. To handle noisy data, we propose a Bayesian DeepONet based on replica exchange Langevin diffusion (reLD). Replica exchange uses two particles. The first particle trains a DeepONet to exploit the loss landscape and make predictions. The other particle trains a different DeepONet to explore the loss landscape and escape local minima via swapping. Compared to DeepONets trained with state-of-the-art gradient-based algorithms (e.g., Adam), the proposed Bayesian DeepONet greatly improves the training convergence for noisy scenarios and accurately estimates the uncertainty. To further reduce the high computational cost of the reLD training of DeepONets, we propose (1) an accelerated training framework that exploits the DeepONet's architecture to reduce its computational cost up to 25% without compromising performance and (2) a transfer learning strategy that accelerates training DeepONets for PDEs with different parameter values. Finally, we illustrate the effectiveness of the proposed Bayesian DeepONet using four parametric PDE problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Development of Numerical Model of Metal Foam with PCM for the Estimation of Effective Thermal Conductivity

Global warming due to climate change is a threat to humankind. Nuclear energy is one of the promising solutions to reduce fossil fuel usage. Nuclear energy can handle the base load, compensating for the volatility of renewable energy. If nuclear energy could achieve load following capability, the combination with renewable energy would be more suitable. Thermal energy storage (TES) is one of the options for enabling load following of nuclear reactors. The TES makes it possible to store surplus nuclear thermal energy and release it later as needed. In Idaho National Laboratory (INL), a new concept of latent heat TES integrated with high-temperature heat pipe has been proposed and is under development, which is called Heat pipe-Integrated Thermal Battery (HITB). HITB exchanges thermal energy between the reactor system and TES via heat pipe. The heat transferred to TES medium, made of phase change material (PCM), stores energy as sensible heat and/or latent heat. As PCM typically has poor thermal conductivity, however, various heat transfer enhancement techniques are required to achieve a rapid charging cycle. There are many techniques to enhance the heat transfer ability of TES medium such as disk, fin, and metal foam. Among them, metal foam is an appropriate option to enhance the heat transfer because it maximizes the heat transfer area through metal wicks. Metal foam is a lightweight metal structure that has a high porosity of over 0.9. The typical materials for metal foam are Aluminum, Copper, Nickel, and Silicon Carbide (SiC). Metal foam not only enhances heat transfer via conduction but also increases contact surface area. In the HITB design , the metal foam is being considered as one of the options to enhance the heat transfer of TES medium (PCM) [1]. To predict the enhanced thermal performance of TES, one should properly estimate the effective thermal conductivity of metal foam combined with PCM material or calculate heat transfer in distributed model. There are many experimental works that provides effective thermal conductivity of metal foam with various PCM [2,3]. Also, many theoretical models were developed based on the unit cell model of metal foam [4,5]. With a distributed model, on the other hand, detail heat transfer characteristics between metal foam and PCM material can be analyzed considering the geometry or buoyancy effect. However, due to the complex geometry of metal foam pores, the computational cost for three-dimensional modeling highly increases. Therefore, if metal foam structure can be modeled in simple and repetitive design, the computational cost would decrease Among the various metal foam models [2], lattice model is one of the simple and extendable design. The porosity and pores per inch (PPI) can be characterized by the size and spatial distance of lattice structure. If the three-dimensional metal foam model consists of lattice structure could properly estimate the heat transfer, which is characterized by effective thermal conductivity, it would be a good option to assess the thermal performance of metal foam with PCM. In this study, a three-dimensional numerical model was developed to simulate conductive heat transfer between metal foam and PCM. The three-dimensional lattice structure of square pillars was selected as a basic structure of the metal foam. The calculation result was characterized by the effective thermal conductivity of the whole domain. A sensitivity study was conducted for mesh size, domain size, and PPI to check whether the calculation result gives a converged result or not. Lastly, the effective thermal conductivity from the lattice model was compared with existing experimental data to validate the model result

25 ENERGY STORAGE↗
DOE OSTI2021

Nonoverlapping block smoothers for the Stokes equations

Overlapping block smoothers efficiently damp the error contributions from highly oscillatory components within multigrid methods for the Stokes equations but they are computationally expensive. This paper is concentrated on the development and analysis of new block smoothers for the Stokes equations that are discretized on staggered grids. These smoothers are nonoverlapping and therefore desirable due to reduced computational costs. Traditional geometric multigrid methods are based on simple pointwise smoothers. However, using multigrid methods to efficiently solve more difficult problems such as the Stokes equations leads to computationally more expensive smoothers, for example, overlapping block smoothers. Nonoverlapping smoothers are less expensive, but have been considered less efficient in the literature. In this paper, we develop new nonoverlapping smoothers, the so-called triad-wise smoothers, and show their efficiency within multigrid methods to solve the Stokes equations. In addition, we compare overlapping and nonoverlapping smoothers by measuring their computational costs and analyzing their behavior by the use of local Fourier analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey

Uncertainty quantification (UQ) includes the characterization, integration, and propagation of uncertainties that result from stochastic variations and a lack of knowledge or data in the natural world. Monte Carlo (MC) method is a sampling-based approach that has widely used for quantification and propagation of uncertainties. However, the standard MC method is often time-consuming if the simulation-based model is computationally intensive. This article gives an overview of modern MC methods to address the existing challenges of the standard MC in the context of UQ. Specifically, multilevel Monte Carlo (MLMC) extending the concept of control variates achieves a significant reduction of the computational cost by performing most evaluations with low accuracy and corresponding low cost, and relatively few evaluations at high accuracy and corresponding high cost. Multifidelity Monte Carlo (MFMC) accelerates the convergence of standard Monte Carlo by generalizing the control variates with different models having varying fidelities and varying computational costs. Multimodel Monte Carlo method (MMMC), having a different setting of MLMC and MFMC, aims to address the issue of UQ and propagation when data for characterizing probability distributions are limited. Multimodel inference combined with importance sampling is proposed for quantifying and efficiently propagating the uncertainties resulting from small data sets. All of these three modern MC methods achieve a significant improvement of computational efficiency for probabilistic UQ, particularly uncertainty propagation. Finally, an algorithm summary and the corresponding code implementation are provided for each of the modern MC methods. The extension and application of these methods are discussed in detail.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Real-time signal detection for Cyclotron Radiation Emission Spectroscopy measurements using antenna arrays

Cyclotron Radiation Emission Spectroscopy (CRES) is a technique for precision measurement of the energies of charged particles, which is being developed by the Project 8 Collaboration to measure the neutrino mass using tritium beta-decay spectroscopy. Project 8 seeks to use the CRES technique to measure the neutrino mass with a sensitivity of 40 meV, requiring a large supply of tritium atoms stored in a multi-cubic meter detector volume. Antenna arrays are one potential technology compatible with an experiment of this scale, but the capability of an antenna-based CRES experiment to measure the neutrino mass depends on the efficiency of the signal detection algorithms. Here, in this paper, we develop efficiency models for three signal detection algorithms and compare them using simulations from a prototype antenna-based CRES experiment as a case-study. The algorithms include a power threshold, a matched filter template bank, and a neural network based machine learning approach, which are analyzed in terms of their average detection efficiency and relative computational cost. It is found that significant improvements in detection efficiency and, therefore, neutrino mass sensitivity are achievable, with only a moderate increase in computation cost, by utilizing either the matched filter or machine learning approach in place of a power threshold, which is the baseline signal detection algorithm used in previous CRES experiments by Project 8.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Spectral-partitioned Kohn-Sham density functional theory

Here we introduce a general, variational scheme for systematic approximation of a given Kohn-Sham free-energy functional by partitioning the density matrix into distinct spectral domains, each of which may be spanned by an independent diagonal representation without requirement of mutual orthogonality. It is shown that by generalizing the entropic contribution to the free energy to allow for independent representations in each spectral domain, the free energy becomes an upper bound to the exact (unpartitioned) Kohn-Sham free energy, attaining this limit as the representations approach Kohn-Sham eigenfunctions. A numerical procedure is devised for calculation of the generalized entropy associated with spectral partitioning of the density matrix. The result is a powerful framework for Kohn-Sham calculations of systems whose occupied subspaces span multiple energy regimes. As a case in point, we apply the proposed framework to warm- and hot-dense matter described by finite-temperature density functional theory, where at high energies the density matrix is represented by that of the free-electron gas, while at low energies it is variationally optimized. We derive expressions for the spectral-partitioned Kohn-Sham Hamiltonian, atomic forces, and macroscopic stresses within the projector-augmented wave (PAW) and the norm-conserving pseudopotential methods. It is demonstrated that at high temperatures, spectral partitioning facilitates accurate calculations at dramatically reduced computational cost. Moreover, as temperature is increased, fewer exact Kohn-Sham states are required for a given accuracy, leading to further reductions in computational cost. Finally, it is shown that standard multiprojector expansions of electronic orbitals within atomic spheres in the PAW method lack sufficient completeness at high temperatures. Spectral partitioning provides a systematic solution for this fundamental problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Machine learning–assisted prediction of heat fluxes through thermally anisotropic building envelopes

Thermally anisotropic building envelope (TABE) is a novel active building envelope that can save energy use to maintain thermal comfort in buildings by redirecting heat and coolness from building envelopes to thermal loops. Finite element models (FEMs) can be used to compute the heat fluxes through TABEs, but the high computational cost of finite element simulations has prevented parametric studies and design optimizations. This paper proposes a domain knowledge–informed, finite element–based machine learning framework to reduce the computation cost for the energy management of buildings installed with TABE that uses a ground thermal loop. First, the training heat flux data set was generated by FEM simulations with different thermal loop schedules. Then, both shallow learning models (i.e., multivariate linear regression and eXtreme Gradient Boost, or XGBoost) and a deep learning model (i.e., deep neural network, or DNN) were trained to predict the heat fluxes. Domain knowledge was used for data preprocessing and feature selection. Finally, the suitability of the selected machine learning model was tested under different thermal loop schedules. Herein, the case study results showed that: (1) XGBoost can be as accurate as DNN (coefficient of determination equal to 0.81) with much less training time; (2) the annual energy cost savings for different thermal loop schedules obtained by the XGBoost-predicted and FEM-calculated heat fluxes are consistent, having a difference of only 4%; and (3) XGBoost can reduce the computation time for the annual energy analysis of the case study building with a given thermal loop schedule from around 12 h by using FEM to less than 1 min.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Probabilistic-learning-based stochastic surrogate model from small incomplete datasets for nonlinear dynamical systems

We consider a high-dimensional nonlinear computational model of a dynamical system, parameterized by a vector-valued control parameter, in the presence of uncertainties represented by an uncontrolled parameter modeled by a vector-valued random variable, and possibly with stochastic excitation. The objective is to construct a statistical surrogate model where the input is any deterministic value of the control parameter, and the output is a vector-valued observation of the computational model, which is a random vector whose probability measure is updated using a target dataset. To construct this statistical surrogate model, the stochastic response of the computational model must be built, which is a vector-valued time-discretized stochastic process in high dimension, depending on the control parameter. It is assumed that the computational cost of a single evaluation of the deterministic model is high. For the probabilistic updating, we consider a subset of the components of the observation of the computational model, defined as the “identification observation” of the computational model, for which a small target dataset is available. Therefore, the target dataset is associated with partial observability, corresponding to an incomplete data case. Given a prior probability model of the random control and uncontrolled parameters, a training dataset is constructed, consisting of realizations of the random triplet composed of the stochastic response, the random identification observation, and the random control parameter. Since the computational cost of a single evaluation of the deterministic model is assumed to be large, the training dataset is also of small size. The main challenges in this problem are the high dimensionality, partial observability leading to incomplete data in the target dataset for the identification observation of the computational model (which is not sufficient to identify the computational stochastic responses), and the availability of a small training dataset. To address these challenges, we propose a methodology based on statistical methods for constructing necessary reduced representations, direct probabilistic learning under constraints using probabilistic learning on manifolds (PLoM) constrained by the target dataset, and the use of a weak formulation of the Fourier transform of probability measures. Statistical conditioning is also employed to explore the learned dataset. The constructed predictive statistical surrogate model can be implemented in the context of online computation. Here, we apply this approach to a problem of nonlinear stochastic dynamics in high dimensions within the framework of deformable solids mechanics.

Engineering↗
DOE OSTI2022

Effect of Packing Nonuniformity at the Fiber Bundle–Case Interface on Performance of Hollow Fiber Membrane Gas Separation Modules

High-fidelity simulations of momentum and mass transfer within a hollow fiber gas separation membrane module are here reported. The simulations capture the potential detrimental effects of poor fiber packing at the bundle–case interface on fluid distribution and performance. Results are presented for both circular and planar fiber bundles. The length over which bundle–case gaps affects flow is determined. The length increases dramatically with increasing fiber packing fraction. As the packing fraction approaches 0.6, the impact extends over the entire bundle diameter for small modules (<1000 fibers). The results clearly demonstrate the detrimental effect of poor packing along the case and can be used to develop module manufacturing guidelines. To reduce computational costs, an equivalent planar bundle module approximation is developed. The approximate simulations agree well with results from full 3-D simulations and can reduce computational costs without sacrificing fidelity.

42 ENGINEERING↗
DOE OSTI2020

Threadsafe Dynamic Neighbor Lists for Monte Carlo Ray Tracing

Monte Carlo (MC) transport codes offer high-fidelity modeling of particle transport physics, but their high computational cost makes them impractical for many applications. For some applications such as multiphysics and depletion that use finely discretized geometries, a large portion of this computational cost is attributable to ray tracing. Neighbor lists are a well-known method for accelerating ray-tracing calculations in a MC code, but despite their prevalence, little work has been published on the details of their implementation. The fine details can have a significant impact on performance, particularly when using shared-memory parallelism. This paper addresses these details of implementation with a discussion of different neighbor list schemes and their impact on software runtime. Performance tests were run by using OpenMC on a pin-cell problem discretized with up to 200 axial regions. The results demonstrate that switching from surface-based to cell-based neighbor lists leads to a 10 faster calculation rate for the most fine discretization. Finally, using a threadsafe shared-memory data structure results in a 20% faster calculation rate versus simple threadprivate neighbor lists. Results here show that a data structure that is contiguous in memory improves performance by only 1% to 2% over noncontiguous linked lists.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Physics-informed machine learning for fault-leakage reduced-order modeling

Geologic carbon storage (GCS) is a promising technology for mitigating CO 2 emissions. The overall success of GCS depends on safe operations that are informed by risk assessment and have proper mitigation plans in place. Performing quantitative probabilistic risk assessment for a GCS site using traditional reservoir simulators can be challenging due to the high computational costs. To overcome this challenge, the US Department of Energy’s National Risk Assessment Partnership (NRAP) project has developed an integrated assessment modeling approach that utilizes computationally efficient reduced-order models (ROM) for simulating various parts of a GCS storage site to quantify uncertainty. Here, in this study, we develop a reduced-order model for fault leakage risk assessment. We use a deep learning approach to build the reduced-order model. We perform a sensitivity analysis and find that the deep learning model yields high accuracy with a much smaller computational cost than full-physics simulation. We also evaluate the performance of the model in scenarios where simulations are not possible to run, providing analysis not previously performed in fault-leakage ROM analyses. Based on a sensitivity analysis of the model, we suggest a simplified conceptual model for fault leakage and site monitoring.

58 GEOSCIENCES↗
DOE OSTI2020

A quadratic programming flux correction method for high-order DG discretizations of S transport

In this work, we present a new flux-fixup approach for arbitrarily high-order discontinuous Galerkin (DG) discretizations of the S N transport equation, and we demonstrate the compatibility of this approach with the Variable Eddington Factor (VEF) method. The new fixup approach is sweep-compatible: during a transport sweep (block Gauss-Seidel iteration in which the scattering source is lagged), a local quadratic programming (QP) problem is solved in each spatial element to ensure that the solution satisfies certain physical constraints, including local particle balance. In this paper, we describe two choices of physical constraints, resulting in two variants of the method: QP Zero (QPZ) and QP Maximum Principle (QPMP). In QPZ, the finite element coefficients of the solution are constrained to be nonnegative. In QPMP, they are constrained to adhere to an approximate discrete maximum principle. There are two primary takeaways in this paper. First, when the positive Bernstein basis is used for DG discretization, the QPMP method eliminates negativities, preserves high-order accuracy for smooth problems, and significantly dampens unphysical oscillations in the solution. The latter feature – the dampening of unphysical oscillations – is an improvement upon standard, simpler fixup approaches such as the approach described in (denoted as the “zero and rescale” (ZR) method in this paper). This improvement comes at a moderate computational cost, but it is not prohibitive. Our results show that, even in an unrealistic worst-case scenario where 83% of the spatial elements require a fixup, the computational cost of performing a transport sweep with fixup is only ~31% greater than performing one without fixup. The second takeaway is that the VEF method can be used to accelerate the convergence of transport sweeps even when a fixup is applied. When optically thick regions are present, transport sweeps converge slowly, regardless of whether a fixup is applied, and acceleration is needed. However, attempting to apply standard diffusion synthetic acceleration (DSA) to fixed-up transport sweeps results in divergence for optically thick problems. Our results show that the same is not true for VEF. When VEF is combined with fixed-up transport sweeps, the result is a scheme that produces a nonnegative solution, converges independently of the mean free path, and, in the case of the QPMP fixup, adheres to an approximate discrete maximum principle.

97 MATHEMATICS AND COMPUTING↗