SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,189 records · Page 66

All sources NASA NTRS DOE OSTI

NASA NTRS2003

First Year Wilkinson Microwave Anisotropy Probe(WMAP) Observations: Data Processing Methods and Systematic Errors Limits

We describe the calibration and data processing methods used to generate full-sky maps of the cosmic microwave background (CMB) from the first year of Wilkinson Microwave Anisotropy Probe (WMAP) observations. Detailed limits on residual systematic errors are assigned based largely on analyses of the flight data supplemented, where necessary, with results from ground tests. The data are calibrated in flight using the dipole modulation of the CMB due to the observatory's motion around the Sun. This constitutes a full-beam calibration source. An iterative algorithm simultaneously fits the time-ordered data to obtain calibration parameters and pixelized sky map temperatures. The noise properties are determined by analyzing the time-ordered data with this sky signal estimate subtracted. Based on this, we apply a pre-whitening filter to the time-ordered data to remove a low level of l/f noise. We infer and correct for a small (approx. 1 %) transmission imbalance between the two sky inputs to each differential radiometer, and we subtract a small sidelobe correction from the 23 GHz (K band) map prior to further analysis. No other systematic error corrections are applied to the data. Calibration and baseline artifacts, including the response to environmental perturbations, are negligible. Systematic uncertainties are comparable to statistical uncertainties in the characterization of the beam response. Both are accounted for in the covariance matrix of the window function and are propagated to uncertainties in the final power spectrum. We characterize the combined upper limits to residual systematic uncertainties through the pixel covariance matrix.

Hinshaw, G.↗

NASA NTRS2012

SpaceCube Mini

This version of the SpaceCube will be a full-fledged, onboard space processing system capable of 2500+ MIPS, and featuring a number of plug-andplay gigabit and standard interfaces, all in a condensed 3x3x3 form factor [less than 10 watts and less than 3 lb (approximately equal to 1.4 kg)]. The main processing engine is the Xilinx SIRF radiation- hardened-by-design Virtex-5 FX-130T field-programmable gate array (FPGA). Even as the SpaceCube 2.0 version (currently under test) is being targeted as the platform of choice for a number of the upcoming Earth Science Decadal Survey missions, GSFC has been contacted by customers who wish to see a system that incorporates key features of the version 2.0 architecture in an even smaller form factor. In order to fulfill that need, the SpaceCube Mini is being designed, and will be a very compact and low-power system. A similar flight system with this combination of small size, low power, low cost, adaptability, and extremely high processing power does not otherwise exist, and the SpaceCube Mini will be of tremendous benefit to GSFC and its partners. The SpaceCube Mini will utilize space-grade components. The primary processing engine of the Mini is the Xilinx Virtex-5 SIRF FX-130T radiation-hardened-by-design FPGA for critical flight applications in high-radiation environments. The Mini can also be equipped with a commercial Xilinx Virtex-5 FPGA with integrated PowerPCs for a low-cost, high-power computing platform for use in the relatively radiation- benign LEOs (low-Earth orbits). In either case, this version of the Space-Cube will weigh less than 3 pounds (.1.4 kg), conform to the CubeSat form-factor (10x10x10 cm), and will be low power (less than 10 watts for typical applications). The SpaceCube Mini will have a radiation-hardened Aeroflex FPGA for configuring and scrubbing the Xilinx FPGA by utilizing the onboard FLASH memory to store the configuration files. The FLASH memory will also be used for storing algorithm and application code for the PowerPCs and the Xilinx FPGA. In addition, it will feature highspeed DDR SDRAM (double data rate synchronous dynamic random-access memory) to store the instructions and data of active applications. This version will also feature SATA-II and Gigabit Ethernet interfaces. Furthermore, there will also be general-purpose, multi-gigabit interfaces. In addition, the system will have dozens of transceivers that can support LVDS (low-voltage differential signaling), RS-422, or SpaceWire. The SpaceCube Mini includes an I/O card that can be customized to meet the needs of each mission. This version of the SpaceCube will be designed so that multiple Minis can be networked together using SpaceWire, Ethernet, or even a custom protocol. Scalability can be provided by networking multiple SpaceCube Minis together. Rigid-Flex technology is being targeted for the construction of the SpaceCube Mini, which will make the extremely compact and low-weight design feasible. The SpaceCube Mini is designed to fit in the compact CubeSat form factor, thus allowing deployment in a new class of missions that the previous SpaceCube versions were not suited for. At the time of this reporting, engineering units should be available in the summer 2012.

