Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discretization”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Rapid Simulation of Unconventional Reservoirs by Multidomain Multiresolution Modeling Based on the Diffusive Time of Flight

Summary The fast marching method (FMM)-based rapid flow simulation has been shown to accelerate simulation efficiency by orders of magnitude by transforming 3D simulation to equivalent 1D simulation using the concept of the “diffusive time of flight” (DTOF). However, the 1D transformation does not directly apply to multiwell problems. In this paper, we propose a novel DTOF-based multidomain multiresolution discretization scheme to accelerate multiwell simulation of unconventional reservoirs. Our method formulates multiwell simulation problems based on the DTOF which displays the pressure front propagation in unconventional reservoirs. The DTOF contours are used to partition the reservoir into local and shared domains. A local domain is where the flow is dominated by a single well, and the shared domain is where the fluid flow is influenced by multiple wells. The DTOF contours expand independently in local domains and interfere in the shared domain. After the partitioning, each domain is discretized using a multiresolution scheme whereby the original 3D fine mesh is preserved near the wells to account for detailed physics including gravity, and the rest of the domain is discretized into 1D mesh based on the DTOF contours to alleviate the simulation workload. The power and efficacy of our approach are demonstrated using synthetic and field-scale simulation models with different degrees of geologic and well-completion complexity. The simulation results, number of active cells, and computation time for the proposed discretization scheme are compared with the original high-fidelity 3D model for each case. The results show that the proposed method is suitable for multiwell simulation problems in unconventional reservoirs and can accelerate flow simulations by orders of magnitude with minimal loss of accuracy. The novelty of this work is the creation of DTOF-derived multiresolution discretization with local and shared domains to simplify and accelerate the calculation of subsurface flow problems, especially in unconventional reservoirs. Our workflow can be easily interfaced with commercial simulators, making it suitable for large-scale field applications.

Engineering↗
DOE OSTI2025

Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients

In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.

convection–diffusion–reaction equation↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An unstructured body-of-revolution electromagnetic particle-in-cell algorithm with radial perfectly matched layers and dual polarizations

A novel electromagnetic particle-in-cell algorithm has been developed for fully kinetic plasma simulations on unstructured (irregular) meshes in complex body-of-revolution geometries. The algorithm, implemented in the BORPIC++ code, utilizes a set of field scalings and a coordinate mapping, reducing the Maxwell field problem in a cylindrical system to a Cartesian finite element Maxwell solver in the meridian plane. The latter obviates the cylindrical coordinate singularity in the symmetry axis. The choice of an unstructured finite element discretization enhances the geometrical flexibility of the BORPIC++ solver compared to the more traditional finite difference solvers. Symmetries in Maxwell’s equations are explored to decompose the problem into two dual polarization states with isomorphic representations that enable code reuse. The particle-in-cell scatter and gather steps preserve charge conservation at the discrete level. Our previous algorithm (BORPIC+) discretized the E and B field components of TE Φ and TM Φ polarizations on the finite element (primal) mesh. Here, we employ a new field-update scheme. Using the same finite element (primal) mesh, this scheme advances two sets of field components independently: (1) E and B of TE Φ polarized fields, (E z , E ρ , B Φ ) and (2) D and H of TM Φ polarized fields, (D Φ , H z , H ρ ). Since these field updates are not explicitly coupled, the new field solver obviates the coordinate singularity, which otherwise arises at the cylindrical symmetric axis, ρ = 0 when defining the discrete Hodge matrices (generalized finite element mass matrices). Here, a cylindrical perfectly matched layer is implemented as a boundary condition in the radial direction to simulate open space problems, with periodic boundary conditions in the axial direction. We investigate effects of charged particles moving next to the cylindrical perfectly matched layer. We model azimuthal currents arising from rotational motion of charged rings, which produce TMΦ polarized fields. Several numerical examples are provided to illustrate the first application of the algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Development, Implementation, and Verification of Partially-Ionized Collisional Multifluid Plasma Models in Drekar

