SEARCH · Engineering Papers

Results for “variational algorithms”

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 595 records · Page 33

All sources NASA NTRS DOE OSTI

NASA NTRS2004

Methods and Piezoelectric Imbedded Sensors for Damage Detection in Composite Plates Under Ambient and Cryogenic Conditions

New methods for structural health monitoring are being assessed, especially in high-performance, extreme environment, safety-critical applications. One such application is for composite cryogenic fuel tanks. The work presented here attempts to characterize and investigate the feasibility of using imbedded piezoelectric sensors to detect cracks and delaminations under cryogenic and ambient conditions. A variety of damage detection methods and different Sensors are employed in the different composite plate samples to aid in determining an optimal algorithm, sensor placement strategy, and type of imbedded sensor to use. Variations of frequency, impedance measurements, and pulse echoing techniques of the sensors are employed and compared. Statistical and analytic techniques are then used to determine which method is most desirable for a specific type of damage. These results are furthermore compared with previous work using externally mounted sensors. Results and optimized methods from this work can then be incorporated into a larger composite structure to validate and assess its structural health. This could prove to be important in the development and qualification of any 2" generation reusable launch vehicle using composites as a structural element.

Engberg, Robert↗

NASA NTRS2005

Structural Health Monitoring of Composite Plates Under Ambient and Cryogenic Conditions

Methods for structural health monitoring are now being assessed, especially in high-performance, extreme environment, safety-critical applications. One such application is for composite cryogenic fuel tanks. The work presented here attempts to characterize and investigate the feasibility of using imbedded piezoelectric sensors to detect cracks and delaminations under cryogenic and ambient conditions. Different types of excitation and response signals and different sensors are employed in composite plate samples to aid in determining an optimal algorithm, sensor placement strategy, and type of imbedded sensor to use. Variations of frequency and high frequency chirps of the sensors are employed and compared. Statistical and analytic techniques are then used to determine which method is most desirable for a specific type of damage and operating environment. These results are furthermore compared with previous work using externally mounted sensors. More work is needed to accurately account for changes in temperature seen in these environments and be statistically significant. Sensor development and placement strategy are other areas of further work to make structural health monitoring more robust. Results from this and other work might then be incorporated into a larger composite structure to validate and assess its structural health. This could prove to be important in the development and qualification of any 2nd generation reusable launch vehicle using composites as a structural element.

Engberg, Robert C.↗

NASA NTRS2000

Atmospheric studies with the Multi-angle Imaging SpectroRadiometer (MISR)

Multi-angle Imaging SpectroRadiometer observations facilitate new atmospheric remote sensing methods. Angular variation of radiometric and geometric scene attributes, in conjunction with new algorithms, enables retrieval of aerosol properties, cloud heights, and cloud-traced winds.

MISR atmospheric studies↗

DOE OSTI2024

Variation-Resilient FeFET-Based In-Memory Computing Leveraging Probabilistic Deep Learning

Reliability issues stemming from device level nonidealities of nonvolatile emerging technologies like ferroelectric field-effect transistors (FeFETs), especially at scaled dimensions, cause substantial degradation in the accuracy of in-memory crossbar-based AI systems. Here, in this work, we present a variation-aware design technique to characterize the device level variations and to mitigate their impact on hardware accuracy employing a Bayesian neural network (BNN) approach. An effective conductance variation model is derived from the experimental measurements of cycle-to-cycle (C2C) and device-to-device (D2D) variations performed on FeFET devices fabricated using 28 nm high-k metal gate technology. The variations were found to be a function of different conductance states within the given programming range, which sharply contrasts earlier efforts where a fixed variation dispersion was considered for all conductance values. Such variation characteristics formulated for three different device sizes at different read voltages were provided as prior variation information to the BNN to yield a more exact and reliable inference. Near-ideal accuracy for shallow networks (MLP5 and LeNet models) on the MNIST dataset and limited accuracy decline by ~3.8%–16.1% for deeper AlexNet models on CIFAR10 dataset under a wide range of variations corresponding to different device sizes and read voltages, demonstrates the efficacy of our proposed device-algorithm co-design technique.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Natural evolutionary strategies for variational quantum computation

