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 1,423 records · Page 79

Probabilistic Structural Analysis Theory Development

The objective of the Probabilistic Structural Analysis Methods (PSAM) project is to develop analysis techniques and computer programs for predicting the probabilistic response of critical structural components for current and future space propulsion systems. This technology will play a central role in establishing system performance and durability. The first year's technical activity is concentrating on probabilistic finite element formulation strategy and code development. Work is also in progress to survey critical materials and space shuttle mian engine components. The probabilistic finite element computer program NESSUS (Numerical Evaluation of Stochastic Structures Under Stress) is being developed. The final probabilistic code will have, in the general case, the capability of performing nonlinear dynamic of stochastic structures. It is the goal of the approximate methods effort to increase problem solving efficiency relative to finite element methods by using energy methods to generate trial solutions which satisfy the structural boundary conditions. These approximate methods will be less computer intensive relative to the finite element approach.

Burnside, O. H.↗

Low-frequency sound propagation modeling over a locally-reacting boundary using the parabolic approximation

There is substantial interest in the analytical and numerical modeling of low-frequency, long-range atmospheric acoustic propagation. Ray-based models, because of frequency limitations, do not always give an adequate prediction of quantities such as sound pressure or intensity levels. However, the parabolic approximation method, widely used in ocean acoustics, and often more accurate than ray models for lower frequencies of interest, can be applied to acoustic propagation in the atmosphere. Modifications of an existing implicit finite-difference implementation for computing solutions to the parabolic approximation are discussed. A locally-reacting boundary is used together with a one-parameter impedance model. Intensity calculations are performed for a number of flow resistivity values in both quiescent and windy atmospheres. Variations in the value of this parameter are shown to have substantial effects on the spatial variation of the acoustic signal.

Robertson, J. S.↗

Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations

Here, this work proposes a machine-learning framework for constructing statistical models of errors incurred by approximate solutions to parameterized systems of nonlinear equations. These approximate solutions may arise from early termination of an iterative method, a lower-fidelity model, or a projection-based reduced-order model, for example. The proposed statistical model comprises the sum of a deterministic regression-function model and a stochastic noise model. The method constructs the regression-function model by applying regression techniques from machine learning (e.g., support vector regression, artificial neural networks) to map features (i.e., error indicators such as sampled elements of the residual) to a prediction of the approximate-solution error. The method constructs the noise model as a mean-zero Gaussian random variable whose variance is computed as the sample variance of the approximate-solution error on a test set; this variance can be interpreted as the epistemic uncertainty introduced by the approximate solution. This work considers a wide range of feature-engineering methods, data-set-construction techniques, and regression techniques that aim to ensure that (1) the features are cheaply computable, (2) the noise model exhibits low variance (i.e., low epistemic uncertainty introduced), and (3) the regression model generalizes to independent test data. Finally, numerical experiments performed on several computational-mechanics problems and types of approximate solutions demonstrate the ability of the method to generate statistical models of the error that satisfy these criteria and significantly outperform more commonly adopted approaches for error modeling.

97 MATHEMATICS AND COMPUTING↗

Numerical solution of the compressible Navier-Stokes equations using density gradients as additional dependent variables

Numerical solution of two dimensional, time dependent, compressible viscous Navier-Stokes equations about arbitrary bodies was treated using density gradients as additional dependent variables. Thus, six dependent variables were computed with the SOR iteration method. Besides formulation for pressure gradient terms, a formulation for computing the body density was presented. To approximate the governing equations, an implicit finite difference method was employed. In computing the solution for the flow about a circular cylinder, a problem arose near the wall at both stagnation points. Thus, computations with various conditions were tried to examine the problem. Also, computations with and without formulations are compared. The flow variables were computed on 37 by 40 field first, then on an 81 by 40 field.

Kwon, J. H.↗

Evaluation of the discrete vortex wake cross flow model using vector computers. Part 1: Theory and application

The current program had the objective to modify a discrete vortex wake method to efficiently compute the aerodynamic forces and moments on high fineness ratio bodies (f approximately 10.0). The approach is to increase computational efficiency by structuring the program to take advantage of new computer vector software and by developing new algorithms when vector software can not efficiently be used. An efficient program was written and substantial savings achieved. Several test cases were run for fineness ratios up to f = 16.0 and angles of attack up to 50 degrees.

