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 937 records · Page 52

Approximation algorithms for planning and control

A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.

Boddy, Mark↗

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗

Development and evaluation of a Kalman-filter algorithm for terminal area navigation using sensors of moderate accuracy

Translational state estimation in terminal area operations, using a set of commonly available position, air data, and acceleration sensors, is described. Kalman filtering is applied to obtain maximum estimation accuracy from the sensors but feasibility in real-time computations requires a variety of approximations and devices aimed at minimizing the required computation time with only negligible loss of accuracy. Accuracy behavior throughout the terminal area, its relation to sensor accuracy, its effect on trajectory tracking errors and control activity in an automatic flight control system, and its adequacy in terms of existing criteria for various terminal area operations are examined. The principal investigative tool is a simulation of the system.

Kanning, G.↗

A Kalman filter algorithm for terminal-area navigation with sensors of moderate accuracy

Translational state estimation in terminal area operations, using a set of commonly available position, air data, nd acceleration sensors, is described. Kalman filtering is applied to obtain maximum estimation occuracy from the sensors but feasibility in real-time computations requires a variety of approximations and devices aimed at minimizing the required computation time with only negligible loss of accuracy. Accuracy behavior throughout the terminal area, its relation to sensor accuracy, its effect on trajectory tracking errors and control activity in an automatic flight control system, and its adequacy in terms of existing criteria for various terminal area operations are examined. The principal investigative tool is a simulation of the system. Previously announced in STAR as N83-29193

Cicolani, L. S.↗

CSM research: Methods and application studies

Computational mechanics is that discipline of applied science and engineering devoted to the study of physical phenomena by means of computational methods based on mathematical modeling and simulation, utilizing digital computers. The discipline combines theoretical and applied mechanics, approximation theory, numerical analysis, and computer science. Computational mechanics has had a major impact on engineering analysis and design. When applied to structural mechanics, the discipline is referred to herein as computational structural mechanics. Complex structures being considered by NASA for the 1990's include composite primary aircraft structures and the space station. These structures will be much more difficult to analyze than today's structures and necessitate a major upgrade in computerized structural analysis technology. NASA has initiated a research activity in structural analysis called Computational Structural Mechanics (CSM). The broad objective of the CSM activity is to develop advanced structural analysis technology that will exploit modern and emerging computers, such as those with vector and/or parallel processing capabilities. Here, the current research directions for the Methods and Application Studies Team of the Langley CSM activity are described.

Knight, Norman F., Jr.↗

Tool employing homotopy-based approaches in finding the controlling unstable equilibrium point in the electric power grid

The analysis tool employs a computer-implemented algorithm that uses homotopy-based approaches to map the solution from the exit point to the controlling unstable equilibrium point (UEP). The computational time is reduced significantly by using an approximate exit point rather than computing an accurate exit point as it is required in finding the controlling UEPs using traditional transient stability direct methods. In addition, this method eliminates the necessity of computing the minimum gradient point (MGP) which is a key element in using Newton methods. These properties provide an advantage to homotopy-based approaches over traditional iterative methods in terms of both speed of computation and reliability of finding solutions.

97 MATHEMATICS AND COMPUTING↗

Validation of GPUMCD for low-energy brachytherapy seed dosimetry

Purpose: To validate GPUMCD, a new package for fast Monte Carlo dose calculations based on the GPU (graphics processing unit), as a tool for low-energy single seed brachytherapy dosimetry for specific seed models. As the currently accepted method of dose calculation in low-energy brachytherapy computations relies on severe approximations, a Monte Carlo based approach would result in more accurate dose calculations, taking in to consideration the patient anatomy as well as interseed attenuation. The first step is to evaluate the capability of GPUMCD to reproduce low-energy, single source, brachytherapy calculations which could ultimately result in fast and accurate, Monte Carlo based, brachytherapy dose calculations for routine planning. Methods: A mixed geometry engine was integrated to GPUMCD capable of handling parametric as well as voxelized geometries. In order to evaluate GPUMCD for brachytherapy calculations, several dosimetry parameters were computed and compared to values found in the literature. These parameters, defined by the AAPM Task-Group No. 43, are the radial dose function, the 2D anisotropy function, and the dose rate constant. These three parameters were computed for two different brachytherapy sources: the Amersham OncoSeed 6711 and the Imagyn IsoStar IS-12501. Results: GPUMCD was shown to yield dosimetric parameters similar to those found in the literature. It reproduces radial dose functions to within 1.25% for both sources in the 0.5< r <10 cm range. The 2D anisotropy function was found to be within 3% at r = 5 cm and within 4% at r = 1 cm. The dose rate constants obtained were within the range of other values reported in the literature.Conclusion: GPUMCD was shown to be able to reproduce various TG-43 parameters for two different low-energy brachytherapy sources found in the literature. The next step is to test GPUMCD as a fast clinical Monte Carlo brachytherapy dose calculations with multiple seeds and patient geometry, potentially providing more accurate results than the TG-43 formalism while being much faster than calculations using general purpose Monte Carlo codes.