Abstract Natural evolutionary strategies (NES) are a family of gradient-free black-box optimization algorithms. This study illustrates their use for the optimization of randomly initialized parameterized quantum circuits (PQCs) in the region of vanishing gradients. We show that using the NES gradient estimator the exponential decrease in variance can be alleviated. We implement two specific approaches, the exponential and separable NES, for parameter optimization of PQCs and compare them against standard gradient descent. We apply them to two different problems of ground state energy estimation using variational quantum eigensolver and state preparation with circuits of varying depth and length. We also introduce batch optimization for circuits with larger depth to extend the use of ES to a larger number of parameters. We achieve accuracy comparable to state-of-the-art optimization techniques in all the above cases with a lower number of circuit evaluations. Our empirical results indicate that one can use NES as a hybrid tool in tandem with other gradient-based methods for optimization of deep quantum circuits in regions with vanishing gradients.

Anand, Abhinav (ORCID:0000000280812310)↗

DOE OSTI2021

Variational quantum solver employing the PDS energy functional

In our previous work (J. Chem. Phys. 2020, 153, 201102),we reported a new class of quantum algorithms that are based on the quantum computation of the connected moment expansion to find the ground and excited state energies. In particular, the Peeters-Devreese-Soldatov (PDS) formulation is found variational and bearing the potential for further combining with the existing variational quantum infrastructure. Following this direction, here we propose a variational quantum solver employing the PDS energy gradient. In comparison with the usual variational quantum eigensolver (VQE) and the original static PDS approach, the proposed variational quantum solver offers an effective approach to achieve high ac-curacy at finding the ground state and its energy through the rotation of the trial wave function of modest quality guided by the low order PDS energy gradients, thus improves the ac-curacy and efficiency of the quantum simulation. We demonstrate the performance of the proposed variational quantum solver for toy models, H2molecule, and strongly correlated planar H4system in some challenging situations. In all the case studies, the proposed variational quantum approach out-performs the usual VQE and static PDS calculations even at the lowest order.

Peng, Bo↗

DOE OSTI2023

Retrieval of temperature and humidity profiles from ground-based high-resolution infrared observations using an adaptive fast iterative algorithm

Various retrieval algorithms have been developed for retrieving temperature and water vapor profiles from Atmospheric Emitted Radiance Interferometer (AERI) observations. The physical retrieval algorithm, named AERI Optimal Estimation (AERIoe), outperforms other retrieval algorithms in many aspects except the retrieval time, which is significantly increased due to the complex radiative transfer process. The calculation of the Jacobian matrix is the most computationally intensive step of the physical retrieval algorithm. Interestingly, an analysis of the change in AERI observations' information content with respect to Jacobians revealed that the AERIoe algorithm's performance presents negligible dependence on these metrics. Thus, the Jacobian matrix could remain unchanged when the variation in the atmospheric state is small in the retrieval process to reduce the most time-consuming computation. On the basis of the above findings, a fast physical–iterative retrieval algorithm was proposed by adaptively recalculating Jacobians in keeping with the changes in the atmospheric state. Experiments with synthetic observations demonstrate that the proposed method experiences an average reduction in retrieval time by an impressive 59 % compared to the original AERIoe algorithm while achieving maximum root-mean-square errors of less than 0.95 K and 0.22 log(ppmv) for heights below 3 km for the temperature and water vapor profile, respectively. Further analyses revealed that the fast-retrieval algorithm reached an acceptable convergence rate of 98.7 %, marginally lower than AERIoe's 99.9 % convergence rate for the 826 cases used in this study.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1988

Numerical simulation of underexpanded plumes using upwind algorithms

