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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Discretization Error Estimation and Control for Farfield Acoustic Signatures

We investigate the utility of adjoint-based error estimates for sonic boom farfield simulations governed by solutions of the augmented Burgers’ equation. Solution of this nonlinear system uses operator splitting with a second-order finite volume discretization in space and second-order Runge-Kutta time marching, while the absorption and molecular relaxation are solved using second-order central differencing. The discretization error in selected ground sonic boom cost functionals is estimated using the method of adjoint-weighted residuals. Key elements of the implementation process are emphasized with details provided on the practical aspects as appliedto the sonic boom farfield propagation. We establish the accuracy of the adjoint solutions usingcomplex step and finite difference approaches, and examine the accuracy of the error estimates using analytical N-wave solutions. We then apply it to a pressure waveform corresponding to the X-59 research aircraft. The investigations demonstrate that the method of adjoint-weighted residuals accurately predicts the level of discretization error present in sonic boom farfield simulations while offering insight into which features of the near field signal are the primary drivers of ground noise metrics. The numerical results indicate that at sampling frequencies as low as50kHz, discretization error in the propagation is under 0.01 dB[A] for realistically complex examples.

CST↗
DOE OSTI2021

A series representation of the discrete fractional Laplace operator of arbitrary order

Although fractional powers of non-negative operators have received much attention in recent years, there is still little known about their behavior if real-valued exponents are greater than one. In this article, we define and study the discrete fractional Laplace operator of arbitrary real-valued positive order. Here a series representation of the discrete fractional Laplace operator for positive non-integer powers is developed. Its convergence to a series representation of a known case of positive integer powers is proven as the power tends to the integer value. Furthermore, we show that the new representation for arbitrary real-valued positive powers of the discrete Laplace operator is consistent with existing theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Simulation of coupled multiphase flow and geomechanics in porous media with embedded discrete fractures

In fractured natural formations, the equations governing fluid flow and geomechanics are strongly coupled. Hydrodynamical properties depend on the mechanical configuration, and they are therefore difficult to accurately resolve using uncoupled methods. In recent years, significant research has focused on discretization strategies for these coupled systems, particularly in the presence of complicated fracture network geometries. In this work, we explore a finite-volume discretization for the multiphase flow equations coupled with a finite-element scheme for the mechanical equations. Fractures are treated as lower dimensional surfaces embedded in a background grid. Interactions are captured using the embedded discrete fracture model (EDFM) and the embedded finite element method (EFEM) for the flow and the mechanics, respectively. This nonconforming approach significantly alleviates meshing challenges. EDFM considers fractures as lower dimension finite volumes that exchange fluxes with the rock matrix cells. The EFEM method provides, instead, a local enrichment of the finite-element space inside each matrix cell cut by a fracture element. Both the use of piecewise constant and piecewise linear enrichments are investigated. They are also compared to an extended finite element approach. One key advantage of EFEM is the element-based nature of the enrichment, which reduces the geometric complexity of the implementation and leads to linear systems with advantageous properties. Synthetic numerical tests are presented to study the convergence and accuracy of the proposed method. It is also applied to a realistic scenario, involving a heterogeneous reservoir with a complex fracture distribution, to demonstrate its relevance for field applications.

58 GEOSCIENCES↗
DOE OSTI2021

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗
DOE OSTI2024

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2025

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

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

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Structure preservation using discrete gradients in the Vlasov-Poisson-Landau system

We present a novel structure-preserving framework for solving the Vlasov-Poisson-Landau system of equations using a particle in cell (PIC) discretization combined with discrete gradient time integrators. The Vlasov-Poisson-Landau system is an accurate model for studying hot plasma dynamics at a kinetic scale where small-angle Coulomb collisions dominate. Our scheme guarantees conservation of mass, momentum and energy as well as preservation of the monotonicity of entropy production in both the time-continuous and discrete systems. We employ the conservative integrator for both the Hamiltonian Vlasov-Poisson equations and the dissipative Landau equation using the PETSc library (www.mcs.anl.gov/petsc) to showcase structure-preserving properties.

Discrete gradients↗
DOE OSTI2021

Comparing numerical accuracy and stability for different horizontal discretizations in MPAS-Ocean

This manuscript investigates the effectiveness of two possible horizontal discretizations for the global ocean model MPAS-Ocean, both applied to Spherical Centroidal Voronoi Tessellations (SCVTs). The first discretization is TRiSK, a C-grid, finite-volume method, that possesses many desirable mimetic properties, but has a low order accuracy. The second discretization was introduced for the first time by Peixoto (2016), and consists of modifications to the TRiSK scheme designed to achieve at least first-order accuracy in the L ∞ norm, with the loss of some of the mimetic properties. Tests on shallow-water and primitive-equation models show that the scheme due to Peixoto is indeed more accurate, but presents stability issues with respect to TRiSK. Here, TRiSK is indeed found to be often more stable in time and more robust with respect to errors in the geometric properties of the grid.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

CHESS 2025: Discrete-return LiDAR point clouds from NEON AOP surveys

