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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 613 records · Page 34

All sources NASA NTRS DOE OSTI

NASA NTRS1983

An interactive system for compositing digital radar and satellite data

This paper describes an approach for compositing digital radar data and GOES satellite data for meteorological analysis. The processing is performed on a user-oriented image processing system, and is designed to be used in the research mode. It has a capability to construct PPIs and three-dimensional CAPPIs using conventional as well as Doppler data, and to composite other types of data. In the remapping of radar data to satellite coordinates, two steps are necessary. First, PPI or CAPPI images are remapped onto a latitude-longitude projection. Then, the radar data are projected into satellite coordinates. The exact spherical trigonometric equations, and the approximations derived for simplifying the computations are given. The use of these approximations appears justified for most meteorological applications. The largest errors in the remapping procedure result from the satellite viewing angle parallax, which varies according to the cloud top height. The horizontal positional error due to this is of the order of the error in the assumed cloud height in mid-latitudes. Examples of PPI and CAPPI data composited with satellite data are given for Hurricane Frederic on 13 September 1979 and for a squall line on 2 May 1979 in Oklahoma.

Heymsfield, G. M.↗

NASA NTRS2014

Partial Derivatives of the Lambert Problem

A procedure for deriving analytic partial derivatives of the Lambert problem is presented. Using the universal, cosine based Lambert formulation; first order partial derivatives of the velocities with respect to the positions and times are developed. Taking advantage of inherent symmetries and intermediate variables, the derivatives are expressed in a computationally efficient form. The added cost of computing these partials is found to be approximately 10% to approximately 60% of the Lambert compute cost. The availability of analytic partial derivatives increases optimization speed, efficiency and allows for trajectory optimization formulations that implicitly enforce continuity constraints via embedded Lambert problems.

trajectory computation↗

NASA NTRS1981

Approximate factorization for incompressible flow

For computational solution of the incompressible Navier-Stokes equations, the approximate factorization (AF) algorithm is used to solve the vectorized momentum equation in delta form based on the pressure calculated in the previous time step. The newly calculated velocities are substituted into the pressure equation (obtained from a linear combination of the continuity and momentum equation), which is then solved by means of line SOR. Computational results are presented for the NACA 66 sub 3 018 airfoil at Reynolds numbers of 1000 and 40,000 and attack angles of 0 and 6 degrees. Comparison with wind tunnel data for Re = 40,000 indicates good qualitative agreement between measured and calculated pressure distributions. Quantitative agreement is only fair, however, with the calculations somewhat displaced from the measurements. Furthermore, the computed velocity profiles are unrealistically thick around the airfoil, due to the excessive amount of artificial viscosity needed for stability. Based on the performance of the algorithm with regard to stability, it is concluded that AF/SOR is suitable for calculations at Reynolds numbers less than 10,000. Speedwise, the method is faster than point SOR by at least a factor of two.

Bernard, R. S.↗

DOE OSTI2021

Efficient calculation of carrier scattering rates from first principles

Abstract The electronic transport behaviour of materials determines their suitability for technological applications. We develop a computationally efficient method for calculating carrier scattering rates of solid-state semiconductors and insulators from first principles inputs. The present method extends existing polar and non-polar electron-phonon coupling, ionized impurity, and piezoelectric scattering mechanisms formulated for isotropic band structures to support highly anisotropic materials. We test the formalism by calculating the electronic transport properties of 23 semiconductors, including the large 48 atom CH 3 NH 3 PbI 3 hybrid perovskite, and comparing the results against experimental measurements and more detailed scattering simulations. The Spearman rank coefficient of mobility against experiment ( r s = 0.93) improves significantly on results obtained using a constant relaxation time approximation ( r s = 0.52). We find our approach offers similar accuracy to state-of-the art methods at approximately 1/500th the computational cost, thus enabling its use in high-throughput computational workflows for the accurate screening of carrier mobilities, lifetimes, and thermoelectric power.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1989

Review of a code development and calibration program in support of the aeroassist flight experiment

The code development and calibration program for the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) is reviewed, with emphasis directed toward support of the Aeroassist Flight Experiment (AFE). The flight project is designed to obtain data which will be used in the validation of computational fluid dynamic approximation methods. Comparisons between experimental data and numerical simulation focus on perfect-gas tests over a scale model of the AFE and on flight and ground tests which challenge some aspect of the thermochemical nonequilibrium model. In the first case, the gas model is simple, but the grid-related problems of defining the real vehicle are present. In the second case, the vehicle geometries are simple, but thermochemical processes must be modeled correctly in order to compare with the experimental data. These comparisons are described as calibration runs because they test elements of the numerical simulation, but no single data set adequately simulates the full-scale AFE flight conditions. Comparisons between computation and experiment over a broad range of data sets show generally good agreement, though some aspects of the numerical model require further development.

Gnoffo, Peter A.↗

DOE OSTI2014

Properties of Pt-supported iron oxide ultra-thin films: Similarity of Hubbard-corrected and hybrid density functional theory description