The solution of the flow characteristics of highly underexpanded plumes is presently sought by means of a high-resolution total variation-diminishing upwind scheme featuring finite-volume metrics, Roe averaging with entropy correction, and monotonic upstream schemes for conservation laws. The existing approximate factorization schemes are used both as preconditioners and in order to apply the conjugate residual algorithm. The plumes treated are axisymmetric and laminar, and for an ideal gas that is allowed to be thermally incomplete. Simulations of the SSME and SRB plumes have been successfully conducted.

Obayashi, Shigeru↗

NASA NTRSDate not supplied

Total Variation Majorization Minimization (TV-MM) Approach to Radiometer Brightness Temperature Gridding and Reconstruction

This paper presents the implementation of an algorithm to enhance the image resolution of the Earth's surface brightness temperature (T B ) data measured by radiometers such as the one onboard of the Soil Moisture Active Passive (SMAP) mission. A key step in radiometer T B processing is the conversion of the swath-based calibrated antenna temperature (T A ) measurements to the Level 3 Earth-centered grid. The simplest algorithm to transform this data from swath to gridded format is called drop-in-the-bucket which simply averages surrounding noisy T A samples to form a T B value at the gridded location. This method reduces noise, however produces low resolution products. To obtain a higher resolution product, SMAP uses other techniques such the Backus-Gilbert (BG) algorithm, which is the conventional method used in microwave radiometry. Although this method performs the required interpolation, it is not effective in denoising and removing blurring effects due to antenna filtering of the radiometer image data. Our motivation for this development is to further improve the resolution through post-processing of the radiometer T B image, a highly cost-effective method of image enhancement. The approach adapted in this work is based on the minimization of the Total Variation (TV) regularized objective function that is used extensively in solving general ill-posed linear inverse problems in image processing. Since the TV-based objective function is convex but not everywhere differentiable, there exists many numerical algorithms that can estimate the solution and the one selected for this work is called Majorization- Minimization (MM). By applying this algorithm, simulation experiments were performed based on synthetic data from the Geophysical model as well as real SMAP data to demonstrate the effectiveness of the technique. Results were then compared against the BG method.

Wing Lee↗

DOE OSTI2020

The Architecture of Metabolism Maximizes Biosynthetic Diversity in the Largest Class of Fungi

Abstract Ecological diversity in fungi is largely defined by metabolic traits, including the ability to produce secondary or “specialized” metabolites (SMs) that mediate interactions with other organisms. Fungal SM pathways are frequently encoded in biosynthetic gene clusters (BGCs), which facilitate the identification and characterization of metabolic pathways. Variation in BGC composition reflects the diversity of their SM products. Recent studies have documented surprising diversity of BGC repertoires among isolates of the same fungal species, yet little is known about how this population-level variation is inherited across macroevolutionary timescales. Here, we applied a novel linkage-based algorithm to reveal previously unexplored dimensions of diversity in BGC composition, distribution, and repertoire across 101 species of Dothideomycetes, which are considered the most phylogenetically diverse class of fungi and known to produce many SMs. We predicted both complementary and overlapping sets of clustered genes compared with existing methods and identified novel gene pairs that associate with known secondary metabolite genes. We found that variation among sets of BGCs in individual genomes is due to nonoverlapping BGC combinations and that several BGCs have biased ecological distributions, consistent with niche-specific selection. We observed that total BGC diversity scales linearly with increasing repertoire size, suggesting that secondary metabolites have little structural redundancy in individual fungi. We project that there is substantial unsampled BGC diversity across specific families of Dothideomycetes, which will provide a roadmap for future sampling efforts. Our approach and findings lend new insight into how BGC diversity is generated and maintained across an entire fungal taxonomic class.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

Development of Control System Functional Capabilities within the IES Plug-and-Play Simulation Environment

