Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate computing”

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 181 records · Page 10

Optical conductivity of the two-dimensional Hubbard model: Vertex corrections, emergent Galilean invariance, and the accuracy of the single-site dynamical mean field approximation

We compute the frequency-dependent conductivity of the two-dimensional square lattice Hubbard model at zero temperature as a function of density to second order in the interaction strength, and compare the results to the predictions of single-site dynamical mean field theory computed at the same order. We find that despite the neglect of vertex corrections, the single-site dynamical mean field approximation produces semiquantitatively accurate results for most carrier concentrations, but fails qualitatively for the nearly empty or nearly filled band cases where the model exhibits an emergent Galilean invariance. The DMFT approximation also becomes qualitatively inaccurate very near half filling if nesting is important.

2-dimensional systems↗

Approximate and exact numerical computation of supersonic flow over an airfoil

The computation of inviscid supersonic flow over a two-dimensional airfoil is considered. There are two main nonlinear approaches which lead to approximate solutions. Small-amplitude theory gives valid solutions provided the airfoil thickness is not too great and the Mach number is not too high. The second type of approximation, shock expansion theory, employs the fact that even for flows with strong shocks the effect of the down-running characteristics remains small. This leads to an analytic solution at the airfoil. It is pointed out that the approximate solution is accurate enough for many cases of interest. The numerical method furnishes a rapid correction to the solution in those cases where it is not. The characteristic-streamline coordinate system is useful both for the computation of the approximate solution and the corrections, and is also convenient for displaying and interpreting the results.

Lewis, T. S.↗

A crust and upper mantle model of Eurasia and North Africa for Pn travel time calculation

We develop a Regional Seismic Travel Time (RSTT) model and methods to account for the first-order effect of the three-dimensional crust and upper mantle on travel times. The model parameterization is a global tessellation of nodes with a velocity profile at each node. Interpolation of the velocity profiles generates a 3-dimensional crust and laterally variable upper mantle velocity. The upper mantle velocity profile at each node is represented as a linear velocity gradient, which enables travel time computation in approximately 1 millisecond. This computational speed allows the model to be used in routine analyses in operational monitoring systems. We refine the model using a tomographic formulation that adjusts the average crustal velocity, mantle velocity at the Moho, and the mantle velocity gradient at each node. While the RSTT model is inherently global and our ultimate goal is to produce a model that provides accurate travel time predictions over the globe, our first RSTT tomography effort covers Eurasia and North Africa, where we have compiled a data set of approximately 600,000 Pn arrivals that provide path coverage over this vast area. Ten percent of the tomography data are randomly selected and set aside for testing purposes. Travel time residual variance for the validation data is reduced by 32%. Based on a geographically distributed set of validation events with epicenter accuracy of 5 km or better, epicenter error using 16 Pn arrivals is reduced by 46% from 17.3 km (ak135 model) to 9.3 km after tomography. Relative to the ak135 model, the median uncertainty ellipse area is reduced by 68% from 3070 km{sup 2} to 994 km{sup 2}, and the number of ellipses with area less than 1000 km{sup 2}, which is the area allowed for onsite inspection under the Comprehensive Nuclear Test Ban Treaty, is increased from 0% to 51%.

58 GEOSCIENCES↗

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗

Calculating uncertainty on K-effective with MONK10 - 14583

Criticality safety assessments require a demonstration that a particular configuration of fissile material has an adequate sub-critical margin (k-effective sufficiently below unity) to ensure that the risk of criticality under normal operation and accident conditions is acceptable. The required sub-critical margin depends upon the uncertainty in the estimated value of k-effective. The uncertainty in the calculated value of k-effective arises from a number of sources, including: manufacturing tolerances on input data to the code (affecting geometry, compositions and densities), uncertainty in the nuclear data used by the code, stochastic uncertainty resulting from Monte Carlo simulation and modelling approximations/errors, including the inevitable bugs in the software. The ANSWERS Software Service, in collaboration with industrial partners, is developing a number of techniques to better understand and quantify uncertainty on predicted values of k-effective, using MONK. The SPRUCE utility code has been developed to allow uncertainty to be estimated using sampling methods. This can include the sampling of input parameters (including dimensions, compositions and densities) from statistical distributions. It can also include sampling different nuclear data libraries. A set of nuclear data libraries has been generated for this purpose by sampling from statistical distributions that represent the uncertainties in the published nuclear data evaluated files; a set of libraries has been produced for Latin Hypercube Sampling. By varying the input data and nuclear data, separate and combined uncertainties due to manufacturing tolerances and nuclear data can be derived. By performing least squares fitting on the results it is also possible to estimate the contribution of each of the uncertain inputs and a sensitivity method in MONK can break down the nuclear data uncertainty. (authors)

42 ENGINEERING↗

Scaled Vecchia Approximation for Fast Computer-Model Emulation

