Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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 271 records · Page 15

Gesture Based Control and EMG Decomposition

This paper presents two probabilistic developments for use with Electromyograms (EMG). First described is a new-electric interface for virtual device control based on gesture recognition. The second development is a Bayesian method for decomposing EMG into individual motor unit action potentials. This more complex technique will then allow for higher resolution in separating muscle groups for gesture recognition. All examples presented rely upon sampling EMG data from a subject's forearm. The gesture based recognition uses pattern recognition software that has been trained to identify gestures from among a given set of gestures. The pattern recognition software consists of hidden Markov models which are used to recognize the gestures as they are being performed in real-time from moving averages of EMG. Two experiments were conducted to examine the feasibility of this interface technology. The first replicated a virtual joystick interface, and the second replicated a keyboard. Moving averages of EMG do not provide easy distinction between fine muscle groups. To better distinguish between different fine motor skill muscle groups we present a Bayesian algorithm to separate surface EMG into representative motor unit action potentials. The algorithm is based upon differential Variable Component Analysis (dVCA) [l], [2] which was originally developed for Electroencephalograms. The algorithm uses a simple forward model representing a mixture of motor unit action potentials as seen across multiple channels. The parameters of this model are iteratively optimized for each component. Results are presented on both synthetic and experimental EMG data. The synthetic case has additive white noise and is compared with known components. The experimental EMG data was obtained using a custom linear electrode array designed for this study.

Wheeler, Kevin R.↗

Exploring the interplay of resilience and energy consumption for a task-based partial differential equations preconditioner

Here, we discuss algorithm-based resilience to silent data corruptions (SDCs) in a task-based domain-decomposition preconditioner for partial differential equations (PDEs). The algorithm exploits a reformulation of the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to SDCs. The implementation is based on a server-client model where all state information is held by the servers, while clients are designed solely as computational units. Scalability tests run up to ~51K cores show a parallel efficiency greater than 90%. We use a 2D elliptic PDE and a fault model based on random single and double bit-flip to demonstrate the resilience of the application to synthetically injected SDC. We discuss two fault scenarios: one based on the corruption of all data of a target task, and the other involving the corruption of a single data point. We show that for our application, given the test problem considered, a four-fold increase in the number of faults only yields a 2% change in the overhead to overcome their presence, from 7% to 9%. We then discuss potential savings in energy consumption via dynamic voltage/frequency scaling, and its interplay with fault-rates, and application overhead.

97 MATHEMATICS AND COMPUTING↗

A high-order WENO-limited finite-volume algorithm for atmospheric flow using the ADER-differential transform time discretization

A high-order-accurate weighted essentially non-oscillatory (WENO) limited upwind finite-volume scheme is detailed for the compressible, nonhydrostatic, inviscid Euler equations using an arbitrary derivatives (ADER) time-stepping scheme based on differential transforms (DTs). A second-order-accurate alternating Strang dimensional splitting is compared against multidimensional simulation with 2D transport using solid body rotation of various data. The two were found to give nearly identical accuracy in orthogonal, Cartesian coordinates. Orders of convergence are demonstrated at up to ninth-order accuracy with 2D transport. 1D transport is used to confirm that error decreases monotonically with increasing order of accuracy with WENO limiting even for discontinuous data. Further, WENO limiting always decreased the error compared with simulation without limiting in the L 1 norm. A series of standard 2D compressible nonhydrostatic Euler equation test cases were validated against previous results from literature. Finally, it was demonstrated that increasing the order of accuracy led to better resolved features and increased power for kinetic energy at small wavelengths.

54 ENVIRONMENTAL SCIENCES↗

Application of Backward Differentiation Formulas to Neutron Kinetics Problems

The neutron kinetics equations belong to the class of stiff equations for numerical time integration schemes. In this work, the accuracy and speed of algorithms based on backward differentiation formulas (BDFs) are studied with regard to point and spatial neutron kinetics problems. Using a BDF algorithm with the automatic selection of time step and order, solutions to a number of model problems with both a positive and negative reactivity insertion are analyzed. Plots of numerical cost dependences on local and global errors are presented. The results indicate that algorithms based on BDFs are highly efficient and that their application to nuclear reactor simulation is justified.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An explicitly solvable energy-conserving algorithm for pitch-angle scattering in magnetized plasmas