The concept of an Integrated Energy System (IES) is meant to combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES. A new RAVEN (Risk Analysis Virtual ENvironment) plugin for grid and capacity optimization (HERON) has been developed for optimizing the production variables of the IES given the demand profile. Currently, only the limits that affect the production variables and their corresponding time rates of change are considered (explicit constraints). However, other variables are additionally subject to constraints, but the associated limits are not accounted for (implicit constraints). In particular, for the power dispatch problem, the optimization algorithm takes into account the limits on the electrical power output and the corresponding hourly power variations but does not consider other constraints on process variables whose response effects the service life of the IES. This report describes a scheme that allows accounting for implicit constraints without increasing the size of the optimization problem. The Reference Governor (RG) algorithm is traditionally used for enforcing state and control constraints by modifying the set-point trajectories supplied to the feedback regulators. In our application, the RG is coupled within an iterative loop with the HERON-power dispatcher to generate optimal trajectories that ensure the operational constraints are met. A data-driven procedure to derive a representation of the dynamics of the controlled system was developed. First, the variables that represented the state of the system are selected (PCA-based approach), and then state-space representation matrices are derived from the collected measurements (DMDc algorithm). A preliminary version of the developed workflow based on Linear Time Invariant matrices was assessed by adopting a two-unit test case. More sophisticated versions of this workflow foreseeing the on-line derivation of system matrices will be deployed in FY 2021. Finally, a “plug-and-play” library of controllers and state observers was developed in Dymola. Some aspects of the current configuration of the IES unit components, e.g., the encapsulation of the control schemes into dedicated blocks, are consistent with the “plug-and-play” philosophy. Other features, e.g., the system buses collecting the input and the output variables, are not. For this reason, once listed and described the limits of the current configuration, necessary modifications to the plant model interface are presented. As a test-case, the interfaces of the SES model in the RAVEN-based HYBRID framework were reworked accordingly, and two different control schemes were applied to the same plant model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1980

Targeting with fixed propellant load

The inertial upper stage (IUS) for the space shuttle operation employs solid rocket stages with fixed, propellant loadings. This means that, if for a given mission the satellite weight is less than the maximum, the IUS will deliver higher delta V's than required. One way to waste the excess capability in order to achieve the desired orbit would be to execute a nonoptimal transfer which would require higher than maximum delta V's. An algorithm is presented which defines takeoff points on the parking orbit and the injection points on the orbit for which transfer orbits require a fixed delta V sub 1 and a fixed delta V sub 2 (defined by the satellite weight). It is assumed that both the parking and the target orbit are elliptical. This allows the use of the same algorithm for guidance. The transfer orbit achieved by the erroneous delta V sub 1 is regarded as a new parking orbit and the new transfer problem is solved by assuming a delta, delta V sub 1. The maximum value of delta, delta V sub 1 is the delta V sub 1 variation and its minimum value is the one which still yields a solution by the algorithm. The delta V sub errors are regarded as orbit injection errors and compensated in the usual way.

Gedeon, G. S.↗

DOE OSTI2024

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS1996

Estimation of Canopy Water Content in Konza Parry Grasslands Using Synthetic Aperture Radar Measurements During FIFE

This paper presents the development of an algorithm to retrieve the canopy water contents of natural grasslands and pasture from synthetic aperture radar (SAR) measurements. The development on this algorithm involves three interrelated steps: (1) calibration of SAR data for ground topographic variations, (2) development and validation of backscatter model for cross-polarized ratio. The polarimetric radar data acquired by the Jet Propulsion Laboratory AIRSAR system during the 1989 First International Satellite land Surface Climatology Project (ISLSCP) Field Experiment (FIFE) used for this study. The SAR data have been calibrated and corrected for the topographical effects by using the digital elevation map of the study area.

canopy water contents algorithm Konza Konza Parry ↗

DOE OSTI2022

The Case for Optimized Edge-Centric Tractography at Scale

