Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Discretization error”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Discrete element modeling of switchgrass particles under compression and rotational shear

Switchgrass is a perennial herbaceous plant regarded as a biomass energy crop in the United States for its highadaptability and yield potential. Processing and handling of switchgrass particles are challenging due to the erratic mechanical and flow behavior originating from their intrinsic particulate properties. Here, we present a bonded-sphere discrete element model designed specifically for switchgrass particles. The model simultaneously captures three key particulate features, i.e., fibrous particle shapes, a wide range of particle sizes, and particle deformability. Realistic yet computationally efficient particle shape templates are created based on the image analysis data of switchgrass specimens. A fitting procedure is proposed to ensure both the particle width and length distributions are captured, a unique requirement for fibrous particles. Two full-scale numerical models, i.e., a uniaxial compression model and a Schulze ring shear model, are developed using information fromphysical experiments. The model is calibrated using experimental data of chopped-small switchgrass specimens, and then, is validated using data of chopped-large specimens in both compression and ring-shear tests. Numerical results show that the numerical models capture bulk densities accurately (with an error of 3%) while slightly underestimate the bulk friction angle. Furthermore, an extensive sensitivity analysis reveals that (1) switchgrass particles with rougher edges (due to different processing techniques) exhibit a higher shear strength and a lower flowability; (2) stiffer particles yield a lower bulk density (up to 21% lower) compared to more deformable particles, indicating particle deformability should be incorporated when modeling biomass flow in a preprocessing system.

09 BIOMASS FUELS↗
DOE OSTI2023

Aggregation of Leslie matrix models with application to ten diverse animal species

Some grouping is necessary when constructing a Leslie matrix model because it involves discretizing a continuous process of births and deaths. Here, the level of grouping is determined by the number of age classes and frequency of sampling. It is largely unknown what is lost or gained by using fewer age classes, and I address this question using aggregation theory. I derive an aggregator for a Leslie matrix model using weighted least squares, determine what properties an aggregated matrix inherits from the original matrix, evaluate aggregation error, and measure the influence of aggregation on asymptotic and transient behaviors. To gauge transient dynamics, I employ reactivity of the standardized Leslie matrix. I apply the aggregator to 10 Leslie models developed for animal populations drawn from a diverse set of species. Several properties are inherited by the aggregated matrix: (a) it is a Leslie matrix; (b) it is irreducible whenever the original matrix is irreducible; (c) it is primitive whenever the original matrix is primitive; and (d) its stable population growth rate and stable age distribution are consistent with those of the original matrix if the least squares weights are equal to the original stable age distribution. In the application, depending on the population modeled, when the least squares weights do not follow the stable age distribution, the stable population growth rate of the aggregated matrix may or may not be approximately consistent with that of the original matrix. Transient behavior is lost with high aggregation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

DEM Modeling and Validation of Pebble Bed Packing Using Chrono::GPU

Accurate prediction of pebble packing structure is important for pebble bed reactors because the spatial distribution of void fraction directly affects coolant flow, pressure drop, heat transfer, and neutronic behavior. However, experimentally validated DEM studies that directly evaluate local void-fraction structure in reactor-relevant pebble beds remain limited. In this work, the pebble bed experiment conducted at Missouri University of Science and Technology is simulated using the graphics processing unit (GPU)-based discrete element method (DEM) code Chrono::GPU. The study focuses on evaluating the ability of Chrono::GPU to reproduce the packing arrangement and void-fraction distribution of a randomly packed spherical pebble bed. The DEM results are first verified against established radial void-fraction correlations, including the Mueller and Vortmeyer-Schuster models, to assess the predicted bulk porosity, near-wall behavior, and oscillatory packing structure. The simulation is then verified against reference DEM data and validated against gamma-ray computed tomography (CT) experimental data at three axial locations. The Chrono::GPU results reproduce the main features of the experimental packing, including the high void fraction near the wall, the first near-wall trough, and the damped oscillatory radial profile caused by wall-induced ordering. Quantitative comparison with DEM data and the CT-based radial profiles shows good agreement, with mean absolute errors on the order of 0.07 and root-mean-square errors below 0.09 for the averaged profiles. These results demonstrate that Chrono::GPU can accurately capture the void-fraction structure of spherical pebble beds and provides a reliable DEM framework for future pebble bed reactor packing, recycling, and thermal-hydraulic studies.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications

This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Prediction of hemiwicking dynamics in micropillar arrays