This dataset provides Level 1 (L1) discrete-return light detection and ranging (LiDAR) point cloud data collected for the 2025 Colorado Headwaters Ecological Spectroscopy Study (CHESS). These data were acquired to enable characterization of vegetation structure and other three-dimensional features of the land surface, and to evaluate structural changes that may have occurred between a prior LiDAR acquisition in 2018 and the 2025 overflight. The data were acquired over three study domains in the Upper Gunnison river basin: the upper East River watershed (CRBU); Almont Triangle and Taylor Canyon (ALMO); and Upper Taylor River watershed (UPTA) between 2025-06-13 and 2025-07-15. LiDAR data were acquired using the Optech Galaxy Prime Airborne LiDAR Terrain Mapper onboard the National Ecological Observatory Network (NEON) Airborne Observation Platform (AOP). These are the primary unclassified discrete-return LiDAR data delivered by NEON and are provided per flightline as LASzip (LAZ) 1.4 Format 6 files. Data were processed following the workflow described in the NEON L0-to-L1 Discrete Return LiDAR Algorithm Theoretical Basis Document (Krause and Goulden 2022). Each record in the unclassified point clouds represents a geolocated laser target/return recorded by the LiDAR system, with values for X, Y, Z position and return intensity. All point coordinates are provided in meters. Horizontal coordinates are referenced in Universal Transverse Mercator (UTM) zone 13N and the World Geodetic System (WGS) 1984 ensemble datum. Elevations are referenced to Geoid12A. Flight metadata describing flightline boundaries and positional uncertainty by point are also included. CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗
NASA NTRS2020

Spectral Spherical Harmonics Discrete Ordinate Method

A new method for modeling the radiative transfer in inhomogeneous three-dimensional media illuminated by a Gaussian beam is described. This approach, called the Spectral Spherical Harmonics Discrete Ordinate Method (SSHDOM), uses the Fourier expansion method to transform the three-dimensional radiative transfer into an one-dimensional equation in the spectral domain, and the Spherical Harmonics Discrete Ordinate Method (SHDOM) for its solution. Specifically, (i) the source function is represented in the spectral domain through a spherical harmonic expansion, (ii) the spectral one-dimensional radiative transfer equation is integrated along discrete ordinates through a spatial grid, and (iii) the solution method is based on the Picard iteration. Both SSHDOM and SHDOM algorithms are implemented in a common computer code.

Gaussian beam↗
DOE OSTI2022

First-collision source treatment for ray effect mitigation in discrete-ordinate radiation transport solutions

Deterministic transport codes play a fundamental role in the modelling and simulation of neutron transport. One of the most common deterministic methods is the method of discrete ordinates, also known as the S method. While offering significant advantages over other deterministic methods or stochastic methods like Monte Carlo, the method of discrete ordinates suffers from non-physical artifacts in its local solution due to its discretization of angle. These artifacts, referred to as ray effects because of their ray-like appearance, tend to be worse in problems with small sources in areas with little scattering. Significant effort has gone into developing methods to mitigate ray effects, such as the first-collision source treatment, which separates the angular flux into the uncollided and collided fluxes and solving them using non-traditional techniques such as ray tracing. One such code capable of doing this is Lawrence Livermore National Laboratory's deterministic transport code ARDRA. Current ray tracing methods typically trace to a set of points inside a zone to compute an overall flux. However, this approach has significant drawbacks, such as a low order of convergence and not being conservative. Therefore, a new method has been developed that traces instead to a set of points on each of a zone's surfaces and computing the currents, before using these to obtain the flux. A comparison between these two ray tracing methods showed significant advantages to the new surface method, including inherent conservation, a higher convergence rate, and an increase in calculable information like leakage. This work performed under the auspices of the U.S. Department of Energy by Lawrence Liver- more National Laboratory under Contract DE-AC52-07NA27344. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Simulations of neutron noise in the research reactor AKR-2: comparison between a discrete ordinates and a diffusion-based method

A diffusion-based and a discrete ordinates method are used to simulate a neutron noise experiment in the research reactor AKR-2 at the Technical University in Dresden, Germany. The AKR-2 reactor provides an interesting case for the comparison between the two methods because it is characterized by large heterogeneities and regions with low macroscopic neutron cross-sections. For the calculations, the same spatial discretization and the same set of two-energy macroscopic neutron cross-sections with isotropic scattering are used. Significant discrepancies between the diffusion-based and discrete ordinates methods are found in regions of the systems where the diffusion approximation is expected to be inaccurate in reproducing characteristics of the static neutron flux and neutron noise. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Probabilistic Discrete‐Time Models for Spreading Processes in Complex Networks: A Review

Abstract Research into network dynamics of spreading processes typically employs both discrete and continuous time methodologies. Although each approach offers distinct insights, integrating them can be challenging, particularly when maintaining coherence across different time scales. This review focuses on the Microscopic Markov Chain Approach (MMCA), a probabilistic f ramework originally designed for epidemic modeling. MMCA uses discrete dynamics to compute the probabilities of individuals transitioning between epidemiological states. By treating each time step—usually a day—as a discrete event, the approach captures multiple concurrent changes within this time frame. The approach allows to estimate the likelihood of individuals or populations being in specific states, which correspond to distinct epidemiological compartments. This review synthesizes key findings from the application of this approach, providing a comprehensive overview of its utility in understanding epidemic spread.

