Search NASA⌕ Search

SEARCH · Search NASA

Results for “discretization methods”

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 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Assessment of impingement effects in the isentropic core of a small satellite control thruster plume

Two computational techniques commonly employed in the calculation of rocket and thruster expansion plumes are assessed. These are the method of characteristics (MOC), which is derived from the continuum Euler equations, and the direct simulation Monte Carlo (DSMC) method, which adopts a discrete particle approach. These techniques vary both in the computational expense and in the accuracy and detail of the solutions that they provide, depending upon the regime of application. The assessment is made with reference to the plume expanding from a small monopropellant hydrazine thruster and concentrates on the isentropic core of the jet for the flow regime lying between the continuum and free molecular limits. It is found that the more numerically intensive DSMC method offers the better correspondence to the available experimental data. In addition, large differences in typical impingement effects such as drag force and heat transfer are found at the free molecular limit of the plume expansion for the two predictive techniques. It is concluded that accurate estimation of impingement potential may only be achieved through application of the discrete particle method.

Boyd, I. D.↗
DOE OSTI2012

Rapid analysis of scattering from periodic dielectric structures using accelerated Cartesian expansions

Here, the analysis of fields in periodic dielectric structures arise in numerous applications of recent interest, ranging from photonic bandgap structures and plasmonically active nanostructures to metamaterials. To achieve an accurate representation of the fields in these structures using numerical methods, dense spatial discretization is required. This, in turn, affects the cost of analysis, particularly for integral-equation-based methods, for which traditional iterative methods require Ο(Ν 2 ) operations, Ν being the number of spatial degrees of freedom. In this paper, we introduce a method for the rapid solution of volumetric electric field integral equations used in the analysis of doubly periodic dielectric structures. The crux of our method is the accelerated Cartesian expansion algorithm, which is used to evaluate the requisite potentials in Ο(Ν) cost. Results are provided that corroborate our claims of acceleration without compromising accuracy, as well as the application of our method to a number of compelling photonics applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1978

Dynamic response and input identification of MDOF structures subjected to coupled random vector inputs

A method of random dynamic analysis is presented which is based on the classical approach applied to a discretized structure. The method assumes that the system identification is available in the form of natural modes and frequencies. These modes and frequencies can be found from either available solutions or approximately from finite element programs. A computer program has been developed to perform the computations required in the analysis. All computations are performed with transformed modal variables, which results in significant economy since the number of modal degrees of freedom is almost always less than the number of physical degrees of freedom. The program computes the response to force and base inputs which are statistically coupled. A method is also presented for predicting one of the inputs if the second input and the acceleration response at a point on the structure are known. Finally, results are presented for the random response of a rectangular plate subjected to a random pressure and a random base input. The inputs are considered individually and with various degrees of statistical coupling.

Ocallahan, J. C.↗
DOE OSTI2025

A Green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials

Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. Furthermore, the computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Hourglass control in staggered-grid hydrodynamics using virtual element stabilization techniques

Numerical simulations using the staggered-grid hydrodynamics (SGH) discretization suffer from hourglass instabilities. In this work, we develop a stabilization method to suppress the hourglass instabilities using techniques from the virtual element method (VEM). The stiffness matrix of the VEM consists of two terms: the consistency matrix which is rank deficient and the stability matrix. Here, we first show that in two dimensions and on general polygons, the stiffness matrix of the SGH is identical to the consistency matrix of the linear VEM for both the diffusion equation and the linear elasticity equation. These analyses explain the origin of the hourglass instabilities of the SGH discretization method, and establish a theoretical foundation for our proposed stabilization method by augmenting the stiffness matrix of the SGH discretization using the VEM stability matrix. Then, we present numerical examples using Lagrangian SGH simulations. The numerical experiments demonstrate that the proposed VEM stabilization method is effective at eliminating hourglass modes in the SGH discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A coupling approach for linear elasticity problems with spatially non-coincident discretized interfaces

Here we present a new method for coupled linear elasticity problems whose finite element discretization may lead to spatially non-coincident discretized interfaces. Our approach combines the classical Dirichlet–Neumann coupling formulation with a new set of discretized interface conditions obtained through Taylor series expansions. We show that these conditions ensure linear consistency of the coupled finite element solution. We then formulate an iterative solution method for the coupled discrete system and apply the new coupling approach to two representative settings for which we also provide several numerical illustrations. The first setting is a mesh-tying problem in which both coupled structures have the same Lamé parameters whereas the second setting is an interface problem for which the Lamé parameters in the two coupled structures are different.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Geometrically projected discrete dislocation dynamics

