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 829 records · Page 46

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.↗

A Preliminary Study of In-House Monte Carlo Simulations: An Integrated Monte Carlo Verification System

Purpose: To develop an infrastructure for the integrated Monte Carlo verification system (MCVS) to verify the accuracy of conventional dose calculations, which often fail to accurately predict dose distributions, mainly due to inhomogeneities in the patient's anatomy, for example, in lung and bone. Methods and Materials: The MCVS consists of the graphical user interface (GUI) based on a computational environment for radiotherapy research (CERR) with MATLAB language. The MCVS GUI acts as an interface between the MCVS and a commercial treatment planning system to import the treatment plan, create MC input files, and analyze MC output dose files. The MCVS consists of the EGSnrc MC codes, which include EGSnrc/BEAMnrc to simulate the treatment head and EGSnrc/DOSXYZnrc to calculate the dose distributions in the patient/phantom. In order to improve computation time without approximations, an in-house cluster system was constructed. Results: The phase-space data of a 6-MV photon beam from a Varian Clinac unit was developed and used to establish several benchmarks under homogeneous conditions. The MC results agreed with the ionization chamber measurements to within 1%. The MCVS GUI could import and display the radiotherapy treatment plan created by the MC method and various treatment planning systems, such as RTOG and DICOM-RT formats. Dose distributions could be analyzed by using dose profiles and dose volume histograms and compared on the same platform. With the cluster system, calculation time was improved in line with the increase in the number of central processing units (CPUs) at a computation efficiency of more than 98%. Conclusions: Development of the MCVS was successful for performing MC simulations and analyzing dose distributions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

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↗

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.↗

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.↗

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.↗

Iso-geometric analysis for neutron diffusion problems

Iso-geometric analysis can be viewed as a generalisation of the finite element method. It permits the exact representation of a wider range of geometries including conic sections. This is possible due to the use of concepts employed in computer-aided design. The underlying mathematical representations from computer-aided design are used to capture both the geometry and approximate the solution. In this paper the neutron diffusion equation is solved using iso-geometric analysis. The practical advantages are highlighted by looking at the problem of a circular fuel pin in a square moderator. For this problem the finite element method requires the geometry to be approximated. This leads to errors in the shape and size of the interface between the fuel and the moderator. In contrast to this iso-geometric analysis allows the interface to be represented exactly. It is found that, due to a cancellation of errors, the finite element method converges more quickly than iso-geometric analysis for this problem. A fuel pin in a vacuum was then considered as this problem is highly sensitive to the leakage across the interface. In this case iso-geometric analysis greatly outperforms the finite element method. Due to the improvement in the representation of the geometry iso-geometric analysis can outperform traditional finite element methods. It is proposed that the use of iso-geometric analysis on neutron transport problems will allow deterministic solutions to be obtained for exact geometries. Something that is only currently possible with Monte Carlo techniques. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

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↗

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↗

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↗

Anharmonicity, mechanical instability, and thermodynamic properties of the Cr-Re σ-phase

Using density-functional theory in combination with the direct force method and molecular dynamics we investigate the vibrational properties of a binary Cr-Re σ-phase. In the harmonic approximation, we have computed phonon dispersion curves and density of states, evidencing structural and chemical effects. We found that the σ-phase is mechanically unstable in some configurations, for example, when all crystallographic sites are occupied by Re atoms. By using a molecular-dynamics-based method, we have analysed the anharmonicity in the system and found negligible effects (∼0.5 kJ/mol) on the Helmholtz energy of the binary Cr-Re σ-phase up to 2000 K (∼0.8T{sub m}). Finally, we show that the vibrational contribution has significant consequences on the disordering of the σ-phase at high temperature.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

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↗

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↗

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↗

Turbulent, extreme multi-zone model for simulating flux and polarization variability in blazars

The author presents a model for variability of the flux and polarization of blazars in which turbulent plasma flowing at a relativistic speed down a jet crosses a standing conical shock. The shock compresses the plasma and accelerates electrons to energies up to γ{sub max} ≳ 10{sup 4} times their rest-mass energy, with the value of γ{sub max} determined by the direction of the magnetic field relative to the shock front. The turbulence is approximated in a computer code as many cells, each with a uniform magnetic field whose direction is selected randomly. The density of high-energy electrons in the plasma changes randomly with time in a manner consistent with the power spectral density of flux variations derived from observations of blazars. The variations in flux and polarization are therefore caused by continuous noise processes rather than by singular events such as explosive injection of energy at the base of the jet. Sample simulations illustrate the behavior of flux and linear polarization versus time that such a model produces. The variations in γ-ray flux generated by the code are often, but not always, correlated with those at lower frequencies, and many of the flares are sharply peaked. The mean degree of polarization of synchrotron radiation is higher and its timescale of variability shorter toward higher frequencies, while the polarization electric vector sometimes randomly executes apparent rotations. The slope of the spectral energy distribution exhibits sharper breaks than can arise solely from energy losses. All of these results correspond to properties observed in blazars.

79 ASTRONOMY AND ASTROPHYSICS↗

Enhanced CMBR non-Gaussianities from Lorentz violation

We study the effects of Lorentz symmetry violation on the scalar CMBR bispectrum. We deal with dispersion relations modified by higher derivative terms in a Lorentz breaking effective action and solve the equations via approximation techniques, in particular the WKB method. We quantify the degree of approximation in the computation of the bispectrum and show how the absolute and relative errors can be made small at will, making the results robust. Our results show that there can be enhancements in the bispectrum for specific configurations in momentum space, when the modified dispersion relations violate the adiabatic condition for a short period of time in the early Universe. The kind of configurations that are enhanced and the pattern of oscillations in wavenumbers that generically appear in the bispectrum strictly depend on the form of the modified dispersion relation, and therefore on the pattern of Lorentz violation. These effects are found to be distinct from those that appear when modelling very high-energy (transplanckian) physics via modified boundary conditions (modified vacuum). In fact, under certain conditions, the enhancements can be even stronger, given equal interactions, and possibly open a door to the experimental study of Lorentz violation through these phenomena. After providing the general analysis, we also discuss briefly a specific example based on a healthy modification of the Corley-Jacobson dispersion relation with negative coefficient, and plot the shape of the bispectrum in that case.

79 ASTRONOMY AND ASTROPHYSICS↗