Dynamic hemiwicking behavior is observable in both nature and a wide range of industrial applications ranging from biomedical devices to thermal management. We present a semi-analytical modeling framework (without empirical fitting coefficients) to predict transient capillary-driven hemiwicking behavior of a liquid through a nano/microstructured surface, specifically a micropillar array. In our model framework, the liquid domain is discretized into micropillar unit cells to enable the time marching of the hemiwicking front. A simplified linear pressure drop is assumed along the hemiwicking length such that the local meniscus curvature, contact angle, and effective liquid height are determined at each time step in our transient model. This semi-analytical model is validated with experimental data from our own experiments and from published literature for different fluids. Our model predicts hemiwicking dynamics with <20% error over a broad range of micropillar geometries with height-to-pitch ratio ranging between ≈0.34 and 6.7 and diameter-to-pitch ratio in the range of ≈0.25–0.7 and without any fitting parameters. For lower diameter-to-pitch ratio data points related to sparse micropillar array arrangements, we suggest modifications to the semi-analytical model. This work sheds light on complex and dynamic solid–liquid–vapor interfacial interactions which could serve as a guide for the design of textured surfaces for wicking enhancement in multi-phase thermal and mass transport technologies and applications.

Mechanics↗
DOE OSTI2024

Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian

We provide an explicit recursive divide-and-conquer approach for simulating quantum dynamics and derive a discrete first-quantized nonrelativistic QED Hamiltonian based on the many-particle Pauli-Fierz Hamiltonian. We apply this recursive divide-and-conquer algorithm to this Hamiltonian and compare it to a concrete simulation algorithm that uses qubitization. Our divide-and-conquer algorithm, using lowest-order Trotterization, scales for fixed grid spacing as O ~ ( Λ N 2 η 2 t 2 / ϵ ) for grid size N , η particles, simulation time t , field cutoff Λ , and error ϵ . Our qubitization algorithm scales as O ~ ( N ( η + N ) ( η + Λ 2 ) t log ( 1 / ϵ ) ) . This shows that even a naive partitioning and low-order splitting formula can yield, through our divide-and-conquer formalism, superior scaling to qubitization for large Λ . We compare the relative costs of these two algorithms on systems that are relevant for applications such as the spontaneous emission of photons and the photoionization of electrons. We observe that for different parameter regimes, one method can be favored over the other. Finally, we give new algorithmic and circuit-level techniques for gate optimization, including a new way of implementing a group of multicontrolled- X gates that can be used for better analysis of circuit cost. Published by the American Physical Society 2024

Mukhopadhyay, Priyanka (ORCID:0000000164639100)↗
DOE OSTI2026

Profusion of symmetry-protected qubits from stable ergodicity breaking

We show how combining a discrete symmetry with topological Hilbert space fragmentation can give rise to exponentially many topologically stable qubits protected by a single discrete symmetry. We illustrate this explicitly with the example of the CZ𝑝 model, where the encoded qubits are prethermally stable to arbitrary symmetry-respecting perturbations for parametrically long times, substantially enhancing the robustness of a recently proposed construction based on nontopological fragmentation. In this model, the encoded qubits naturally come in pairs for which a universal set of transversal logical gates can be performed, ruling out (by the Eastin-Knill theorem) the possibility of using them for quantum error correction. We also comment on the combination of symmetry enrichment and topological fragmentation more generally, and the implications for use of systems exhibiting Hilbert space fragmentation as quantum memories.

kinetically constrained models↗
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

Control optimization for parametric Hamiltonians by pulse reconstruction

Optimal control techniques provide a means to tailor the control pulses required to generate customized quantum gates, which helps to improve the resilience of quantum simulations to gate errors and device noise. However, the significant amount of (classical) computation required to generate customized gates can quickly undermine the effectiveness of this approach, especially when pulse optimization needs to be iterated. We propose a method to reduce the computational time required to generate the control pulse for a Hamiltonian that is parametrically dependent on a time-varying quantity. We use simple interpolation schemes to accurately reconstruct the control pulses from a set of pulses obtained in advance for a discrete set of predetermined parameter values. We obtain a reconstruction with very high fidelity and a significant reduction in computational effort. We report the results of the application of the proposed method to device-level quantum simulations of the unitary (real) time evolution of two interacting neutrons based on superconducting qubits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Parametric reduced order models for graded lattice structures