Many scientific phenomena are studied using computer experiments consisting of multiple runs of a computer model while varying the input settings. Gaussian processes (GPs) are a popular tool for the analysis of computer experiments, enabling interpolation between input settings, but direct GP inference is computationally infeasible for large datasets. We adapt and extend a powerful class of GP methods from spatial statistics to enable the scalable analysis and emulation of large computer experiments. Specifically, we apply Vecchia’s ordered conditional approximation in a transformed input space, with each input scaled according to how strongly it relates to the computer-model response. The scaling is learned from the data by estimating parameters in the GP covariance function using Fisher scoring. Our methods are highly scalable, enabling estimation, joint prediction, and simulation in near-linear time in the number of model runs. In several numerical examples, our approach substantially outperformed existing methods.

97 MATHEMATICS AND COMPUTING↗

Rapid State Space Modeling Tool for Rectangular Wing Aeroservoelastic Studies

This paper introduces a modeling and simulation tool for aeroservoelastic analysis of rectangular wings with trailing edge control surfaces. The inputs to the code are planform design parameters such as wing span, aspect ratio and number of control surfaces. A doublet lattice approach is taken to compute generalized forces. A rational function approximation is computed. The output, computed in a few seconds, is a state space aeroservoelastic model which can be used for analysis and control design. The tool is fully parameterized with default information so there is little required interaction with the model developer. Although, all parameters can be easily modified if desired.The focus of this paper is on tool presentation, verification and validation. This process is carried out in stages throughout the paper. The rational function approximation is verified against computed generalized forces for a plate model. A model composed of finite element plates is compared to a modal analysis from commercial software and an independently conducted experimental ground vibration test analysis. Aeroservoelastic analysis is the ultimate goal of this tool. Therefore the flutter speed and frequency for a clamped plate are computed using V-g and V-f analysis. The computational results are compared to a previously published computational analysis and wind tunnel results for the same structure. Finally a case study of a generic wing model with a single control surface is presented. Verification of the state space model is presented in comparison to V-g and V-f analysis. This also includes the analysis of the model in response to a 1-cos gust.

Modeling and Simulation↗

Size-dependent error of the density functional theory ionization potential in vacuum and solution

Density functional theory is often the method of choice for modeling the energetics of large molecules and including explicit solvation effects. It is preferable to use a method that treats systems of different sizes and with different amounts of explicit solvent on equal footing. However, recent work suggests that approximate density functional theory has a size-dependent error in the computation of the ionization potential. We here investigate the lack of size-intensivity of the ionization potential computed with approximate density functionals in vacuum and solution. We show that local and semi-local approximations to exchange do not yield a constant ionization potential for an increasing number of identical isolated molecules in vacuum. Instead, as the number of molecules increases, the total energy required to ionize the system decreases. Rather surprisingly, we find that this is still the case in solution, whether using a polarizable continuum model or with explicit solvent that breaks the degeneracy of each solute, and we find that explicit solvent in the calculation can exacerbate the size-dependent delocalization error. We demonstrate that increasing the amount of exact exchange changes the character of the polarization of the solvent molecules; for small amounts of exact exchange the solvent molecules contribute a fraction of their electron density to the ionized electron, but for larger amounts of exact exchange they properly polarize in response to the cationic solute. In vacuum and explicit solvent, the ionization potential can be made size-intensive by optimally tuning a long-range corrected hybrid functional.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spectral densities for hot QCD plasmas in a leading-log approximation

We compute the spectral densities of T{sup {mu}{nu}}and J{sup {mu}}in high-temperature QCD plasmas at small frequency and momentum, {omega},k{approx}g{sup 4}T. The leading log Boltzmann equation is reformulated as a Fokker-Planck equation with nontrivial boundary conditions, and the resulting partial differential equation is solved numerically in momentum space. The spectral densities of the current, shear, sound, and bulk channels exhibit a smooth transition from free-streaming quasiparticles to ideal hydrodynamics. This transition is analyzed with conformal and nonconformal second-order hydrodynamics and a second-order diffusion equation. We determine all of the second-order transport coefficients that characterize the linear response in the hydrodynamic regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate spatial reasoning

Much of human reasoning is approximate in nature. Formal models of reasoning traditionally try to be precise and reject the fuzziness of concepts in natural use and replace them with non-fuzzy scientific explicata by a process of precisiation. As an alternate to this approach, it has been suggested that rather than regard human reasoning processes as themselves approximating to some more refined and exact logical process that can be carried out with mathematical precision, the essence and power of human reasoning is in its capability to grasp and use inexact concepts directly. This view is supported by the widespread fuzziness of simple everyday terms (e.g., near tall) and the complexity of ordinary tasks (e.g., cleaning a room). Spatial reasoning is an area where humans consistently reason approximately with demonstrably good results. Consider the case of crossing a traffic intersection. We have only an approximate idea of the locations and speeds of various obstacles (e.g., persons and vehicles), but we nevertheless manage to cross such traffic intersections without any harm. The details of our mental processes which enable us to carry out such intricate tasks in such apparently simple manner are not well understood. However, it is that we try to incorporate such approximate reasoning techniques in our computer systems. Approximate spatial reasoning is very important for intelligent mobile agents (e.g., robots), specially for those operating in uncertain or unknown or dynamic domains.

