Search NASASearch

SEARCH · Search NASA

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 55 records · Page 3

Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing

The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.

Jones, Robert L.

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Several stabilized discretization procedures for conservation law equations on triangulated domains will be considered. Specifically, numerical schemes based on upwind finite volume, fluctuation splitting, Galerkin least-squares, and space discontinuous Galerkin discretization will be considered in detail. A standard energy analysis for several of these methods will be given via entropy symmetrization. Next, we will present some relatively new theoretical results concerning congruence relationships for left or right symmetrized equations. These results suggest new variants of existing FV, DG, GLS and FS methods which are computationally more efficient while retaining the pleasant theoretical properties achieved by entropy symmetrization. In addition, the task of Jacobian linearization of these schemes for use in Newton's method is greatly simplified owing to exploitation of exact symmetries which exist in the system. These variants have been implemented in the "ELF" library for which example calculations will be shown. The FV, FS and DG schemes also permit discrete maximum principle analysis and enforcement which greatly adds to the robustness of the methods. Some prevalent limiting strategies will be reviewed. Next, we consider embedding these nonlinear space discretizations into exact and inexact Newton solvers which are preconditioned using a nonoverlapping (Schur complement) domain decomposition technique. Elements of nonoverlapping domain decomposition for elliptic problems will be reviewed followed by the present extension to hyperbolic and elliptic-hyperbolic problems. Other issues of practical relevance such the meshing of geometries, code implementation, turbulence modeling, global convergence, etc. will be addressed as needed.

Barth, Timothy

Algebraic Nonoverlapping Domain Decomposition Methods for Stabilized FEM and FV Discretizations

We consider preconditioning methods for convection dominated fluid flow problems based on a nonoverlapping Schur complement domain decomposition procedure for arbitrary triangulated domains. The triangulation is first partitioned into a number of subdomains and interfaces which induce a natural 2 x 2 partitioning of the p.d.e. discretization matrix. We view the Schur complement induced by this partitioning as an algebraically derived coarse space approximation. This avoids the known difficulties associated with the direct formation of an effective coarse discretization for advection dominated equations. By considering various approximations of the block factorization of the 2 x 2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 using MPI message passing protocol. A number of 2-D CFD calculations will be presented for both scalar advection-diffusion equations and the Euler equations discretized using stabilized finite element and finite volume methods. These results show very good scalability of the preconditioner for various discretizations as the number of processors is increased while the number of degrees of freedom per processor is fixed.

Barth, Timothy J.

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids Using Complex Variables

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

Nielsen, Eric J.

ON THE ROLE OF INVOLUTIONS IN THE DISCONTINUOUS GALERKIN DISCRETIZATION OF MAXWELL AND MAGNETOHYDRODYNAMIC SYSTEMS

The role of involutions in energy stability of the discontinuous Galerkin (DG) discretization of Maxwell and magnetohydrodynamic (MHD) systems is examined. Important differences are identified in the symmetrization of the Maxwell and MHD systems that impact the construction of energy stable discretizations using the DG method. Specifically, general sufficient conditions to be imposed on the DG numerical flux and approximation space are given so that energy stability is retained These sufficient conditions reveal the favorable energy consequence of imposing continuity in the normal component of the magnetic induction field at interelement boundaries for MHD discretizations. Counterintuitively, this condition is not required for stability of Maxwell discretizations using the discontinuous Galerkin method.

Barth, Timothy

Discrete Gust Model for Launch Vehicle Assessments

Analysis of spacecraft vehicle responses to atmospheric wind gusts during flight is important in the establishment of vehicle design structural requirements and operational capability. Typically, wind gust models can be either a spectral type determined by a random process having a wide range of wavelengths, or a discrete type having a single gust of predetermined magnitude and shape. Classical discrete models used by NASA during the Apollo and Space Shuttle Programs included a 9 m/sec quasi-square-wave gust with variable wavelength from 60 to 300 m. A later study derived discrete gust from a military specification (MIL-SPEC) document that used a "1-cosine" shape. The MIL-SPEC document contains a curve of non-dimensional gust magnitude as a function of non-dimensional gust half-wavelength based on the Dryden spectral model, but fails to list the equation necessary to reproduce the curve. Therefore, previous studies could only estimate a value of gust magnitude from the curve, or attempt to fit a function to it. This paper presents the development of the MIL-SPEC curve, and provides the necessary information to calculate discrete gust magnitudes as a function of both gust half-wavelength and the desired probability level of exceeding a specified gust magnitude.

Leahy, Frank B.

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids by Using Complex Variables

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

Nielsen, Eric J.

Exploring Discretization Error in Simulation-Based Aerodynamic Databases

This work examines the level of discretization error in simulation-based aerodynamic databases and introduces strategies for error control. Simulations are performed using a parallel, multi-level Euler solver on embedded-boundary Cartesian meshes. Discretization errors in user-selected outputs are estimated using the method of adjoint-weighted residuals and we use adaptive mesh refinement to reduce these errors to specified tolerances. Using this framework, we examine the behavior of discretization error throughout a token database computed for a NACA 0012 airfoil consisting of 120 cases. We compare the cost and accuracy of two approaches for aerodynamic database generation. In the first approach, mesh adaptation is used to compute all cases in the database to a prescribed level of accuracy. The second approach conducts all simulations using the same computational mesh without adaptation. We quantitatively assess the error landscape and computational costs in both databases. This investigation highlights sensitivities of the database under a variety of conditions. The presence of transonic shocks or the stiffness in the governing equations near the incompressible limit are shown to dramatically increase discretization error requiring additional mesh resolution to control. Results show that such pathologies lead to error levels that vary by over factor of 40 when using a fixed mesh throughout the database. Alternatively, controlling this sensitivity through mesh adaptation leads to mesh sizes which span two orders of magnitude. We propose strategies to minimize simulation cost in sensitive regions and discuss the role of error-estimation in database quality.