We report a first principles study on the properties of Pt(111)-supported FeO(111) monolayer. We confront results issued from PBE+U and HSE06 approximations, and analyze the impact of the more accurate hybrid description of the electronic structure of the metal/oxide interface on a large variety of calculated characteristics of this system. In particular, we analyze the behavior of its work function and its consequences on the spontaneous charging of adsorbed Au adatoms. We also consider the FeO{sub 2} nano-oxide phase and its peculiar oxygen storage characteristics, responsible for the unusual catalytic properties of FeO{sub x}/Pt system. We show that while the hybrid approximation does indeed substantially improve the electronic characteristics of iron oxide, of individual Au adatoms, or oxygen molecules, its overall impact on the calculated properties of the composed FeO/Pt system is very small. We assign this to the relatively small effect of the hybrid approximation on the band structure alignment. This shows that the less computationally demanding DFT+U approximation remains a fully adequate tool in theoretical studies on this kind of systems. This is particularly important for calculations on realistic systems, with large-size reconstructions induced by the lattice mismatch at the interface between the two materials.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

NASA NTRS1968

Digital filter synthesis computer program

Digital filter synthesis computer program expresses any continuous function of a complex variable in approximate form as a computational algorithm or difference equation. Once the difference equation has been developed, digital filtering can be performed by the program on any input data list.

Moyer, R. A.↗

NASA NTRS1985

On optimal strategies in event-constrained differential games

Combat games are formulated as zero-sum differential games with unilateral event constraints. An interior penalty function approach is employed to approximate optimal strategies for the players. The method is very attractive computationally and possesses suitable approximation and convergence properties.

Heymann, M.↗

NASA NTRS1992

Low-energy multiple rendezvous of main belt asteroids

An approach to multiple asteroid rendezvous missions to the main belt region is proposed. In this approach key information which consists of a launch date and delta V can be generated for all possible pairs of asteroids satisfying specific constraints. This information is made available on a computer file for 1000 numbered asteroids with reasonable assumptions, limitations, and approximations to limit the computer requirements and the size of the data file.

Penzo, Paul A.↗

DOE OSTI2014

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Method for discovering relationships in data by dynamic quantum clustering

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1996

Development and Demonstration of an Ada Test Generation System

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

Source record↗

DOE OSTI2018

Sparse approximation of fitting surface by elastic net

The goal of this paper is to develop a computational model and corresponding efficient algorithm for obtaining a sparse representation of the fitting surface to the given scattered data. The basic idea of the model is to utilize the principal shift invariant space and the balanced l{sub 1},l{sub 2} norm minimization (named elastic net). The elastic net can be solved efficiently by an adapted split Bregman iteration algorithm. Numerical experiments indicate that by choosing appropriate regularization parameters, the model can efficiently provide an acceptable compromise between the minimization of the data mismatch term and the sparsity of the solution.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Structural, elastic, electronic and phonon properties of SnX{sub 2}O{sub 4} (X=Mg, Zn, Cd) spinel from density functional theory

First-principle calculations of structural, electronic, elastic and phonon properties of SnMg{sub 2}O{sub 4}, SnZn{sub 2}O{sub 4} and SnCd{sub 2}O{sub 4} compounds are presented, using the pseudo-potential plane waves approach based on density functional theory (DFT) within the generalized gradient approximation (GGA). The computed ground state structural parameters, i.e. lattice constants, internal free parameter and bulk modulus are in good agreement with the available theoretical results. Our calculated elastic constants are indicative of stability of SnX{sub 2}O{sub 4} (X=Mg, Zn, Cd) compounds in the spinel structure. The partial density of states (PDOS) of these compounds is in good agreement with the earlier ab-initio calculations. The phonon dispersion relations were calculated using the direct method. Phonon dispersion results indicate that SnZn{sub 2}O{sub 4} is dynamically stable, while SnMg{sub 2}O{sub 4} and SnCd{sub 2}O{sub 4} are unstable.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2021

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Parallelized POD-based suboptimal economic model predictive control of a state-constrained Boussinesq approximation

Motivated by an energy efficient building application, we want to optimize a quadratic cost functional subject to the Boussinesq approximation of the Navier-Stokes equations and to bilateral state and control constraints. Since the computation of such an optimal solution is numerically costly, we design an efficient strategy to compute a sub-optimal (but applicationally acceptable) solution with significantly reduced computational effort. We employ an economic Model Predictive Control (MPC) strategy to obtain a feedback control. The MPC sub-problems are based on a linear-quadratic optimal control problem subjected to mixed control and state constraints and a convection-diffusion equation, reduced with proper orthogonal decomposition. Finally, to solve each sub-problem, we apply a primal-dual active set strategy. The method can be fully parallelized, which enables the solution of large problems with real-world parameters.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Efficient solvers for hybridized three-field mixed finite element coupled poromechanics

We consider a mixed hybrid finite element formulation for coupled poromechanics. A stabilization strategy based on a macro-element approach is advanced to eliminate the spurious pressure modes appearing in undrained/incompressible conditions. The efficient solution of the stabilized mixed hybrid block system is addressed by developing a class of block triangular preconditioners based on a Schur-complement approximation strategy. Robustness, computational efficiency and scalability of the proposed approach are theoretically discussed and tested using challenging benchmark problems on massively parallel architectures.

42 ENGINEERING↗