Graded lattice structures, characterized by smoothly varying mechanical properties, hold significant promise for optimizing material distribution in advanced engineering applications. However, accurately modeling these structures poses substantial computational challenges due to the continuous geometric variations within their unit cells. Here, to address these challenges, this paper introduces a novel Efficient Reduced Order Model (EROM) that integrates the Matrix Discrete Empirical Interpolation Method (MDEIM) and Discrete Empirical Interpolation Method (DEIM) with polynomial regression to efficiently manage geometric parametrization in lattice structures. Unlike traditional reduced order models (ROMs) that require extensive precomputed libraries for each geometric configuration, our approach enables continuous geometric variations through a flexible algebraic formulation, significantly reducing computational costs while preserving high accuracy. The method constructs projection matrices for individual unit cells that can be efficiently assembled into global systems, leveraging the repetitive nature of lattice structures. Numerical studies demonstrate that our EROM achieves displacement errors below 1% and von Mises stress prediction errors below 4%, coupled with computational speedups exceeding two orders of magnitude compared to full-order simulations. The proposed method's modularity and scalability make it particularly suitable for design optimization and real-time simulation of functionally graded lattice structures, with applications spanning aerospace to biomedical engineering.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

A Statistical Interpolation Code for Ocean Analysis and Forecasting

Abstract We present a data assimilation package for use with ocean circulation models in analysis, forecasting, and system evaluation applications. The basic functionality of the package is centered on a multivariate linear statistical estimation for a given predicted/background ocean state, observations, and error statistics. Novel features of the package include support for multiple covariance models, and the solution of the least squares normal equations either using the covariance matrix or its inverse—the information matrix. The main focus of this paper, however, is on the solution of the analysis equations using the information matrix, which offers several advantages for solving large problems efficiently. Details of the parameterization of the inverse covariance using Markov random fields are provided and its relationship to finite-difference discretizations of diffusion equations are pointed out. The package can assimilate a variety of observation types from both remote sensing and in situ platforms. The performance of the data assimilation methodology implemented in the package is demonstrated with a yearlong global ocean hindcast with a 1/4° ocean model. The code is implemented in modern Fortran, supports distributed memory, shared memory, multicore architectures, and uses climate and forecasts compliant Network Common Data Form for input/output. The package is freely available with an open source license from www.tendral.com/tsis/ .

Srinivasan, Ashwanth↗
DOE OSTI2020

NEON AOP foliar trait maps, maps of model uncertainty estimates, and conifer map, East River, CO 2018

This data package contains mapped trait estimates and their uncertainties, and conifer map, for the National Ecological Observatory Network's Airborne Observation Platform survey data acquired over the Upper East River, Colorado in 2018. For full details, please see associated reference. in brief, trait models were developed independently for needle and non-needle leaf species using partial least squares regression (PLSR) using ground data from additional datasets: doi:10.15485/1618130, doi:10.15485/1618132, and doi:10.15485/1631278, merged with extracted spectral data from doi:10.15485/1618131. We separated vegetated pixels into needle and non-needle classes in order to generate a classification map based on the spectral differences between these leaf types (conifer.tif). We trained a deep learning model with custom architecture, detailed in Chadwick et al. In Press. The model performed with 0.998 true positive rate and 0.982 true negative rate, with ‘positives’ being non-needle identification. We then utilized PLSR to generate models of foliar traits for each leaf type. So that we could also map uncertainty in these predictions, we generated ten different models for needle and non-needle leaf species using different testing holdout sets of discrete sites. Each of these models was developed with a 100-fold cross validation procedure that utilized a 70% training set and 30% validation set with each fold, and then assessed based on the 10% of testing sites that were not included in that model’s development. The mean predicted value across the 10 models is used for the trait estimate in each pixel across the study area. The models are applied according to the leaf type designation in the conifer.tif map. The errors are the standard deviation across the 10 different models developed, with high error suggesting instability in model prediction and areas where values may not be reliable for ecological inference. These maps are only applied to areas with a NDVI > 0.5 to exclude non-vegetated areas. Shade masks could be applied to these data (doi:10.15485/1618131), but have not been for this data package. These data are also available on Google Earth Engine: https://code.earthengine.google.com/?asset=users/kdc/ER_NEON

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

An adaptive, data-driven multiscale approach for dense granular flows