61 RADIATION PROTECTION AND DOSIMETRY↗

Radiation Transport Around Axisymmetric Blunt Body Vehicles Using a Modified Differential Approximation

A moment method for computing 3-D radiative transport is applied to axisymmetric flows in thermochemical nonequilibrium. Such flows are representative of proposed aerobrake missions. The method uses the P-1 approximation to reduce the governing system of integro-di erential equations to a coupled set of partial di erential equations. A numerical solution method for these equations given actual variations of the radiation properties in thermochemical nonequilibrium blunt body flows is developed. Initial results from the method are shown and compared to tangent slab calculations. The agreement between the transport methods is found to be about 10 percent in the stagnation region, with the difference increasing along the flank of the vehicle.

Hartung, Lin C.↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Multi-element least square HDMR methods and their applications for stochastic multiscale model reduction

Stochastic multiscale modeling has become a necessary approach to quantify uncertainty and characterize multiscale phenomena for many practical problems such as flows in stochastic porous media. The numerical treatment of the stochastic multiscale models can be very challengeable as the existence of complex uncertainty and multiple physical scales in the models. To efficiently take care of the difficulty, we construct a computational reduced model. To this end, we propose a multi-element least square high-dimensional model representation (HDMR) method, through which the random domain is adaptively decomposed into a few subdomains, and a local least square HDMR is constructed in each subdomain. These local HDMRs are represented by a finite number of orthogonal basis functions defined in low-dimensional random spaces. The coefficients in the local HDMRs are determined using least square methods. We paste all the local HDMR approximations together to form a global HDMR approximation. To further reduce computational cost, we present a multi-element reduced least-square HDMR, which improves both efficiency and approximation accuracy in certain conditions. To effectively treat heterogeneity properties and multiscale features in the models, we integrate multiscale finite element methods with multi-element least-square HDMR for stochastic multiscale model reduction. This approach significantly reduces the original model's complexity in both the resolution of the physical space and the high-dimensional stochastic space. We analyze the proposed approach, and provide a set of numerical experiments to demonstrate the performance of the presented model reduction techniques. - Highlights: • Multi-element least square HDMR is proposed to treat stochastic models. • Random domain is adaptively decomposed into some subdomains to obtain adaptive multi-element HDMR. • Least-square reduced HDMR is proposed to enhance computation efficiency and approximation accuracy in certain conditions. • Integrating MsFEM and multi-element least square HDMR can significantly reduce computation complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗

Extending the radial diffusion model of Falthammar to non-dipole background field

A model for radial diffusion caused by electromagnetic disturbances was published by Falthammar (1965) using a two-parameter model of the disturbance perturbing a background dipole magnetic field. Schulz and Lanzerotti (1974) extended this model by recognizing the two parameter perturbation as the leading (non--dipole) terms of the Mead Williams magnetic field model. They emphasized that the magnetic perturbation in such a model induces an electric ield that can be calculated from the motion of field lines on which the particles are ‘frozen’. Roederer and Zhang (2014) describe how the field lines on which the particles are frozen can be calculated by tracing the unperturbed field lines from the minimum-B location to the ionospheric footpoint, and then tracing the perturbed field (which shares the same ionospheric footpoint due to the frozen -in condition) from the ionospheric footpoint back to a perturbed minimum B location. The instantaneous change n Roederer L*, dL*/dt, can then be computed as the product (dL*/dphi)*(dphi/dt). dL*/Dphi is linearly dependent on the perturbation parameters (to first order) and is obtained by computing the drift across L*-labeled perturbed field lines, while dphi/dt is related to the bounce-averaged gradient-curvature drift velocity. The advantage of assuming a dipole background magnetic field, as in these previous studies, is that the instantaneous dL*/dt can be computed analytically (with some approximations), as can the DLL that results from integrating dL*/dt over time and computing the expected value of (dL*)^2. The approach can also be applied to complex background magnetic field models like T89 or TS04, on top of which the small perturbations are added, but an analytical solution is not possible and so a numerical solution must be implemented. In this talk, I discuss our progress in implementing a numerical solution to the calculation of DL*L* using arbitrary background field models with simple electromagnetic perturbations.