Michael Lin↗

NASA NTRS2019

Search for Eccentric Binary Black Hole Mergers with Advanced LIGO and Advanced Virgo during Their First and Second Observing Runs

When formed through dynamical interactions, stellar-mass binary black holes (BBHs) may retain eccentric orbits (e > 0.1 at 10 Hz) detectable by ground-based gravitational-wave detectors. Eccentricity can therefore be used to differentiate dynamically formed binaries from isolated BBH mergers. Current template-based gravitational-wave searches do not use waveform models associated with eccentric orbits, rendering the search less efficient for eccentric binary systems. Here we present the results of a search for BBH mergers that inspiral in eccentric orbits using data from the first and second observing runs (O1 and O2) of Advanced LIGO and Advanced Virgo. We carried out the search with the coherent WaveBurst algorithm, which uses minimal assumptions on the signal morphology and does not rely on binary waveform templates. We show that it is sensitive to binary mergers with a detection range that is weakly dependent on eccentricity for all bound systems. Our search did not identify any new binary merger candidates. We interpret these results in light of eccentric binary formation models. We rule out formation channels with rates ≳100 Gpc−3 yr−1 for e > 0.1, assuming a black hole mass spectrum with a power-law index ≲2.

B. P. Abbott↗

DOE OSTI2023

Transformer Health Monitoring via Synchrophasors

Traditional transformer protection schemes such as differential protection operate once the transformer is in a critical state. Proactive means of transformer health evaluation such as Sweep Frequency Response Analysis, can only be performed periodically with the transformer out-of-service. This work presents a framework where the health and structural integrity of transformers is monitored via synchrophasors in real-time. Synchrophasors and subspace estimation techniques are used to build reduced-order models which are then analyzed across multiple domains. A diagnostics algorithm is developed and tested via Matlab simulations. Test results are promising, opening up new prospects in transformer protection research.

cyber-physical security↗

NASA NTRS1974

Fast direct numerical solution of the nonhomogeneous Cauchy-Riemann equations

A fast direct (noniterative) 'Cauchy-Riemann Solver' is developed for solving the finite-difference equations representing systems of first-order elliptic partial differential equations in the form of the nonhomogeneous Cauchy-Riemann equations. The method is second-order accurate and requires approximately the same computer time as a fast cyclic-reduction Poisson solver. The accuracy and efficiency of the direct solver are demonstrated in an application to solving an example problem in aerodynamics: subsonic inviscid flow over a biconvex airfoil. The analytical small-perturbation solution contains singularities, which are captured well by the computational technique. The algorithm is expected to be useful in nonlinear subsonic and transonic aerodynamics.

Lomax, H.↗

NASA NTRS1990

Solving unstructured grid problems on massively parallel computers

A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Hammond, Steven W.↗

NASA NTRS1999

Martian Aerocapture Terminal Point Guidance: A Reference Path Optimization Study