Three-dimensional discrete dislocation dynamics methods (3D-DDD) have been developed to explicitly track the motion of individual dislocations under applied stress. At present, these methods are limited to plastic strains of about one percent or less due to high computational cost associated with the interactions between large numbers of dislocations. This limitation motivates the construction of minimalistic approaches to efficiently simulate the motion of dislocations for higher strains and longer time scales. In the present study, we propose geometrically projected discrete dislocation dynamics (GP-DDD), a method in which dislocation loops are modeled as geometrical objects that maintain their shape with a constant number of degrees of freedom as they expand. We present an example where rectangles composed of two screw and two edge dislocation segments are used for modeling gliding dislocation loops. We use this model to simulate single slip loading of copper and compare the results with detailed 3D-DDD simulations. We discuss the regimes in which GP-DDD is able to adequately capture the variation of the flow stress with strain rate in the single slip loading condition. In conclusion, a simulation using GP-DDD requires ~40 times fewer degrees of freedom for a copper single slip loading case, thus reducing computational time and complexity.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Estimating uncertainties in statistics computed from direct numerical simulation

Rigorous assessment of uncertainty is crucial to the utility of direct numerical simulation (DNS) results. Uncertainties in the computed statistics arise from two sources: finite statistical sampling and the discretization of the Navier–Stokes equations. Due to the presence of non-trivial sampling error, standard techniques for estimating discretization error (such as Richardson extrapolation) fail or are unreliable. This work provides a systematic and unified approach for estimating these errors. First, a sampling error estimator that accounts for correlation in the input data is developed. Then, this sampling error estimate is used as part of a Bayesian extension of Richardson extrapolation in order to characterize the discretization error. These methods are tested using the Lorenz equations and are shown to perform well. These techniques are then used to investigate the sampling and discretization errors in the DNS of a wall-bounded turbulent flow at Reτ ≈ 180. Both small (Lx/δ × Lz/δ = 4π × 2π) and large (Lx/δ × Lz/δ = 12π × 4π) domain sizes are investigated. For each case, a sequence of meshes was generated by first designing a “nominal” mesh using standard heuristics for wall-bounded simulations. These nominal meshes were then coarsened to generate a sequence of grid resolutions appropriate for the Bayesian Richardson extrapolation method. In addition, the small box case is computationally inexpensive enough to allow simulation on a finer mesh, enabling the results of the extrapolation to be validated in a weak sense. For both cases, it is found that while the sampling uncertainty is large enough to make the order of accuracy difficult to determine, the estimated discretization errors are quite small. This indicates that the commonly used heuristics provide adequate resolution for this class of problems. However, it is also found that, for some quantities, the discretization error is not small relative to sampling error, indicating that the conventional wisdom that sampling error dominates discretization error for this class of simulations needs to be reevaluated.

Oliver, Todd A.↗
NASA NTRS1974

Efficient stream distributions in radiative transfer theory

This paper discusses a new, computationally-efficient method for approximating the integro-differential equation of radiative transfer with a finite set of coupled differential equations for discrete streams. The method uses recommended spatial distributions of streams that are quite different from those typically used in that they are based on the symmetry of several regular Platonic solids. To facilitate the use of such distributions, an explicit, one-parameter relationship between the physical radiance and the abstract stream is formulated. The parameter is used to determine the minimum number of streams required in the radiative transfer model. Accuracy and computational efficiency are shown to be served best by choosing a stream distribution that is invariant to a large number of three space rotations. For various values of the above-mentioned parameter, the resulting recommended stream distribution is shown to be more computationally efficient than more conventional stream distributions. Finally, the incorporation of polarization in the stream definition is described.

Whitney, C.↗
DOE OSTI2017

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT in the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Optimal experimental design: Formulations and computations

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Multilevel summation methods for efficient evaluation of long-range pairwise interactions in atomistic and coarse-grained molecular simulation.