58 GEOSCIENCES↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

A Neural Network Correction to the Scalar Approximation in Radiative Transfer

The next generation of advanced high-resolution sensors in geostationary orbit will gather detailed information for studying the Earth system. There is an increasing desire to perform observing system simulation experiments (OSSEs) for new sensors during the development phase of the mission in order to better leverage information content from the new and existing sensors. Forward radiative transfer calculations that simulate the observing characteristics of a new instrument are the first step to an OSSE, and they are computationally intensive. The scalar approximation to the radiative transfer equation, a simplification of the vector representation, can save considerable computational cost, but produces errors in top of the atmosphere (TOA) radiance as large as 10% due to neglecting polarization effects. This article presents an artificial neural network technique to correct scalar TOA radiance over both land and ocean surfaces to within 1% of vector-calculated radiance. A neural network was trained on a database of scalar-vector TOA radiance differences at a large range of solar and viewing angles for several thousand realistic atmospheric vertical profiles that were sampled from a high resolution (7 km) global atmospheric transport model. The profiles include Rayleigh scattering and aerosol scattering and absorption. Training and validation of the neural network was demonstrated for two wavelengths in the ultraviolet-visible (US-Vis) spectral range (354 nm and 670 nm). The significant computational savings accrued from using a scalar approximation plus neural network correction approach to simulating TOA radiance will make feasible hyperspectral forward simulations of high-resolution sensors on geostationary satellites, such as TEMPO, GOES-R, GEMS, and SENTINEL-4.

TOA↗

Quantitative Prediction of Optical Absorption in Molecular Solids from an Optimally Tuned Screened Range-Separated Hybrid Functional

In this work, we show that fundamental gaps and optical spectra of molecular solids can be predicted quantitatively and nonempirically within the framework of time-dependent density functional theory (TDDFT) using the recently developed optimally tuned screened range-separated hybrid (OT-SRSH) functional approach. In this scheme, the electronic structure of the gas-phase molecule is determined by optimal tuning of the range-separation parameter in a range-separated hybrid functional. Screening and polarization in the solid state are taken into account by adding long-range dielectric screening to the functional form, with the modified functional used to perform self-consistent periodic-boundary calculations for the crystalline solid. We provide a comprehensive benchmark for the accuracy of our approach by considering the X23 set of molecular solids and comparing results obtained from TDDFT with those obtained from many-body perturbation theory in the GW-BSE approximation. We additionally compare results obtained from dielectric screening computed within the random-phase approximation to those obtained from the computationally more efficient many-body dispersion approach and find that this influences the fundamental gap but has little effect on the optical spectra. Our approach is therefore robust and can be used for studies of molecular solids that are typically beyond the reach of computationally more intensive methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-order harmonic propagation in gases within the discrete dipole approximation

We present an efficient approach for computing high-order harmonic propagation based on the discrete dipole approximation. In contrast with other approaches, our strategy is based on computing the total field as the superposition of the driving field with the field radiated by the elemental emitters of the sample. In this way we avoid the numerical integration of the wave equation, as Maxwell's equations have an analytical solution for an elementary (pointlike) emitter. The present strategy is valid for low-pressure gases interacting with strong fields near the saturation threshold (i.e., partially ionized), which is a common situation in the experiments of high-order harmonic generation. We use this tool to study the dependence of phase matching of high-order harmonics with the relative position between the beam focus and the gas jet.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exemplifying Quantum Systems in a Finite Element Basis

This paper presents a description of the abstractions required for the expression and solution of the linear single-particle Schroedinger equation in a finite element basis. This paper consists of two disparate themes: First, to layout and establish the foundations of finite element analysis as an approximate numerical solution to extendable quantum mechanical systems; and second, to promote a high-performance open-source computational model for the approximate numerical solution to quantum mechanical systems. The structural foundation of the one-and two-dimensional time-independent Schroedinger equation describing an infinite potential well is explored and a brief overview of the hierarchal design of the computational library written in C++ is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