Dutta, Soumitra↗

COBRA:COMPUTED-TOMOGRAPHY BASED RANDOM-FIELD APPROXIMATION

SF-25-115 COBRA (COmputed-tomography Based Random-field Approximation) is a Python application for generating statistically equivalent random fields from CT-scan imagery. It leverages Karhunen–Loève expansions to model microstructural variability, enabling users to: Preprocess CT scans (filtering and Gaussian transformation); Fit covariance kernels fromempirical data; Solve eigenproblems to obtain KL modes; Sample random fields onsistent with fitted statistics; Postprocess samples back into the physical domain.

Hu, Tianchen↗

On the Use of Statistics in Design and the Implications for Deterministic Computer Experiments

Perhaps the most prevalent use of statistics in engineering design is through Taguchi's parameter and robust design -- using orthogonal arrays to compute signal-to-noise ratios in a process of design improvement. In our view, however, there is an equally exciting use of statistics in design that could become just as prevalent: it is the concept of metamodeling whereby statistical models are built to approximate detailed computer analysis codes. Although computers continue to get faster, analysis codes always seem to keep pace so that their computational time remains non-trivial. Through metamodeling, approximations of these codes are built that are orders of magnitude cheaper to run. These metamodels can then be linked to optimization routines for fast analysis, or they can serve as a bridge for integrating analysis codes across different domains. In this paper we first review metamodeling techniques that encompass design of experiments, response surface methodology, Taguchi methods, neural networks, inductive learning, and kriging. We discuss their existing applications in engineering design and then address the dangers of applying traditional statistical techniques to approximate deterministic computer analysis codes. We conclude with recommendations for the appropriate use of metamodeling techniques in given situations and how common pitfalls can be avoided.

Simpson, Timothy W.↗

On the Accuracy of Double Scattering Approximation for Atmospheric Polarization Computations

Interpretation of multi-angle spectro-polarimetric data in remote sensing of atmospheric aerosols require fast and accurate methods of solving the vector radiative transfer equation (VRTE). The single and double scattering approximations could provide an analytical framework for the inversion algorithms and are relatively fast, however accuracy assessments of these approximations for the aerosol atmospheres in the atmospheric window channels have been missing. This paper provides such analysis for a vertically homogeneous aerosol atmosphere with weak and strong asymmetry of scattering. In both cases, the double scattering approximation gives a high accuracy result (relative error approximately 0.2%) only for the low optical path - 10(sup -2) As the error rapidly grows with optical thickness, a full VRTE solution is required for the practical remote sensing analysis. It is shown that the scattering anisotropy is not important at low optical thicknesses neither for reflected nor for transmitted polarization components of radiation.

Korkin, Sergey V.↗

Smoothness of Functions in Spaces of the Finite Element Method

We find necessary and sufficient conditions for the generalized smoothness of the coordinate functions obtained from the approximate relations. We show that for the coordinate functions the smoothness on their supports is equivalent to that on the boundaries of supports. We obtain conditions for the continuity of Courant type finite element approximations and conditions for the uniqueness of a linear space of such approximations.

97 MATHEMATICS AND COMPUTING↗

The shifted boundary method for embedded domain computations. Part I: Poisson and Stokes problems

We propose a new finite element method for embedded domain computations, which falls in the category of surrogate/approximate boundary algorithms. The key feature of the proposed approach is the idea of shifting the location where boundary conditions are applied from the true to the surrogate boundary, and to appropriately modify the shifted boundary conditions, enforced weakly, in order to preserve optimal convergence rates of the numerical solution. This process yields a method which, in our view, is simple, efficient, and also robust, since it is not affected by the small-cut-cell problem. Although general in nature, here we apply this new concept to the Poisson and Stokes problems. We present in particular the full analysis of stability and convergence for the case of the Poisson operator, and numerical tests for both the Poisson and Stokes equations, for geometries of progressively higher complexity.

97 MATHEMATICS AND COMPUTING↗

A preliminary study to Assess Model Uncertainties in Fluid Flows

The goal of this study is to assess the impact of various flow models for a simplified primary coolant loop of a light water nuclear reactor. The various fluid flow models are based on the Euler equations with an additional friction term, gravity term, momentum source, and energy source. The geometric model is purposefully chosen simple and consists of a one-dimensional (1D) loop system in order to focus the study on the validity of various fluid flow approximations. The 1D loop system is represented by a rectangle; the fluid is heated up along one of the vertical legs and cooled down along the opposite leg. A pressurizer and a pump are included in the horizontal legs. The amount of energy transferred and removed from the system is equal in absolute value along the two vertical legs. The various fluid flow approximations are compressible vs. incompressible, and complete momentum equation vs. Darcy’s approximation. The ultimate goal is to compute the fluid flow models’ uncertainties and, if possible, to generate validity ranges for these models when applied to reactor analysis. We also limit this study to single phase flows with low-Mach numbers. As a result, sound waves carry a very small amount of energy in this particular case. A standard finite volume method is used for the spatial discretization of the system.

97 MATHEMATICS AND COMPUTING↗