Engineering Papers⌕ Search

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.

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

At least 325 records · Page 18

Sensitivity of modelled passive margin stratigraphy to variations in sea level, sediment supply and subsidence

Abstract We produced a 10 Myr synthetic stratigraphic section using a forward stratigraphic model that generates marine deltaic stratigraphy over geological timescales. We recursively fit the model using a Bayesian inversion algorithm to test: (1) if it could be accurately reconstructed; (2) if the parameters used to create it could be recovered; and (3) the sensitivity of the model output to given model parameters and the attendant physical processes. The original synthetic stratigraphic section was produced with cyclical sea‐level variations of 40 and 30 m with 2.4 and 10 Myr periods respectively. Sediment was also supplied cyclically, in 2.4 and 10 Myr cycles with amplitudes of 30 and 80 tons/100 kyr, respectively, varying from a mean of 232 tons/100 kyr. Parameter values were sampled to fit the model using a Markov chain Monte Carlo algorithm, resulting in a ±5 m (1σ) variation between the experimental output and the original. Sea level varied by ±7 m (1σ) within the posterior distribution of parameters. As a result, both the 10 Myr and 2.4 Myr sea‐level cycles could be extracted from the original output. The variation in sediment supply was approximately ±38 tons/100 kyr (1σ) and, as a result, only the larger long‐term supply variations could be accurately recovered in refitting the model. The variation in thermal, flexural and total subsidence across those parameter sets is less than ±10 m (1σ). The original section experienced 150 m of total subsidence at the depocentre. Our results demonstrate the distinct and interpretable imprint of sea level and subsidence on continental margin stratigraphy can be quantified. Moreover, we conclude that sea‐level change produces a defined effect on the geometries of stratigraphic architecture, and that techniques applied for the purpose of delineating sea‐level variation from continental margin strata have a well‐founded conceptual basis.

Schmelz, William J.↗

Optimization-based algorithms for nonlinear mechanics and frictional contact

An optimization-based strategy for solving nonlinear mechanics problems is proposed. In contrast to typical nonlinear equation solver algorithms that aim to find zeros in the residual force function, we minimize an energy (or energy-like) function to encourage solutions which are locally stable equilibria. These smooth and potentially non-convex objective functions are minimized using a preconditioned conjugate-gradient trust-region algorithm. Contact is formulated as an inequality constrained minimization problem, and is solved with an augmented Lagrangian algorithm. Friction is included in the approach via a regularized quasi-potential energy, and other dissipative behavior is included through the use of variational constitutive updates. Finally, to accelerate convergence rates for the Lagrange multipliers, we propose a novel multiplier update algorithm utilizing the Fischer-Burmeister function, and demonstrate super-linear solver convergence for some applications.

42 ENGINEERING↗

Adaptive Quantum Generative Training using an Unbounded Loss Function

We propose a generative quantum learning algorithm using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum Rényi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art adaptive algorithms by learning random two-local thermal states. We perform numerical experiments of up to 12 qubits comparing our method learning algorithms that use linear objective functions and show that Rényi-ADAPT is capable of constructing shallow quantum circuits competitive with existing methods, while the gradients remain favorable resulting from the maximal Rényi divergence loss function.

quantum algorithms, quantum machine learning, quan↗

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗

Structure optimization with stochastic density functional theory

Linear-scaling techniques for Kohn–Sham density functional theory are essential to describe the ground state properties of extended systems. Still, these techniques often rely on the localization of the density matrix or accurate embedding approaches, limiting their applicability. In contrast, stochastic density functional theory (sDFT) achieves linear- and sub-linear scaling by statistically sampling the ground state density without relying on embedding or imposing localization. In return, ground state observables, such as the forces on the nuclei, fluctuate in sDFT, making optimizing the nuclear structure a highly non-trivial problem. In this work, we combine the most recent noise-reduction schemes for sDFT with stochastic optimization algorithms to perform structure optimization within sDFT. We compare the performance of the stochastic gradient descent approach and its variations (stochastic gradient descent with momentum) with stochastic optimization techniques that rely on the Hessian, such as the stochastic Broyden–Fletcher–Goldfarb–Shanno algorithm. In conclusion, we further provide a detailed assessment of the computational efficiency and its dependence on the optimization parameters of each method for determining the ground state structure of bulk silicon with varying supercell dimensions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Single Quadrupole Multiple Fragment Ion Monitoring Quantitative Mass Spectrometry