We consider the development of multifluid models for partially ionized multispecies plasmas. The models are composed of a standard set of five-moment fluid equations for each species plus a description of electromagnetics. The most general model considered utilizes a full set of fluid equations for each charge state of each atomic species, plus a set of fluid equations for electrons. The fluid equations are coupled through source terms describing electromagnetic coupling, ionization, recombination, charge exchange, and elastic scattering collisions in the low-density coronal limit. The form of each of these source terms is described in detail, and references for required rate coefficients are identified for a diverse range of atomic species. Initial efforts have been made to extend these models to incorporate some higher-density collisional effects, including ionization potential depression and three- body recombination. Some reductions of the general multifluid model are considered. First, a reduced multifluid model is derived which averages over all of the charge states (including neutrals) of each atomic species in the general multifluid model. The resulting model maintains full consistency with the general multifluid model from which it is derived by leveraging a quasi-steady-state collisional ionization equilibrium assumption to recover the ionization fractions required to make use of the general collision models. Further reductions are briefly considered to derive certain components of a single-fluid magnetohydrodynamics (MHD) model. In this case, a generalized Ohm's law is obtained, and the standard MHD resistivity is expressed in terms of the collisional models used in the general multifluid model. A number of numerical considerations required to obtain robust implementations of these multifluid models are discussed. First, an algebraic flux correction (AFC) stabilization approach for a continuous Galerkin finite element discretization of the multifluid system is described in which the characteristic speeds used in the stabilization of the fluid systems are synchronized across all species in the model. It is demonstrated that this synchronization is crucial in order to obtain a robust discretization of the multifluid system. Additionally, several different formulations are considered for describing the electromagnetics portion of the multifluid system using nodal continuous Galerkin finite element discretizations. The formulations considered include a parabolic divergence cleaning method and an implicit projection method for the traditional curl formulation of Maxwell's equations, a purely- hyperbolic potential-based formulation of Maxwell's equations, and a mixed hyperbolic-elliptic potential-based formulation of Maxwell's equations. Some advantages and disadvantages of each formulation are explored to compare solution robustness and the ease of use of each formulation. Numerical results are presented to demonstrate the accuracy and robustness of various components of our implementation. Analytic solutions for a spatially homogeneous damped plasma oscillation are derived in order to verify the implementation of the source terms for electromagnetic coupling and elastic collisions between fluid species. Ionization balance as a function of electron temperature is evaluated for several atomic species of interest by comparing to steady-state calculations using various sets of ionization and recombination rate coefficients. Several test problems in one and two spatial dimensions are used to demonstrate the accuracy and robustness of the discretization and stabilization approach for the fluid components of the multifluid system. This includes standard test problems for electrostatic and electromagnetic shock tubes in the two-fluid and ideal shock-MHD limits, a cylindrical diocotron instability, and the GEM challenge magnetic reconnection problem. A one-dimensional simplified prototype of an argon gas puff configuration as deployed on Sandia's Z-machine is used as a demonstration to exercise the full range of capabilities associated with the general multifluid model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

A neural network‐enhanced reproducing kernel particle method for modeling strain localization

Abstract Modeling the localized intensive deformation in a damaged solid requires highly refined discretization for accurate prediction, which significantly increases the computational cost. Although adaptive model refinement can be employed for enhanced effectiveness, it is cumbersome for the traditional mesh‐based methods to perform while modeling the evolving localizations. In this work, neural network‐enhanced reproducing kernel particle method (NN‐RKPM) is proposed, where the location, orientation, and shape of the solution transition near a localization is automatically captured by the NN approximation via a block‐level neural network (NN) optimization. The weights and biases in the blocked parameterization network control the location and orientation of the localization. The designed basic four‐kernel NN block is capable of capturing a triple junction or a quadruple junction topological pattern, while more complicated localization topological patters are captured by the superposition of multiple four‐kernel NN blocks. The standard RK approximation is then utilized to approximate the smooth part of the solution, which permits a much coarser discretization than the high‐resolution discretization needed to capture sharp solution transitions with the conventional methods. A regularization of the NN approximation is additionally introduced for discretization‐independent material responses. The effectiveness of the proposed NN‐RKPM is verified by a series of numerical verifications.

Baek, Jonghyuk↗
DOE OSTI2023

Nearly Periodic Maps and Geometric Integration of Noncanonical Hamiltonian Systems

Abstract M. Kruskal showed that each continuous-time nearly periodic dynamical system admits a formal U (1)-symmetry, generated by the so-called roto-rate. When the nearly periodic system is also Hamiltonian, Noether’s theorem implies the existence of a corresponding adiabatic invariant. We develop a discrete-time analog of Kruskal’s theory. Nearly periodic maps are defined as parameter-dependent diffeomorphisms that limit to rotations along a U (1)-action. When the limiting rotation is non-resonant, these maps admit formal U (1)-symmetries to all orders in perturbation theory. For Hamiltonian nearly periodic maps on exact presymplectic manifolds, we prove that the formal U (1)-symmetry gives rise to a discrete-time adiabatic invariant using a discrete-time extension of Noether’s theorem. When the unperturbed U (1)-orbits are contractible, we also find a discrete-time adiabatic invariant for mappings that are merely presymplectic, rather than Hamiltonian. As an application of the theory, we use it to develop a novel technique for geometric integration of non-canonical Hamiltonian systems on exact symplectic manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Extended isogeometric analysis of multi-material and multi-physics problems using hierarchical B-splines

