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 163 records · Page 9

Development of highly accurate approximate scheme for computing the charge transfer integral

The charge transfer integral is a key parameter required by various theoretical models to describe charge transport properties, e.g., in organic semiconductors. The accuracy of this important property depends on several factors, which include the level of electronic structure theory and internal simplifications of the applied formalism. The goal of this paper is to identify the performance of various approximate approaches of the latter category, while using the high level equation-of-motion coupled cluster theory for the electronic structure. The calculations have been performed on the ethylene dimer as one of the simplest model systems. By studying different spatial perturbations, it was shown that while both energy split in dimer and fragment charge difference methods are equivalent with the exact formulation for symmetrical displacements, they are less efficient when describing transfer integral along the asymmetric alteration coordinate. Since the “exact” scheme was found computationally expensive, we examine the possibility to obtain the asymmetric fluctuation of the transfer integral by a Taylor expansion along the coordinate space. By exploring the efficiency of this novel approach, we show that the Taylor expansion scheme represents an attractive alternative to the “exact” calculations due to a substantial reduction of computational costs, when a considerably large region of the potential energy surface is of interest. Moreover, we show that the Taylor expansion scheme, irrespective of the dimer symmetry, is very accurate for the entire range of geometry fluctuations that cover the space the molecule accesses at room temperature.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Equations and approximations involved in computing vertical wind velocities from superpressure balloon data

Superpressure, or constant-level, balloons have long been used to obtain horizontal wind velocities in the atmosphere. This paper presents equations which can be used to evaluate omega, the vertical wind component in pressure coordinates, from on-board pressure and temperature sensors. These equations take into account the short-term displacements of a balloon from its equilibrium density level, and thus they do not assume that the balloon precisely maintains constant density. The longer-term and larger-amplitude diurnal oscillations in balloon level, and also an approximation used in deriving the vertical velocity equations, are both discussed in some detail. These equations can be used to obtain quantitative estimates of omega if reasonable estimates of the ambient lapse rate could be obtained.

Banta, R. M.↗

Approximation algorithms in combinatorial scientific computing

We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted $b$ -matching, and minimization versions of weighted edge cover and $b$ -edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.

Mathematics↗

Job Management with mpi_jm

About this book: This book constitutes the refereed post-conference proceedings of 13 workshops held at the 33rd International ISC High Performance 2018 Conference, in Frankfurt, Germany, in June 2018: HPC I/O in the Data Center, HPC-IODC 2018; Workshop on Performance and Scalability of Storage Systems, WOPSSS 2018; 13th Workshop on Virtualization in High­-Performance Cloud Computing, VHPC 2018; Third International Workshop on In Situ Visualization, WOIV 2018; 4th International Workshop on Communication Architectures for HPC, Big Data, Deep Learning and Clouds at Extreme Scale, ExaComm 2018; International Workshop on OpenPOWER for HPC, IWOPH 2018; IXPUG Workshop: Many-Core Computing on Intel Processors; Workshop on Sustainable Ultrascale Computing Systems; Approximate and Transprecision Computing on Emerging Technologies, ATCET 2018; First Workshop on the Convergence of Large-Scale Simulation and Artificial Intelligence; Third Workshop for Open Source Supercomputing, OpenSuCo 2018; First Workshop on Interactive High-Performance Computing; Workshop on Performance Portable Programming Models for Accelerators, P^3MA 2018. The 53 full papers included in this volume were carefully reviewed and selected from 80 submissions. They cover all aspects of research, development, and application of large-scale, high performance experimental and commercial systems. Topics include HPC computer architecture and hardware; programming models, system software, and applications; solutions for heterogeneity, reliability, power efficiency of systems; virtualization and containerized environments; big data and cloud computing; and artificial intelligence.

Berkowitz, Evan↗

Use of steepest descent and various approximations for efficient computation of minimum noise aircraft landing trajectories

The following areas related to landing trajectory optimization research were discussed: (1) programming and modifying the steepest descent optimization procedure, (2) successfully iterating toward the optimum for a four-mile trajectory, (3) beginning optimization runs for a twenty-mile trajectory, and (4) adapt wind tunnel data for computer usage. Other related areas were discussed in detail in the two previous annual reports.

Cook, G.↗

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗

Structural optimization with approximate sensitivities

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

Patnaik, S. N.↗

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗

Nonreflecting far-field boundary conditions for unsteady transonic flow computation

The approximate nonreflecting far-field boundary condition, as proposed by Engquist and Majda, is implemented in the computer code LTRAN2. This code solves the implicit finite-difference representation of the small disturbance equations for unsteady transonic flows about airfoils. The nonreflecting boundary condition and the description of the algorithm for implementing these conditions in LTRAN2 are discussed. Various cases are computed and compared with results from the older, more conventional procedures. One concludes that the nonreflecting far-field boundary approximation allows the far-field boundary to be located closer to the airfoil; this permits a decrease in the computer time required to obtain the solution through the use of fewer mesh points.

Kwak, D.↗

Nonreflecting Far-Field Boundary Conditions for Unsteady Transonic Flow Computation

The approximate nonreflecting far-field boundary condition, as proposed by Engquisi and Majda, is implemented In the computer code LTRAN2. This code solves the Implicit finite-difference representation of the small-disturbance equations for unsteady transonic flows about airfoils. The nonreflecting boundary condition and the description of the algorithm for Implementing these conditions In LTRAN2 tire discussed. Various cases re computed and compared with results from the older, more conventional procedures. One concludes that the nonreflecting far-field boundary approximation allows the far-field boundary to be located closer to the airfoil; this permits a decrease in the computer lime required to obtain the solution through the use of fewer mesh points.

Kwak, D.↗