In this work, we develop an Explicitly Solvable Energy-Conserving (ESEC) algorithm for the Stochastic Differential Equation (SDE) describing the pitch-angle scattering process in magnetized plasmas. The Cayley transform is used to calculate both the deterministic gyromotion and stochastic scattering, affording the algorithm to be explicitly solvable and exactly energy conserving. An unusual property of the SDE for pitch-angle scattering is that its coefficients diverge at the zero velocity and do not satisfy the global Lipschitz condition. Consequently, when standard numerical methods, such as the Euler-Maruyama (EM), are applied, numerical convergence is difficult to establish. For the proposed ESEC algorithm, its energy-preserving property enables us to overcome this obstacle. We rigorously prove that the ESEC algorithm is order 1/2 strongly convergent. This result is confirmed by detailed numerical studies. For the case of pitch-angle scattering in a magnetized plasma with a constant magnetic field, the numerical solution is benchmarked against the analytical solution, and excellent agreements are found.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Simulation Analysis of Computer-Controlled pressurization for Mixture Ratio Control

A procedural code (C++) simulation was developed to investigate potentials for mixture ratio control of pressure-fed spacecraft rocket propulsion systems by measuring propellant flows, tank liquid quantities, or both, and using feedback from these measurements to adjust propellant tank pressures to set the correct operating mixture ratio for minimum propellant residuals. The pressurization system eliminated mechanical regulators in favor of a computer-controlled, servo- driven throttling valve. We found that a quasi-steady state simulation (pressure and flow transients in the pressurization systems resulting from changes in flow control valve position are ignored) is adequate for this purpose. Monte-Carlo methods are used to obtain simulated statistics on propellant depletion. Mixture ratio control algorithms based on proportional-integral-differential (PID) controller methods were developed. These algorithms actually set target tank pressures; the tank pressures are controlled by another PID controller. Simulation indicates this approach can provide reductions in residual propellants.

Alexander, Leslie A.↗

A novel multistage estimation of the signal parameters of a possibly data-modulated sinusoid under very high dynamics

A novel multistage estimation scheme is presented for estimating the parameters of a received carrier signal possibly phase-modulated by unknown data, and experiencing very high Doppler, Doppler rate, etc. Such a situation arises, for example, in the case of Global Positioning Systems (GPS) where the signal parameters are directly related to the position, velocity, acceleration and jerk of the GPS receiver. In the proposed multistage scheme, the first stage estimator operates as a coarse estimator resulting in higher rms estimation errors but with a relatively small probability of the frequency estimation error exceeding one-half of the sampling frequency (an event termed cycle slip). The second state of the estimator operates on the error signal available from the first stage, refining the overall estimates, and in the process also reduces the number of cycle slips. The first stage algorithm is selected to be a modified least squares algorithm operating upon the differential signal model and referred to as differential least squares. This estimation stage provides relatively coarse estimates of the frequency and its derivatives. The second algorithm is simply an extended Kalman filter which also yields the estimate of the phase along with a more refined estimate of frequency as well. A major advantage of the proposed algorithm is a reduction in the threshold on received carrier power-to-noise power spectral density ratio as compared to the threshold achievable by either of these algorithms alone. In fact, it appears from the simulations that for the case of an unmodulated carrier, the proposed scheme achieves the same threshold as for an almost exact and computationally intensive implementation of the maximum likelihood estimator.

Kumar, Rajendra↗

The Locus Algorithm III: A Grid Computing system to generate catalogues of optimised pointings for Differential Photometry

This paper discusses the hardware and software components of the Grid Computing system used to implement the Locus Algorithm to identify optimum pointings for differential photometry of 61,662,376 stars and 23,799 quasars. The scale of the data, together with initial operational assessments demanded a High Performance Computing (HPC) system to complete the data analysis. Grid computing was chosen as the HPC solution as the optimum choice available within this project. The physical and logical structure of the National Grid computing Infrastructure informed the approach that was taken. That approach was one of layered separation of the different project components to enable maximum flexibility and extensibility.

Creaner, Oisń↗

Computation of magnetic fields from field components on a plane grid