Single quadrupole mass spectrometry (MS) with enhanced in-source multiple fragment ion monitoring was designed to perform high sensitivity quantitative mass analyses. Enhanced in-source fragmentation amplifies fragmentation from traditional soft electrospray ionization producing fragment ions that have been found to be identical to those generated in tandem MS. We have combined enhanced in-source fragmentation data with criteria established by the European Union Commission Directive 2002/657/EC for electron ionization single quadrupole quantitative analysis to perform quantitative analyses. These experiments were performed on multiple types of complex samples that included a mixture of 50 standards, as well as cell and plasma extracts. The dynamic range for these quantitative analyses was comparable to triple quadrupole multiple reaction monitoring (MRM) analyses at up to 5 orders of magnitude with the cell and plasma extracts showing similar matrix effects across both platforms. Amino acid and fatty acid measurements performed from certified NIST 1950 plasma with isotopically labeled standards demonstrated accuracy in the range of 91–110% for the amino acids, 76–129% for the fatty acids, and good precision (coefficient of variation <10%). To enhance specificity, a newly developed correlated ion monitoring algorithm was designed to facilitate these analyses. This algorithm autonomously processes, aligns, filters, and compiles multiple ions within one chromatogram enabling both precursor and in-source fragment ions to be correlated within a single chromatogram, also enabling the detection of coeluting species based on precursor and fragment ion ratios. Single quadrupole instrumentation can provide MRM level quantitative performance by monitoring/correlating precursor and fragment ions facilitating high sensitivity analysis on existing single quadrupole instrumentation that are generally inexpensive, easy to operate, and technically less complex.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Faraday Michelson Interferometers for Signal Demodulation of Fiber-Optic Sensors

We developed an all-fiber-based optical demodulator for the signal interrogation of low-coherence fiber-optic Fabry–Perot interferometric sensors. The optical demodulator consists of a Michelson interferometer implemented by using a 3×3 fiber coupler and two fiber-coupled Faraday reflectors with tunable fiber delay lines. The demodulator's output contains two optical interference signals with a constant phase shift and the output shows no sensitivity to the polarization variation in the light source or fibers. A digital phase recovery algorithm is used to extract the measurand information from the phase-shifted signals at high accuracy, high dynamic range, and high stability. The optical demodulator has been applied to the measurement of high-frequency vibrations and strains using fiber-optic sensors.

47 OTHER INSTRUMENTATION↗

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↗

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)↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Evaluation of Physical Microphysical Property Retrieval Algorithms During the 2020 IMPACTS Field Campaign

The NASA Investigation of Microphysics and Precipitation for Atlantic Coast Threatening Snowstorms (IMPACTS) field campaign provides high-quality, high-altitude aircraft lidar (532 nm), radar (W-band) and in-cloud microphysical aircraft data taken during wintertime storm events impacting the United States. This study evaluates two mass-dimensional relationships (Brown and Francis (1995, BF95); Heymsfield (2014, H14) and two lidar-radar microphysical retrieval algorithms (Cloudsat and CALIPSO Ice Cloud Property Product (2C-ICE); VarPy (a variational method derived from the satellite lidar-radar data community)) to estimate aircraft-retrieved volume extinction coefficient (σ), ice water content (IWC), and effective radius (r e ) during the 2020 IMPACTS deployment. BF95 and H14 have a close 1:1 correlation (R 2 = 0.98) with in-situ observations of σ. However, only BF95 displays a linear, consistent, and almost temperature-independent low bias for IWC and r e , which likely arises from the environmental conditions used to determine each. Unlike the field-campaign-derived BF95 and H14 relationships, VarPy and 2C-ICE directly ingest the aircraft-based lidar and radar data to simulate σ, IWC, and r e . For all three microphysical parameters, VarPy and 2C-ICE retrieval errors became notably more pronounced around the dendritic growth zone (-15°C to -10°C) and near freezing (≥-5°C), which suggests that both algorithms experience difficulty addressing riming and aggregation processes and with larger particles (dendrites and plates) due in part to their simplified ice particle assumptions. However, the mean-melt diameter ice-particle assumption did yield more accurate IWC estimates, which led to slightly better overall results for VarPy.

54 ENVIRONMENTAL SCIENCES↗