The availability of efficient algorithms for long-range pairwise interactions is central to the success of numerous applications, ranging in scale from atomic-level modeling of materials to astrophysics. This report focuses on the implementation and analysis of the multilevel summation method for approximating long-range pairwise interactions. The computational cost of the multilevel summation method is proportional to the number of particles, N, which is an improvement over FFTbased methods who s cost is asymptotically proportional to N logN. In addition to approximating electrostatic forces, the multilevel summation method can be use to efficiently approximate convolutions with long-range kernels. As an application, we apply the multilevel summation method to a discretized integral equation formulation of the regularized generalized Poisson equation. Numerical results are presented using an implementation of the multilevel summation method in the LAMMPS software package. Preliminary results show that the computational cost of the method scales as expected, but there is still a need for further optimization.

Bond, Stephen D.↗
NASA NTRS1978

An efficient, direct finite difference method for computing sound propagation in arbitrarily shaped two-dimensional and axisymmetric ducts without flow

An efficient, direct finite difference method is presented for computing sound propagation in non-stepped two-dimensional and axisymmetric ducts of arbitrarily varying cross section without mean flow. The method is not restricted by axial variation of acoustic impedance of the duct wall linings. The non-uniform two-dimensional or axisymmetric duct is conformally mapped numerically into a rectangular or cylindrical computational domain using a new procedure based on a method of fast direct solution of the Cauchy-Riemann equations. The resulting Helmholtz equation in the computational domain is separable. The solution to the governing equation and boundary conditions is expressed as a linear combination of fundamental solutions. The fundamental solutions are computed only once for each duct shape by means of the fast direct cyclic reduction method for the discrete solution of separable elliptic equations. Numerical results for several examples are presented to show the applicability and efficiency of the method.

Chakravarthy, S.↗
DOE OSTI2016

SIMULATED HUMAN ERROR PROBABILITY AND ITS APPLICATION TO DYNAMIC HUMAN FAILURE EVENTS

Abstract Objectives: Human reliability analysis (HRA) methods typically analyze human failure events (HFEs) at the overall task level. For dynamic HRA, it is important to model human activities at the subtask level. There exists a disconnect between dynamic subtask level and static task level that presents issues when modeling dynamic scenarios. For example, the SPAR-H method is typically used to calculate the human error probability (HEP) at the task level. As demonstrated in this paper, quantification in SPAR-H does not translate to the subtask level. Methods: Two different discrete distributions were generated for each SPAR-H Performance Shaping Factor (PSF) to define the frequency of PSF levels. The first distribution was a uniform, or uninformed distribution that assumed the frequency of each PSF level was equally likely. The second non-continuous distribution took the frequency of PSF level as identified from an assessment of the HERA database. These two different approaches were created to identify the resulting distribution of the HEP. The resulting HEP that appears closer to the known distribution, a log-normal centered on 1E-3, is the more desirable. Each approach then has median, average and maximum HFE calculations applied. To calculate these three values, three events, A, B and C are generated from the PSF level frequencies comprised of subtasks. The median HFE selects the median PSF level from each PSF and calculates HEP. The average HFE takes the mean PSF level, and the maximum takes the maximum PSF level. The same data set of subtask HEPs yields starkly different HEPs when aggregated to the HFE level in SPAR-H. Results: Assuming that each PSF level in each HFE is equally likely creates an unrealistic distribution of the HEP that is centered at 1. Next the observed frequency of PSF levels was applied with the resulting HEP behaving log-normally with a majority of the values under 2.5% HEP. The median, average and maximum HFE calculations did yield different answers for the HFE. The HFE maximum grossly over estimates the HFE, while the HFE distribution occurs less than HFE median, and greater than HFE average. Conclusions: Dynamic task modeling can be perused through the framework of SPAR-H. Identification of distributions associated with each PSF needs to be defined, and may change depending upon the scenario. However it is very unlikely that each PSF level is equally likely as the resulting HEP distribution is strongly centered at 100%, which is unrealistic. Other distributions may need to be identified for PSFs, to facilitate the transition to dynamic task modeling. Additionally discrete distributions need to be exchanged for continuous so that simulations for the HFE can further advance. This paper provides a method to explore dynamic subtask to task translation and provides examples of the process using the SPAR-H method.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations.

97 MATHEMATICS AND COMPUTING↗