Source record↗

Unsteady vortex-dominated flows around maneuvering wings over a wide range of Mach numbers

The problem of unsteady flow around maneuvering wings is solved using the unsteady Euler equations. The unsteady conservative Euler equations are derived for the flow relative motion with respect to a moving (translating and rotating) frame of reference. The resulting equations can handle the most general case for unsteady three-dimensional flow around maneuvering wings or wing-body configurations undergoing six degrees of freedom motion; three translations and three rotations. The equations are solved using two computational schemes; an explicit multistage finite-volume scheme and an implicit approximately factored finite-volume scheme. The computational applications cover two cases. The first case is for a locally conical supersonic flow of rolling oscillation of a sharp-edged delta wing at zero angle of attack. The second case is for a pitching oscillation around a mean angle of attack of a NACA 0012 airfoil in transonic flow.

Kandil, Osama A.↗

Instrument design optimization with computational methods

Using Finite Element Analysis to approximate the solution of differential equations, two different instruments in experimental Hall C at the Thomas Jefferson National Accelerator Facility are analyzed. The time dependence of density uctuations from the liquid hydrogen (LH2) target used in the Q wea k experiment (2011-2012) are studied with Computational Fluid Dynamics (CFD) and the simulation results compared to data from the experiment. The 2.5 kW liquid hydrogen target was the highest power LH2 target in the world and the first to be designed with CFD at Jefferson Lab. The first complete magnetic field simulation of the Super High Momentum Spectrometer (SHMS) is presented with a focus on primary electron beam deflection downstream of the target. The SHMS consists of a superconducting horizontal bending magnet (HB) and three superconducting quadrupole magnets. The HB allows particles scattered at an angle of 5:5 deg to the beam line to be steered into the quadrupole magnets which make up the optics of the spectrometer. Without mitigation, remnant fields from the SHMS may steer the unscattered beam outside of the acceptable envelope on the beam dump and limit beam operations at small scattering angles. A solution is proposed using optimal placement of a minimal amount of shielding iron around the beam line.

43 PARTICLE ACCELERATORS↗

Fluid preconditioning for Newton–Krylov-based, fully implicit, electrostatic particle-in-cell simulations

A recent proof-of-principle study proposes an energy- and charge-conserving, nonlinearly implicit electrostatic particle-in-cell (PIC) algorithm in one dimension [9]. The algorithm in the reference employs an unpreconditioned Jacobian-free Newton–Krylov method, which ensures nonlinear convergence at every timestep (resolving the dynamical timescale of interest). Kinetic enslavement, which is one key component of the algorithm, not only enables fully implicit PIC as a practical approach, but also allows preconditioning the kinetic solver with a fluid approximation. This study proposes such a preconditioner, in which the linearized moment equations are closed with moments computed from particles. Effective acceleration of the linear GMRES solve is demonstrated, on both uniform and non-uniform meshes. The algorithm performance is largely insensitive to the electron–ion mass ratio. Numerical experiments are performed on a 1D multi-scale ion acoustic wave test problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Shielding of a hadron in a finite e-beam

The thorough study of coherent electron cooling, the modern cooling technique capable to deal with accelerators operating in the range of few TeVs, rises many interesting questions. One of them is a shielding dynamics of a hadron in an electron beam. Now this effect is computed analytically in the infinite beam approximation. Many effects are drastically different in finite and infinite plasmas. Here we propose a method to compute the dynamical shielding effect in a finite cylindrical plasma - the realistic model of an electron beam in accelerators.

43 PARTICLE ACCELERATORS↗

Quantum Gate-Model Approaches to Exact and Approximate Optimization