Here, this paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate conformal meshes, this work uses an extended finite element method (XFEM) to discretize the governing equations on non-conforming, embedding meshes. A flexible approach to create truncated hierarchical B-splines discretizations is presented. This approach enables the refinement of each state variable field individually to meet field-specific accuracy requirements. To obtain an immersed geometry representation that is consistent across all hierarchically refined B-spline discretizations, the geometry is immersed into a single mesh, the XFEM background mesh, which is constructed from the union of all hierarchical B-spline meshes. An extraction operator is introduced to represent the truncated hierarchical B-spline bases in terms of Lagrange shape functions on the XFEM background mesh without loss of accuracy. The truncated hierarchical B-spline bases are enriched using a generalized Heaviside enrichment strategy to accommodate small geometric features and multi-material problems. The governing equations are augmented by a formulation of the face-oriented ghost stabilization enhanced for locally refined B-spline bases. We present examples for two- and three-dimensional linear elastic and thermo-elastic problems. The numerical results validate the accuracy of our framework. The results also demonstrate the applicability of the proposed framework to large, geometrically complex problems.

42 ENGINEERING↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Phase Inversion in a Two-phase, BCC+B2, Refractory High Entropy Alloy

A phenomenon of "phase inversion", presumably the first ever experimental evidence in metallic alloys, is shown in a refractory high entropy alloy (RHEA), Al0.5NbTa0.8Ti1.5V0.2Zr. Phase inversion in crystalline solid systems is driven by the differences in elastic modulus of the two phases. Quenching from a high-temperature single phase field, the RHEA exhibits a co-continuous mixture of a disordered BCC and an ordered B2 phase, that upon isothermal annealing at 600°C develops via spinodal decomposition into a continuous B2 matrix with discrete cuboidal BCC precipitates aligned along the <001> directions. Longer term annealing at 600°C results in the development of necking constrictions along the B2 channels, eventually pinching-off these channels and making the BCC phase continuous with discrete B2 precipitates. This inversion the process can be related to the simultaneous operation of two processes:(i) spheroidization of the initially discrete cuboidal BCC precipitates driven by a reduction in the total interface energy and (ii) an increase in the stiffness of the B2 phase, relative to the BCC phase, due to chemical composition changes during annealing, forcing the B2 regions to become discrete driven by the reduction in the total elastic strain energy.

Soni, Vishal↗
DOE OSTI2024

Griffin: A MOOSE-based reactor physics application for multiphysics simulation of advanced nuclear reactors

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor physics application for multiphysics simulations of advanced reactor designs jointly developed by Idaho National Laboratory and Argonne National Laboratory. This paper summarizes the motivation, significance, architecture, design, and features of Griffin. Griffin offers flexible and extensible features to address the challenges associated with advanced reactor designs. These features range from fundamental particle transport to specific reactor physics tasks. The features cover a wide range including on-the-fly and traditional two-step cross-section generation methods, steady-state and transient transport solvers suitable for both heterogeneous and homogeneous models, high-fidelity depletion where thousands of isotopes can be tracked and low-fidelity depletion characterized by burnup, etc. The most fundamental aspect that sets Griffin apart from other reactor analysis codes is that it is developed based on the MOOSE framework. A modular development approach is strongly enforced, with multiphysics being an essential element considered since the beginning of Griffin’s development. Griffin links various MOOSE physics modules and couples to other MOOSE-based applications and non-MOOSE-based applications for multiphyiscs simulations. Griffin includes three modules: ISOXML for preparing and managing multigroup cross sections, radiation transport for solving the neutron transport equation, and reactor analysis for user-oriented reactor physics analysis functionalities. Griffin uses various finite element methods for spatial discretization, multigroup approximation for energy discretization and discrete ordinates method, spherical harmonics expansion method, and diffusion approximation for streaming direction discretization to solve the neutron transport equation. Griffin’s flexibility is evidenced through Griffin’s various applications to fast reactor, high-temperature reactor, pebble bed reactor, molten salt reactor, and microreactor designs. Griffin development follows the software quality assurance procedure for MOOSE-based applications and with software requirements consistent with the ASME NQA-1 standard. Griffin has been adopted into the reactor analysis system for the U.S. NRC and is in use at U.S. companies, universities and national laboratories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An asymptotically compatible treatment of traction loading in linearly elastic peridynamic fracture