The accuracy of coarse-grained continuum models of dense granular flows is limited by the lack of high-fidelity closure models for granular rheology. One approach to addressing this issue, referred to as the hierarchical multiscale method, is to use a high-fidelity fine-grained model to compute the closure terms needed by the coarse-grained model. The difficulty with this approach is that the overall model can become computationally intractable due to the high computational cost of the high-fidelity model. In this work, we describe a multiscale modeling approach for dense granular flows that utilizes neural networks trained using high-fidelity discrete element method (DEM) simulations to approximate the constitutive granular rheology for a continuum incompressible flow model. Our approach leverages an ensemble of neural networks to estimate predictive uncertainty that allows us to determine whether the rheology at a given point is accurately represented by the neural network model. Additional DEM simulations are only performed when needed, minimizing the number of additional DEM simulations required when updating the rheology. This adaptive coupling significantly reduces the overall computational cost of the approach while controlling the error. In addition, the neural networks are customized to learn regularized rheological behavior to ensure well-posedness of the continuum solution. We first validate the approach using two-dimensional steady-state and decelerating inclined flows. We then demonstrate the efficiency of our approach by modeling three-dimensional sub-aerial granular column collapse for varying initial column aspect ratios, where our multiscale method compares well with the computationally expensive computational fluid dynamics (CFD)-DEM simulation.

Dense granular flows↗
DOE OSTI2021

Distributed State Estimation Over Time-Varying Graphs: Exploiting the Age-of-Information

Here, we study the problem of designing a distributed observer for an LTI system over a time-varying communication graph. The limited existing work on this topic imposes various restrictions either on the observation model or on the sequence of communication graphs. In contrast, we propose a single-time-scale distributed observer that works under mild assumptions. Specifically, our communication model only requires strong-connectivity to be preserved over non-overlapping, contiguous intervals that are even allowed to grow unbounded over time. We show that under suitable conditions that bound the growth of such intervals, joint observability is sufficient to track the state of any discrete-time LTI system exponentially fast, at any desired rate. We also develop a variant of our algorithm that is provably robust to worst-case adversarial attacks, provided the sequence of graphs is sufficiently connected over time. The key to our approach is the notion of a "freshness-index" that keeps track of the age-of-information being diffused across the network. Such indices enable nodes to reject stale estimates of the state, and, in turn, contribute to stability of the error dynamics.

42 ENGINEERING↗
DOE OSTI2023

Numerical and boundary condition effects on the prediction of detonation engine behavior using detailed numerical simulations

High-fidelity numerical simulations of an experimental rotating detonation engine with discrete fuel/air injection were conducted. A series of configurations with different feed-plenum pressures but with constant equivalence ratio were studied. Detailed chemical kinetics for the hydrogen/air system is used. A resolution study for the full rotating detonation engine (RDE) system simulation is also conducted. Two kinds of boundary conditions, a total pressure boundary and a constant mass flow rate boundary, are used to assess the effects of the inlet boundary. As mass flow rate is increased, the total pressure boundary causes more error in the axial pressure distribution while the constant mass flow rate gives a better solution for all cases ran. The simulations confirm experimental findings, and reproduce qualitative as well as some of the quantitative trends. These results demonstrate that a) fuel-air mixing is highly non-uniform within the detonation chamber, leading to variations in local equivalence ratio, b) the fuel and oxidizer injectors experience significant backflow as the detonation wave passes over, but recover at different rates which further augments the inefficiencies in mixing, and c) parasitic combustion in the mixing region makes the detonation wave weak by extending the reaction zone across the wave.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

An explicit, energy-conserving particle-in-cell scheme

We present an explicit temporal discretization of particle-in-cell schemes for the non-relativistic Vlasov equation that results in exact energy conservation when combined with an appropriate spatial discretization. The scheme is inspired by a simple, second-order explicit scheme that conserves energy exactly in the Eulerian context. We show that direct translation to particle-in-cell does not result in strict conservation, but derive a simple correction based on an analytically solvable optimization problem that recovers conservation. While this optimization problem is not guaranteed to have a real solution for every particle, we provide a correction that makes imaginary values extremely rare and still admits $\mathcal{O}$(10 –12 ) fractional errors in energy for practical simulation parameters. We present the scheme in both electrostatic – where we use the Ampère formulation – and electromagnetic contexts. With an electromagnetic field solve, the field update is most naturally linearly implicit, but the more computationally intensive particle update remains fully explicit. Here, we also show how the scheme can be extended to use the fully explicit leapfrog and pseudospectral analytic time-domain (PSATD) field solvers. The scheme is tested on standard kinetic plasma problems, confirming its conservation properties.

Energy conservation↗
DOE OSTI2020

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Autonomous stabilization with programmable stabilized state

Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