An algorithm is presented to calculate the field components of the magnetic field [B x (x, y, z), B y (x, y, z), B z (x, y, z)] at a point (x, y, z) in space, from the knowledge of the components [B x (x, y) = 0, z), B y (x, y = 0, z), B z (x, y = 0,z)] on a “reference plane”, which is normal to the y-axis at . The algorithm, which is a general one and is not restricted to fields with mid-plane symmetry is based on the Maclaurin series expansion of the magnetic field components at any point in space in terms of the distance (y) of the point from the reference plane. The coefficients of the Maclaurin series expansion are expressed in terms of the on-plane field components and their partial derivatives with respect to spatial coordinates (). The field components are usually generated from magnetic field measurements on a rectangular grid on the plane. This algorithm was employed in 1986 in the RAYTRACE computer code to help calculate the optical properties of magnets and of the Alternating Gradient Synchrotron (AGS) at the Brookhaven National Laboratory (BNL). Here, a general mathematical formulation of this algorithm based on the differential algebraic method was presented by Makino in 2011. This paper presents the step by step derivation of the algorithm and provides the necessary formulas to be introduced by the reader in any computer code which requires the field components generated by magnetic devices. In addition provides an example of the use of the algorithm and its limitations as applied to a Halbach type magnet with or without median plane symmetry.

43 PARTICLE ACCELERATORS↗

Neural network error correction for solving coupled ordinary differential equations

A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

Shelton, R. O.↗

Modeling of the propagation of low-frequency electromagnetic radiation in the Earth’s magnetosphere

A numerical algorithm for solving the set of differential equations describing the propagation of low-frequency electromagnetic radiation in the magnetospheric plasma, including in the presence of geomagnetic waveguides in the form of large-scale plasma density inhomogeneities stretched along the Earth’s magnetic field, has been developed. Calculations of three-dimensional ray trajectories in the magnetosphere and geomagnetic waveguide with allowance for radiation polarization have revealed characteristic tendencies in the behavior of electromagnetic parameters along the ray trajectory. The results of calculations can be used for magnetospheric plasma diagnostics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fifth-kind orthonormal Chebyshev polynomial solutions for fractional differential equations

The principal aim of the current paper is to present and analyze two new spectral algorithms for solving some types of linear and nonlinear fractional-order differential equations. The proposed algorithms are obtained by utilizing a certain kind of shifted Chebyshev polynomials called the shifted fifth-kind Chebyshev polynomials as basis functions along with the application of a modified spectral tau method. The class of fifth-kind Chebyshev polynomials is a special class of a basic class of symmetric orthogonal polynomials which are constructed with the aid of the extended Sturm–Liouville theorem for symmetric functions. An investigation for the convergence and error analysis of the proposed Chebyshev expansion is performed. For this purpose, a new connection formulae between Chebyshev polynomials of the first and fifth kinds are derived. The obtained numerical results ascertain that our two proposed algorithms are applicable, efficient and accurate.

97 MATHEMATICS AND COMPUTING↗

Comparative study of computational efficiency of two LU schemes for non-equilibrium reacting flows

The systems of equations governing chemically nonequilibrium flows are solved numerically by two lower-upper(LU) algorithms, namely, LU-SSOR (Yoon and Jameson, 1987) and LU-SW (Steger and Warming, 1981). The methods of flux-Jacobian splitting differentiate the two LU algorithms. The LU-SSOR gives a simpler implicit operator with less temporal damping, while the LU-SW converges faster but requires more computation for each iteration. Relative efficiencies and mutual merits of these two LU algorithms are compared. The results show that LU-SW with upwind-differenced right-hand-side gives the best convergence.

Tsai, Y.-L. Peter↗

Differential evolution: Global search problem in LEED-IV surface structural analysis

The search process associated with the quantitative theory–experiment comparison in Low Energy Electron Diffraction surface structural analysis can be very time consuming, especially in the case of complex materials with many atoms in the unit cell. Global search algorithms need to be employed to locate the global minimum of the reliability factor in the multi-dimensional structural parameter space. In this study we investigate the use of the Differential Evolution algorithm in Low Energy Electron Diffraction structural analysis. Despite the simplicity of its mechanism the Differential Evolution algorithm presents an impressive performance when applied to ultra-thin films of BaTiO{sub 3}(001) in a theory–theory comparison. A scaling relation of N{sup (1.47} {sup ±} {sup 0.08)} was obtained, where N is the total number of parameters to be optimized. - Highlights: • We investigated the use of the Differential Evolution algorithm (DE) for the LEED search problem. • The DE method was applied to the optimization of the surface structure of the BaTiO{sub 3}(001) ultra-thin films. • A very favorable scaling relation of N{sup 1.47} was obtained, where N is the total number of parameters to be optimized.