An effective method of terminal point guidance is to employ influence coefficients, which are solved from a set of differential equations adjoint to the linearized perturbations of the equations of motion about a reference trajectory. Hence, to optimize this type of guidance, one must first optimize the reference trajectory that the guidance is based upon. This study concentrates on various methods to optimize a reference trajectory for a Martian aerocapture maneuver, including a parametric analysis and first order gradient method. Resulting reference trajectories were tested in separate 2000 6-DOF Monte Carlo runs, using the Atmospheric Guidance Algorithm Testbed for the Mars Surveyor Program 2001 (MSP '01) Orbiter. These results were compared to an August 1998 study using the same terminal point control guidance algorithm and simulation testbed. Satisfactory improvements over the 1998 study are amply demonstrated.

Ro, Theodore U.↗

NASA NTRS1987

General purpose algorithms for characterization of slow and fast phase nystagmus

In the overall aim for a better understanding of the vestibular and optokinetic systems and their roles in space motion sickness, the eye movement responses to various dynamic stimuli are measured. The vestibulo-ocular reflex (VOR) and the optokinetic response, as the eye movement responses are known, consist of slow phase and fast phase nystagmus. The specific objective is to develop software programs necessary to characterize the vestibulo-ocular and optokinetic responses by distinguishing between the two phases of nystagmus. The overall program is to handle large volumes of highly variable data with minimum operator interaction. The programs include digital filters, differentiation, identification of fast phases, and reconstruction of the slow phase with a least squares fit such that sinusoidal or psuedorandom data may be processed with accurate results. The resultant waveform, slow phase velocity eye movements, serves as input data to the spectral analysis programs previously developed for NASA to analyze nystagmus responses to pseudorandom angular velocity inputs.

Lessard, Charles S.↗

NASA NTRS1986

Ramp-integration technique for capacitance-type blade-tip clearance measurement

The analysis of a proposed new technique for capacitance type blade tip clearance measurement is presented. The capacitance between the blade tip and a mounted capacitance electrode within a guard ring forms one of the feedback elements of a high speed operational amplifier. The differential equation governing the operational amplifier circuit is formulated and solved for two types of inputs to the amplifier - a constant voltage and a ramp. The resultant solutions shows an output that contains a term that is proportional to the derivative of the product of the input voltage and the time constant of the feedback network. The blade tip clearance capacitance is obtained by subtracting the output of a balancing reference channel followed by integration. The proposed sampled data algorithm corrects the environmental effects and varying rotor speeds on-line, making the system suitable for turbine instrumentation. System requirements, block diagrams, and typical application are included.

Sarma, G. R.↗

NASA NTRS1984

Asymptotic (h tending to infinity) absolute stability for BDFs applied to stiff differential equations

Methods based on backward differentiation formulas (BDFs) for solving stiff differential equations require iterating to approximate the solution of the corrector equation on each step. One hope for reducing the cost of this is to make do with iteration matrices that are known to have errors and to do no more iterations than are necessary to maintain the stability of the method. This paper, following work by Klopfenstein, examines the effect of errors in the iteration matrix on the stability of the method. Application of the results to an algorithm is discussed briefly.

Krogh, F. T.↗

NASA NTRS1986

Ramp-integration technique for capacitance-type blade-tip clearance measurement

The analysis of a proposed new technique for capacitance type blade tip clearance measurement is presented. The capacitance between the blade tip and a mounted capacitance electrode within a guard ring forms one of the feedback elements of a high speed operational amplifier. The differential equation governing the operational amplifier circuit is formulated and solved for two types of inputs to the amplifier - a constant voltage and a ramp. The resultant solution shows an output that contains a term that is proportional to the derivative of the product of the input voltage and the time constant of the feedback network. The blade tip clearance capacitance is obtained by subtracting the output of a balancing reference channel followed by integration. The proposed sampled data algorithm corrects for environmental effects and varying rotor speeds on-line, making the system suitable for turbine instrumentation. System requirements, block diagrams, and a typical application are included.

Sarma, Garimella R.↗

DOE OSTI2024

GrainGNN: A dynamic graph neural network for predicting 3D grain microstructure

We propose GrainGNN, a surrogate model for the evolution of polycrystalline grain structure under rapid solidification conditions in metal additive manufacturing. High fidelity simulations of solidification microstructures are typically performed using multicomponent partial differential equations (PDEs) with moving interfaces. The inherent randomness of the PDE initial conditions (grain seeds) necessitates ensemble simulations to predict microstructure statistics, e.g., grain size, aspect ratio, and crystallographic orientation. Here, currently such ensemble simulations are prohibitively expensive and surrogates are necessary.In GrainGNN, we use a dynamic graph to represent interface motion and topological changes due to grain coarsening. We use a reduced representation of the microstructure using hand-crafted features; we combine pattern finding and altering graph algorithms with two neural networks, a classifier (for topological changes) and a regressor (for interface motion). Both networks have an encoder-decoder architecture; the encoder has a multi-layer transformer long-short-term-memory architecture; the decoder is a single layer perceptron.We evaluate GrainGNN by comparing it to high-fidelity phase field simulations for in-distribution and out-of-distribution grain configurations for solidification under laser power bed fusion conditions. GrainGNN results in 80%–90% pointwise accuracy; and nearly identical distributions of scalar quantities of interest (QoI) between phase field and GrainGNN simulations compared using Kolmogorov-Smirnov test. GrainGNN's inference speedup (PyTorch on single x86 CPU) over a high-fidelity phase field simulation (CUDA on a single NVIDIA A100 GPU) is 150×–2000× for 100-initial grain problem. Further, using GrainGNN, we model the formation of 11,600 grains in 220 seconds on a single CPU core.

36 MATERIALS SCIENCE↗

NASA NTRS1990

Real-time image processing II; Proceedings of the Meeting, Orlando, FL, Apr. 16-18, 1990

The present conference discusses topics in the fields of feature extraction and implementation, filter and correlation algorithms, optical correlators, high-level algorithms, and digital image processing for ranging and remote driving. Attention is given to a nonlinear filter derived from topological image features, IR image segmentation through iterative thresholding, orthogonal subspaces for correlation masking, composite filter trees and image recognition via binary search, and features of matrix-coherent optical image processing. Also discussed are multitarget tracking via hybrid joint transform correlator, binary joint Fourier transform correlator considerations, global image processing operations on parallel architectures, real-time implementation of a differential range finder, and real-time binocular stereo range and motion detection.

Juday, Richard D.↗

NASA NTRS2003

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗

NASA NTRS1989

Querying databases of trajectories of differential equations: Data structures for trajectories

One approach to qualitative reasoning about dynamical systems is to extract qualitative information by searching or making queries on databases containing very large numbers of trajectories. The efficiency of such queries depends crucially upon finding an appropriate data structure for trajectories of dynamical systems. Suppose that a large number of parameterized trajectories gamma of a dynamical system evolving in R sup N are stored in a database. Let Eta is contained in set R sup N denote a parameterized path in Euclidean Space, and let the Euclidean Norm denote a norm on the space of paths. A data structure is defined to represent trajectories of dynamical systems, and an algorithm is sketched which answers queries.

Grossman, Robert↗

DOE OSTI2024

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Production of Λ and $K^{0}_{S}$ in jets in p–Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV and pp collisions at $\sqrt{s}$ =7 TeV

The production of Λ baryons and $K^{0}_{S}$ mesons (V 0 particles) was measured in p–Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV and pp collisions at $\sqrt{s}$ = 7 TeV with ALICE at the LHC. The production of these strange particles is studied separately for particles associated with hard scatterings and the underlying event to shed light on the baryon-to-meson ratio enhancement observed at intermediate transverse momentum (p T ) in high multiplicity pp and p–Pb collisions. Hard scatterings are selected on an event-by-event basis with jets reconstructed with the anti-k T algorithm using charged particles. The production of strange particles associated with jets $p^{ch}_{T,}$ jet > 10 and $p^{ch}_{T,}$ jet > 20 GeV/c in p–Pb collisions, and with jet $p^{ch}_{T,}$ jet > 10 GeV/c in pp collisions is reported as a function of p T . Its dependence on angular distance from the jet axis, R(V 0 , jet), for jets with $p^{ch}_{T,}$ jet > 10 GeV/c in p–Pb collisions is reported as well. The p T -differential production spectra of strange particles associated with jets are found to be harder compared to that in the underlying event and both differ from the inclusive measurements. In events containing a jet, the density of the V 0 particles in the underlying event is found to be larger than the density in the minimum bias events. The Λ/$K^{0}_{S}$ ratio associated with jets in p–Pb collisions is consistent with the ratio in pp collisions and follows the expectation of jets fragmenting in vacuum. On the other hand, this ratio within jets is consistently lower than the one obtained in the underlying event and it does not show the characteristic enhancement of baryons at intermediate p T often referred to as “baryon anomaly” in the inclusive measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Entropic control of the free-energy landscape of an archetypal biomolecular machine

Biomolecular machines are complex macromolecular assemblies that utilize thermal and chemical energy to perform essential, multistep, cellular processes. Despite possessing different architectures and functions, an essential feature of the mechanisms of action of all such machines is that they require dynamic rearrangements of structural components. Surprisingly, biomolecular machines generally possess only a limited set of such motions, suggesting that these dynamics must be repurposed to drive different mechanistic steps. Although ligands that interact with these machines are known to drive such repurposing, the physical and structural mechanisms through which ligands achieve this remain unknown. Using temperature-dependent, single-molecule measurements analyzed with a time-resolution-enhancing algorithm, here, we dissect the free-energy landscape of an archetypal biomolecular machine, the bacterial ribosome, to reveal how its dynamics are repurposed to drive distinct steps during ribosome-catalyzed protein synthesis. Specifically, we show that the free-energy landscape of the ribosome encompasses a network of allosterically coupled structural elements that coordinates the motions of these elements. Moreover, we reveal that ribosomal ligands which participate in disparate steps of the protein synthesis pathway repurpose this network by differentially modulating the structural flexibility of the ribosomal complex (i.e., the entropic component of the free-energy landscape). Here, we propose that such ligand-dependent entropic control of free-energy landscapes has evolved as a general strategy through which ligands may regulate the functions of all biomolecular machines. Such entropic control is therefore an important driver in the evolution of naturally occurring biomolecular machines and a critical consideration for the design of synthetic molecular machines.

Science & Technology - Other Topics↗