The anatomic validity of structural connectomes remains a significant uncertainty in neuroimaging. Edge-centric tractography reconstructs streamlines in bundles between each pair of cortical or subcortical regions. Although edge bundles provides a stronger anatomic embedding than traditional connectomes, calculating them for each region-pair requires exponentially greater computation. We observe that major speedup can be achieved by reducing the number of streamlines used by probabilistic tractography algorithms. To ensure this does not degrade connectome quality, we calculate the identifiability of edge-centric connectomes between test and re-test sessions as a proxy for information content. We find that running PROBTRACKX2 with as few as 1 streamline per voxel per region-pair has no significant impact on identifiability. Variation in identifiability caused by streamline count is overshadowed by variation due to subject demographics. This finding even holds true in an entirely different tractography algorithm using MRTrix. Incidentally, we observe that Jaccard similarity is more effective than Pearson correlation in calculating identifiability for our subject population.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2021

Prime factorization using quantum variational imaginary time evolution

The road to computing on quantum devices has been accelerated by the promises that come from using Shor’s algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robust error correction schemes. Here we explore a promising, alternative method for prime factorization that uses well-established techniques from variational imaginary time evolution. We create a Hamiltonian whose ground state encodes the solution to the problem and use variational techniques to evolve a state iteratively towards these prime factors. We show that the number of circuits evaluated in each iteration scales as \(O(n^{5}d)\) , where n is the bit-length of the number to be factorized and d is the depth of the circuit. We use a single layer of entangling gates to factorize 36 numbers represented using 7, 8, and 9-qubit Hamiltonians. We also verify the method’s performance by implementing it on the IBMQ Lima hardware to factorize 55, 65, 77 and 91 which are greater than the largest number (21) to have been factorized on IBMQ hardware.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

A variant selection framework for genome graphs

Abstract Motivation Variation graph representations are projected to either replace or supplement conventional single genome references due to their ability to capture population genetic diversity and reduce reference bias. Vast catalogues of genetic variants for many species now exist, and it is natural to ask which among these are crucial to circumvent reference bias during read mapping. Results In this work, we propose a novel mathematical framework for variant selection, by casting it in terms of minimizing variation graph size subject to preserving paths of length α with at most δ differences. This framework leads to a rich set of problems based on the types of variants [e.g. single nucleotide polymorphisms (SNPs), indels or structural variants (SVs)], and whether the goal is to minimize the number of positions at which variants are listed or to minimize the total number of variants listed. We classify the computational complexity of these problems and provide efficient algorithms along with their software implementation when feasible. We empirically evaluate the magnitude of graph reduction achieved in human chromosome variation graphs using multiple α and δ parameter values corresponding to short and long-read resequencing characteristics. When our algorithm is run with parameter settings amenable to long-read mapping (α = 10 kbp, δ = 1000), 99.99% SNPs and 73% SVs can be safely excluded from human chromosome 1 variation graph. The graph size reduction can benefit downstream pan-genome analysis. Availability and implementation https://github.com/AT-CG/VF. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1995

Experience from the in-flight calibration of the Extreme Ultraviolet Explorer (EUVE) and Upper Atmosphere Research Satellite (UARS) fixed head star trackers (FHSTs)

Since the original post-launch calibration of the FHSTs (Fixed Head Star Trackers) on EUVE (Extreme Ultraviolet Explorer) and UARS (Upper Atmosphere Research Satellite), the Flight Dynamics task has continued to analyze the FHST performance. The algorithm used for inflight alignment of spacecraft sensors is described and the equations for the errors in the relative alignment for the simple 2 star tracker case are shown. Simulated data and real data are used to compute the covariance of the relative alignment errors. Several methods for correcting the alignment are compared and results analyzed. The specific problems seen on orbit with UARS and EUVE are then discussed. UARS has experienced anomalous tracker performance on an FHST resulting in continuous variation in apparent tracker alignment. On EUVE, the FHST residuals from the attitude determination algorithm showed a dependence on the direction of roll during survey mode. This dependence is traced back to time tagging errors and the original post launch alignment is found to be in error due to the impact of the time tagging errors on the alignment algorithm. The methods used by the FDF (Flight Dynamics Facility) to correct for these problems is described.

Lee, Michael↗