Granell, Clara↗
DOE OSTI2021

Discreteness and integrality in Conformal Field Theory

Various observables in compact CFTs are required to obey positivity, discreteness, and integrality. Positivity forms the crux of the conformal bootstrap, but understanding of the abstract implications of discreteness and integrality for the space of CFTs is lacking. We systematically study these constraints in two-dimensional, non-holomorphic CFTs, making use of two main mathematical results. First, we prove a theorem constraining the behavior near the cusp of integral, vector-valued modular functions. Second, we explicitly construct non-factorizable, non-holomorphic cuspidal functions satisfying discreteness and integrality, and prove the non-existence of such functions once positivity is added. Application of these results yields several bootstrap-type bounds on OPE data of both rational and irrational CFTs, including some powerful bounds for theories with conformal manifolds, as well as insights into questions of spectral determinacy. We prove that in rational CFT, the spectrum of operator twists t ≥ c/12 is uniquely determined by its complement. Likewise, we argue that in generic CFTs, the spectrum of operator dimensions Δ > c–1/12 is uniquely determined by its complement, absent fine-tuning in a sense we articulate. Finally, we discuss implications for black hole physics and the (non-)uniqueness of a possible ensemble interpretation of AdS 3 gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Continuous and discrete modeling of HIV-1 decline on therapy

Mathematical models have shed light on the dynamics of HIV- 1 infection in vivo. In this paper, we generalize continuous mathematical models of drug therapy for HIV-1 by Perelson et al. (Science 271:1582–1586, 1996) and Perelson and Nelson (SIAM Rev 41:3–44, 1999) on time scales, i.e., a nonempty closed subset of real numbers in order to derive new discrete models that predict the total concentration of plasma virus as a function of time. Here, one of our main goals is to compare discrete mathematical models with the continuous model in Perelson et al. (1996) where HIV infected patients were given protease inhibitors and sampled frequently thereafter. For the comparison, we use experimental data collected in Perelson et al. (1996) and estimate the parameters such as the virion clearance rate and the rate of loss of infected cells by fitting the total concentration of plasma virus to this data set. Our results show that discrete systems describe the best fit. In the previous models of this study, the efficacy of protease inhibitor is assumed to be perfect. Motivated by Perelson and Nelson (1999), we end the paper with a mathematical model of imperfect protease inhibitor and reverse transcriptase (RT) inhibitor combination therapy of HIV-1 infection on time scales with its stability analysis.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

A New Simplified Discrete Fracture Model for Shearing of Intersecting Fractures and Faults

Abstract Shearing of fractures and faults is important because it can result in permeability change or even induce seismicity—both are keys for efficient and safe energy recovery and storage in Earth systems. Quantitative analysis of shearing of intersecting fractures and faults is challenging because it can involve dynamic frictional contacts that are complicated by deformation of the rock matrix. To predict the shearing of intersecting fractures/faults, we attempt to answer the question of how intersections impact the shearing of a fracture network and whether we can simplify the description as compared to classical discrete fracture network (DFN) models. To answer these questions, we conducted a series of numerical simulations on scenarios for variable numbers of intersecting fractures. All these examples yield consistent results: the results of using DFNs are consistent with those of using hypothetical major paths. This leads to a new model, which we name simplified discrete fracture network model , to analyze shearing of intersecting fractures/faults using major path(s). We found that the intersections of fractures do not fundamentally change the shearing of two intersecting fractures if the intersecting angles are small. Furthermore, increasing the number of fractures/faults may relax the stress as more fractures/faults become available for shearing and distributing the stress. The simplified DFN model, which can capture efficiently the shearing behavior of each major paths from a large number of intersecting fractures/faults, will be a promising conceptual model that is complementary to existing equivalent continuum and discrete fracture models to analyze shearing of intersecting fractures/faults.

58 GEOSCIENCES↗
DOE OSTI2023

Linearization errors in discrete goal-oriented error estimation

This paper is concerned with goal-oriented a posteriori error estimation for nonlinear functionals in the context of nonlinear variational problems solved with continuous Galerkin finite element discretizations. A two-level, or discrete, adjoint-based approach for error estimation is considered. The traditional method to derive an error estimate in this context requires linearizing both the nonlinear variational form and the nonlinear functional of interest which introduces linearization errors into the error estimate. In this paper, we investigate these linearization errors. In particular, we develop a novel discrete goal-oriented error estimate that accounts for traditionally neglected nonlinear terms at the expense of greater computational cost. We demonstrate how this error estimate can be used to drive mesh adaptivity. Here, we show that accounting for linearization errors in the error estimate can improve its effectivity for several nonlinear model problems and quantities of interest. We also demonstrate that an adaptive strategy based on the newly proposed estimate can lead to more accurate approximations of the nonlinear functional with fewer degrees of freedom when compared to uniform refinement and traditional adjoint-based approaches.

42 ENGINEERING↗