Many of the most challenging computational problems arising in practical applications are tackled by heuristic algorithms which have not been rigorously proven to outperform other approaches but rather have been empirically demonstrated to be effective. While quantum heuristics have been proposed since the early days of quantum computing, true empirical evaluation of the real-world performance of these algorithms is only becoming possible now as increasingly powerful quantum gate-model devices continue to come online.In this talk, I will give an overview of the NASA QuAIL team's ongoing investigation into quantum gate-model heuristic algorithms for exact and approximate optimization. In particular, we consider the performance of the Quantum Approximate Optimization Algorithm on NP-hard optimization problems, and describe algorithm parameter setting strategies for real-world quantum hardware. We then show a generalization of QAOA circuits, the Quantum Alternating Operator Ansatz, especially suitable for low-resource implementations of QAOA for problems with hard (feasibility) constraints. The talk will conclude with a discussion of research challenges, particularly for optimization and sampling applications of QAOA, and the potential of more general quantum heuristics to give advantages over classical computers.

Hadfield, Stuart↗

High-accuracy numerical simulation of black-hole binaries: Computation of the gravitational-wave energy flux and comparisons with post-Newtonian approximants

Expressions for the gravitational-wave (GW) energy flux and center-of-mass energy of a compact binary are integral building blocks of post-Newtonian (PN) waveforms. In this paper, we compute the GW energy flux and GW frequency derivative from a highly accurate numerical simulation of an equal-mass, nonspinning black-hole binary. We also estimate the (derivative of the) center-of-mass energy from the simulation by assuming energy balance. We compare these quantities with the predictions of various PN approximants [adiabatic Taylor and Pade models; nonadiabatic effective-one-body (EOB) models]. We find that Pade summation of the energy flux does not accelerate the convergence of the flux series; nevertheless, the Pade flux is markedly closer to the numerical result for the whole range of the simulation (about 30 GW cycles). Taylor and Pade models overestimate the increase in flux and frequency derivative close to merger, whereas EOB models reproduce more faithfully the shape of and are closer to the numerical flux, frequency derivative, and derivative of energy. We also compare the GW phase of the numerical simulation with Pade and EOB models. Matching numerical and untuned 3.5 PN order waveforms, we find that the phase difference accumulated until M{omega}=0.1 is -0.12 radians for Pade approximants, and 0.50 (0.45) radians for an EOB approximant with Keplerian (non-Keplerian) flux. We fit free parameters within the EOB models to minimize the phase difference, and confirm the presence of degeneracies among these parameters. By tuning the pseudo 4PN order coefficients in the radial potential or in the flux, or, if present, the location of the pole in the flux, we find that the accumulated phase difference at M{omega}=0.1 can be reduced--if desired--to much less than the estimated numerical phase error (0.02 radians)

79 ASTRONOMY AND ASTROPHYSICS↗

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Nemec, Marian↗

Monte Carlo Explicitly Correlated Second-Order Many-Body Green’s Function Calculations of Semiconductor Band Gaps

A systematically converging series of ab initio, post-density-functional, size-consistent, electron-correlated approximations is desired for predictive computing of felectronic band structures of insulating, semiconducting, and metallic solids. A series that meets all of these desiderata (except the applicability to metals) is ab initio many-body Green's function theory based on Gaussian-type-orbital (GTO) basis sets. Here, its leading-order approximation, the second-order Green's function (GF2) method in the diagonal and frequency-independent approximations with the aug-cc-pVDZ basis set, is applied to the fundamental band gaps of three semiconductors (diamond, silicon, and silicon carbide in the zincblende structure) using cluster models. Corrections are made to the basis-set-incompleteness errors by the explicit-correlation (F12) ansatz (GF2-F12) for the valence band edges. The crystals are modeled as surface-passivated clusters of increasing sizes, whose wave functions are expanded by up to 2709 GTO basis functions. Immense computational costs of these calculations are overcome by the highly scalable stochastic algorithm of the Monte Carlo GF2-F12 method, whose operation cost per state increases only as a cubic power of system size, which has a tiny memory footprint and easily achieves near-perfect parallel efficiency on thousands of CPUs or on hundreds of GPUs. The correlated, F12-corrected highest-occupied and lowest-unoccupied molecular-orbital energy (HOMO-LUMO) gap is 5.78 ± 0.07 eV for C 87 H 76 as compared with the experimental value of the fundamental (indirect) band gap of bulk diamond at 5.48 eV. The correlated, F12-corrected HOMO-LUMO gaps for Si 75 H 76 and Si 32 C 43 H 76 are 2.56 ± 0.15 eV and 3.50 ± 0.12 eV, respectively, which are expected to decrease further with increasing cluster sizes. As a result, the experimental fundamental (indirect) band gaps of bulk silicon and silicon carbide are 1.17 eV and 2.42 eV, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