Meshfree discretizations of state-based peridynamic models are attractive due to their ability to naturally describe fracture of general materials. However, two factors conspire to prevent meshfree discretizations of state-based peridynamics from converging to corresponding local solutions as resolution is increased: quadrature error prevents an accurate prediction of bulk mechanics, and the lack of an explicit boundary representation presents challenges when applying traction loads. Herein, we develop a reformulation of the linear peridynamic solid (LPS) model to address these shortcomings, using improved meshfree quadrature, a reformulation of the nonlocal dilatation, and a consistent handling of the nonlocal traction condition to construct a model with rigorous accuracy guarantees. In particular, these improvements are designed to enforce discrete consistency in the presence of evolving fractures, whose a priori unknown location render consistent treatment difficult. In the absence of fracture, when a corresponding classical continuum mechanics model exists, our improvements provide asymptotically compatible convergence to corresponding local solutions, eliminating surface effects and issues with traction loading which have historically plagued peridynamic discretizations. When fracture occurs, our formulation automatically provides a sharp representation of the fracture surface by breaking bonds, avoiding the loss of mass. We provide rigorous error analysis and demonstrate convergence for a number of benchmarks, including manufactured solutions, free-surface, nonhomogeneous traction loading, and composite material problems. Finally, we validate simulations of brittle fracture against a recent experiment of dynamic crack branching in soda-lime glass, providing evidence that the scheme yields accurate predictions for practical engineering problems.

42 ENGINEERING↗
DOE OSTI2025

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗
DOE OSTI2024

Simulations of flaming combustion and flaming-to-smoldering transition in wildland fire spread at flame scale

Our objective in the present study is to provide basic insights into the coupling between external-gas and solid biomass vegetation processes that control the dynamics of flame spread in wildland fire problems. Here we focus on a modeling approach that resolves processes occurring at vegetation and flame scales, i.e., the formation of flammable vapors due to the thermal degradation of the solid biomass, the subsequent combustion in ambient air, the thermal feedback to the biomass through radiative and convective heat transfer, and the possible transition from flaming combustion (taking place outside of the solid biomass) to smoldering combustion (taking place inside the solid biomass). The capability uses a multiphase combustion framework and treats external-gas processes through a Large Eddy Simulation solver and solid biomass processes through a discrete particle model. The discrete particle model adopts a one-dimensional porous medium formulation, includes descriptions of drying, thermal pyrolysis, oxidative pyrolysis, and char oxidation, as well as a description of the external-gas-to-solid-biomass diffusion of oxygen mass; the discrete particle model thereby provides a treatment of in-depth oxidative processes and allows the simulation of smoldering combustion. The modeling capability is applied to the simulation of fire spread across a surrogate biomass vegetation bed corresponding to a discrete array of cylindrical-shaped, vertically-oriented, pine wood sticks, characterized by a monomodal size distribution, in horizontal flat terrain and under wind-aided conditions. The numerical results demonstrate that the model can simulate successful flaming-to-smoldering transition followed by complete biomass consumption.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2020

A conservative phase-space moving-grid strategy for a 1D-2V Vlasov–Fokker–Planck Solver

In this work, we develop a conservative configuration- and velocity-space (i.e., phase-space) moving-grid strategy for the Vlasov–Fokker–Planck (VFP) equation in a planar geometry. The velocity-space grid is normalized and shifted in terms of the thermal speed and the bulk-fluid velocity, respectively. The configuration-space grid is moved according to a mesh-motion-partial-differential equation (MMPDE), which equidistributes a monitor function that is inversely proportional to the gradient-length scales of the macroscopic plasma quantities. The resulting inertial terms in the transformed VFP equations are discretized to ensure the discrete conservation of mass, momentum, and energy. To satisfy the discrete conservation theorems in the presence of phase-space mesh motion, we employ the method of discrete nonlinear constraints – explored in previous studies – but the underlying symmetries are determined in a much more efficient manner than before. The conservative grid-adaptivity strategy provides an efficient scheme that resolves important physical structures in the phase-space while controlling the computational complexity at all times. We demonstrate the favorable features of the proposed algorithm through a set of test cases of increasing complexity. The problems test independent components of the algorithms, as well as the integrated capability on settings relevant to inertial confinement fusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