Aftosmis, Michael J.

Notes on Accuracy of Finite-Volume Discretization Schemes on Irregular Grids

Truncation-error analysis is a reliable tool in predicting convergence rates of discretization errors on regular smooth grids. However, it is often misleading in application to finite-volume discretization schemes on irregular (e.g., unstructured) grids. Convergence of truncation errors severely degrades on general irregular grids; a design-order convergence can be achieved only on grids with a certain degree of geometric regularity. Such degradation of truncation-error convergence does not necessarily imply a lower-order convergence of discretization errors. In these notes, irregular-grid computations demonstrate that the design-order discretization-error convergence can be achieved even when truncation errors exhibit a lower-order convergence or, in some cases, do not converge at all.

Diskin, Boris

Discrete Data Qualification System and Method Comprising Noise Series Fault Detection

A Sensor Data Qualification (SDQ) function has been developed that allows the onboard flight computers on NASA s launch vehicles to determine the validity of sensor data to ensure that critical safety and operational decisions are not based on faulty sensor data. This SDQ function includes a novel noise series fault detection algorithm for qualification of the output data from LO2 and LH2 low-level liquid sensors. These sensors are positioned in a launch vehicle s propellant tanks in order to detect propellant depletion during a rocket engine s boost operating phase. This detection capability can prevent the catastrophic situation where the engine operates without propellant. The output from each LO2 and LH2 low-level liquid sensor is a discrete valued signal that is expected to be in either of two states, depending on whether the sensor is immersed (wet) or exposed (dry). Conventional methods for sensor data qualification, such as threshold limit checking, are not effective for this type of signal due to its discrete binary-state nature. To address this data qualification challenge, a noise computation and evaluation method, also known as a noise fault detector, was developed to detect unreasonable statistical characteristics in the discrete data stream. The method operates on a time series of discrete data observations over a moving window of data points and performs a continuous examination of the resulting observation stream to identify the presence of anomalous characteristics. If the method determines the existence of anomalous results, the data from the sensor is disqualified for use by other monitoring or control functions.

Fulton, Christopher

Discrete Aurora on the Nightside of Mars: Occurrence Location and Probability

This paper represents the first attempt to predict the occurrence location and probability of discrete electron aurora on the nightside of Mars. We run a 3-D time-dependent magnetohydrodynamic model to characterize the spatial and temporal dynamics of magnetic field and plasma distributions over the course of one planetary rotation. We perform eight simulation cases under solar minimum quiet-solar-wind conditions (four equinox/solstice seasons, each with two interplanetary magnetic field polarities) and in an actual interplanetary coronal mass ejection (ICME) case to assess quiet and space weather situations, respectively. The occurrence of detectable discrete aurora is subject to the combination of the probabilities that (a) the ionosphere is magnetically connected with high altitudes through open field lines and (b) precipitating energy fluxes of >30 eV electrons exceed 0.1 erg/cm2/s. Our results show that during quiet solar activity, discrete aurora occurs likely on small-scale patches embedded inside strong crustal magnetic field regions (with a magnitude greater than 50 nT at 150 km), and the overall chance across the globe is ∼0.77%. The higher probability over strong crustal field regions is attributed to the stronger magnetic field convergence. Modeling shows the occurrence probability dramatically increases during the ICME event, particularly by more than an order of magnitude in weak crustal field regions. Our model results reasonably agree with NASA Mars Atmosphere and Volatile EvolutioN and Mars Express observations. Our study suggests that nightside discrete electron aurora is not caused by the direct entry of magnetosheath plasma in a cusp-like process but due to the recycling of nightside magnetospheric electrons.

Xiaohua Fang

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

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

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

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

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

A Second Moment Method for k -Eigenvalue Acceleration with Continuous Diffusion and Discontinuous Transport Discretizations

The second moment method is a linear acceleration technique that couples the transport equation to a diffusion equation with transport-dependent additive closures. The resulting low-order diffusion equation can be discretized independent of the transport discretization, unlike diffusion synthetic acceleration, and is symmetric positive definite, unlike quasidiffusion. While this method has been shown to be comparable to quasidiffusion in iterative performance for fixed source and time-dependent problems, it is largely unexplored as an eigenvalue problem acceleration scheme due to the belief that the resulting inhomogeneous source makes the problem ill posed. Recently, a preliminary feasibility study was performed on the second moment method for eigenvalue problems. The results suggested comparable performance to quasidiffusion and more robust performance than diffusion synthetic acceleration. This work extends the initial study to more realistic reactor problems using state-of-the-art discretization techniques. Finally, the results in this paper show that the second moment method is more computationally efficient than its alternatives on complex reactor problems with unstructured meshes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the Hamiltonian. By working out expressions for the partition function and transition amplitudes of discretized versions of continuous-variable quantum systems, and then taking the continuum limit, we explicitly recover Feynman's continuous-variable path integrals. We also discuss the implications of our result.

Feynman diagrams