GENERALIZATION OF THE LAST SCATTERING APPROXIMATION FOR THE SECOND SOLAR SPECTRUM MODELING: THE Ca I 4227 A LINE AS A CASE STUDY

To model the second solar spectrum (the linearly polarized spectrum of the Sun that is due to coherent scattering processes), one needs to solve the polarized radiative transfer (RT) equation. For strong resonance lines, partial frequency redistribution (PRD) effects must be accounted for, which make the problem computationally demanding. The 'last scattering approximation' (LSA) is a concept that has been introduced to make this highly complex problem more tractable. An earlier application of a simple LSA version could successfully model the wings of the strong Ca I 4227 A resonance line in Stokes Q/I (fractional linear polarization), but completely failed to reproduce the observed Q/I peak in the line core. Since the magnetic field signatures from the Hanle effect only occur in the line core, we need to generalize the existing LSA approach if it is to be useful for the diagnostics of chromospheric and turbulent magnetic fields. In this paper, we explore three different approximation levels for LSA and compare each of them with the benchmark represented by the solution of the full polarized RT, including PRD effects. The simplest approximation level is LSA-1, which uses the observed center-to-limb variation of the intensity profile to obtain the anisotropy of the radiation field at the surface, without solving any transfer equation. In contrast, the next two approximation levels use the solution of the unpolarized transfer equation to derive the anisotropy of the incident radiation field and use it as an input. In the case of LSA-2, the anisotropy at level {tau}{sub {lambda}} = {mu}, the atmospheric level from which an observed photon is most likely to originate, is used. LSA-3, on the other hand, makes use of the full depth dependence of the radiation anisotropy. The Q/I formula for LSA-3 is obtained by keeping the first term in a series expansion of the Q-source function in powers of the mean number of scattering events. Computationally, LSA-1 is 21 times faster than LSA-2, which is 5 times faster than the more general LSA-3, which itself is 8 times faster than the polarized RT approach. A comparison of the calculated Q/I spectra with the RT benchmark shows excellent agreement for LSA-3, including good modeling of the Q/I core region with its PRD effects. In contrast, both LSA-1 and LSA-2 fail to model the core region. The RT and LSA-3 approaches are then applied to model the recently observed Q/I profile of the Ca I 4227 A line in quiet regions of the Sun. Apart from a global scale factor both give a very good fit to the Q/I spectra for all the wavelengths, including the core peak and blend line depolarizations. We conclude that LSA-3 is an excellent substitute for the full polarized RT and can be used to interpret the second solar spectrum, including the Hanle effect with PRD. It also allows the techniques developed for unpolarized three-dimensional RT to be applied to the modeling of the second solar spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonlinear elasticity with the Shifted Boundary Method

Here, we propose a new unfitted/immersed computational framework for nonlinear solid mechanics, which bypasses the complexities associated with the generation of CAD representations and subsequent body-fitted meshing. This approach allows to speed up the cycle of design and analysis in complex geometry and requires relatively simple computer graphics representations of the surface geometries to be simulated, such as the Standard Tessellation Language (STL format). Complex data structures and integration on cut elements are avoided by means of an approximate boundary representation and a modification (shifting) of the boundary conditions to maintain optimal accuracy. An extensive set of computational experiments in two and three dimensions is included.

97 MATHEMATICS AND COMPUTING↗

Optimal feedback control infinite dimensional parabolic evolution systems: Approximation techniques

A general approximation framework is discussed for computation of optimal feedback controls in linear quadratic regular problems for nonautonomous parabolic distributed parameter systems. This is done in the context of a theoretical framework using general evolution systems in infinite dimensional Hilbert spaces. Conditions are discussed for preservation under approximation of stabilizability and detectability hypotheses on the infinite dimensional system. The special case of periodic systems is also treated.

Banks, H. T.↗