36 MATERIALS SCIENCE↗

A reactant-coordinate-based approach to state-to-state differential cross sections for tetratomic reactions

A new algorithm is proposed to compute quantum mechanically state-to-state differential cross sections for reactions involving four atoms in full dimensionality. This algorithm, which is based on the propagation of an initial state specific wave packet exclusively in reactant coordinates, extracts the S-matrix elements in the product channel by first interpolating the time-dependent wave packet using a collocation method at selected time intervals on the product coordinate grid and then projecting out the contributions of all final product states. Here, this approach is efficient and accurate, particularly for reactions that are dominated by a product well or long-range interactions. Validation of this approach is demonstrated for the H 2 + OH → H + H 2 O reaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-G-BRA-06: Quantification of Tracking Performance of a Multi-Layer Electronic Portal Imaging Device

Purpose: The purpose of this study was to quantify the improvement in tumor tracking, with and without fiducial markers, afforded by employing a multi-layer (MLI) electronic portal imaging device (EPID) over the current state-of-the-art, single-layer, digital megavolt imager (DMI) architecture. Methods: An ideal observer signal-to-noise ratio (d’) approach was used to quantify the ability of an MLI EPID and a current, state-of-the-art DMI EPID to track lung tumors from the treatment beam’s-eye-view. Using each detector modulation transfer function (MTF) and noise power spectrum (NPS) as inputs, a detection task was employed with object functions describing simple three-dimensional Cartesian shapes (spheres and cylinders). Marker-less tumor tracking algorithms often use texture discrimination to differentiate benign and malignant tissue. The performance of such algorithms is simulated by employing a discrimination task for the ideal observer, which measures the ability of a system to differentiate two image quantities. These were defined as the measured textures for benign and malignant lung tissue. Results: The NNPS of the MLI ∼25% of that of the DMI at the expense of decreased MTF at intermediate frequencies (0.25≤<f≤<0.5 cycles/mm). Lung tissue textures were found to follow a power-law trend in the frequency domain. It was found that for both fiducial marker tracking and lung tissue texture differentiation, the signal power of each task is retained at low frequencies. Thus, little difference may be observed in signal power when DMI and MLI are compared. In all cases, improvements in tracking were greater than a factor of 2. Conclusion: MLI performance in tumor tracking is greatly improved by the additional imager layers. This implies that further improvements in tracking may be gained through increasing the thickness of each MLI layer. For tracking, the MLI performance is limited by noise response. Losses in MTF result in negligible differences in d’. The project was partially supported by a grant from Varian Medical Systems, Inc. and grant No. R01CA188446-01 from the National Cancer Institute.

60 APPLIED LIFE SCIENCES↗

Locating the Discontinuities of a Bounded Function by the Partial Sums of its Fourier Series I: Periodical Case

A key step for some methods dealing with the reconstruction of a function with jump discontinuities is the accurate approximation of the jumps and their locations. Various methods have been suggested in the literature to obtain this valuable information. In the present paper, we develop an algorithm based on identities which determine the jumps of a 2(pi)-periodic bounded not-too-highly oscillating function by the partial sums of its differentiated Fourier series. The algorithm enables one to approximate the locations of discontinuities and the magnitudes of jumps of a bounded function. We study the accuracy of approximation and establish asymptotic expansions for the approximations of a 27(pi)-periodic piecewise smooth function with one discontinuity. By an appropriate linear combination, obtained via derivatives of different order, we significantly improve the accuracy. Next, we use Richardson's extrapolation method to enhance the accuracy even more. For a function with multiple discontinuities we establish simple formulae which "eliminate" all discontinuities of the function but one. Then we treat the function as if it had one singularity following the method described above.

Kvernadze, George↗

Application of two-point implicit central-difference methods to hyperbolic systems

This paper presents a general solution algorithm for the set of difference equations that arise when two-point central differences are used to approximate the flux difference terms in systems of hyperbolic differential equations. The general algorithm eliminates the weak points associated with the nonstandard algorithm reported by Wornom and Hafez (1986). The disadvantages of their algorithm relate to its implementation. It consists of separate algorithms for subsonic, supersonic, sonic and shock cells, applied individually, which presents a major bookkeeping problem when multiple sonic and shock cells are present. The general algorithm eliminates this problem and introduces an improved shock treatment which produces shocks with at most one interior shock point.

Wornom, Stephen F.↗