Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)

Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and the tensor elements are nonnegative count data. SparTen is a high-performance C++ library which computes a low-rank decomposition using different solvers: a first-order quasi-Newton or a second-order damped Newton method, along with the appropriate choice of runtime parameters. Since default parameters in SparTen are tuned to experimental results in prior published work on a single real-world dataset conducted using MATLAB implementations of these methods, it remains unclear if the parameter defaults in SparTen are appropriate for general tensor data. Furthermore, it is unknown how sensitive algorithm convergence is to changes in the input parameter values. This report addresses these unresolved issues with large-scale experimentation on three benchmark tensor data sets. Experiments were conducted on several different CPU architectures and replicated with many initial states to establish generalized profiles of algorithm convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Non-Boolean quantum amplitude amplification and quantum mean estimation

This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-Boolean oracles. The action of a non-Boolean oracle $U_\varphi $ on an eigenstate $\mathinner {|{x}\rangle }$ is to apply a state-dependent phase-shift $\varphi (x)$. Unlike Boolean oracles, the eigenvalues $\exp (i\varphi (x))$ of a non-Boolean oracle are not restricted to be $\pm 1$. Two new oracular algorithms based on such non-Boolean oracles are introduced. The first is the non-Boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of $\varphi (x)$. Starting from a given initial superposition state $\mathinner {|{\psi _0}\rangle }$, the basis states with lower values of $\cos (\varphi )$ are amplified at the expense of the basis states with higher values of $\cos (\varphi )$. The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation $\mathinner {\langle {\psi _0|U_\varphi |\psi _0}\rangle }$, i.e., the expected value of $\exp (i\varphi (x))$ for a random x sampled by making a measurement on $\mathinner {|{\psi _0}\rangle }$. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Analog Systems for Edge Optimization

Over the past decade, analog computing has the subject of substantial research interest providing a path toward improved computational efficiency in the post-Dennard era. Analog matrix vector multiplication (MVM) accelerators provide a popular approach given the ubiquity of MVM operations in numerous applications. However, historically analog computing systems can struggle with applications requiring high precision due to the inherent susceptibility of these systems to analog non-idealities. Therefore, prior work on analog systems has focused either on applications known to be tolerant of limited precision (e.g., neural network inference), or using expensive techniques to emulate high-precision using many analog MVM operations. In this work, we propose an alternative approach. Motivated by recent advances in inexact nonlinear solvers and optimizers, we explore the potential of co-designing optimization algorithms which can take full advantage of the fundamentally inexact analog MVM operations. To enable these co-designed algorithms we also develop a general mathematical theory of the precision and energy efficiency of analog operations, and a new system architecture for tightly-coupled analog and digital computation. Finally, we examine the applicability of analog computing to a wider class of symmetric positive definite systems and find potential in using analog operations as a sparse approximate inverse preconditioner. With these core innovations, this project provides a path toward effectively implementing optimization algorithms on power-constrained autonomous and semi-autonomous systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗
DOE OSTI2025

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗
DOE OSTI2021

Universal dwell time optimization for deterministic optics fabrication

Computer-Controlled Optical Surfacing (CCOS) has been greatly developed and widely used for precision optical fabrication in the past three decades. It relies on robust dwell time solutions to determine how long the polishing tools must dwell at certain points over the surfaces to achieve the expected forms. However, as dwell time calculations are modeled as ill-posed deconvolution, it is always non-trivial to reach a reliable solution that 1) is non-negative, since CCOS systems are not capable of adding materials, 2) minimizes the residual in the clear aperture 3) minimizes the total dwell time to guarantee the stability and efficiency of CCOS processes, 4) can be flexibly adapted to different tool paths, 5) the parameter tuning of the algorithm is simple, and 6) the computational cost is reasonable. In this study, we propose a novel Universal Dwell time Optimization (UDO) model that universally satisfies these criteria. First, the matrix-based discretization of the convolutional polishing model is employed so that dwell time can be flexibly calculated for arbitrary dwell points. Second, UDO simplifies the inverse deconvolution as a forward scalar optimization for the first time, which drastically increases the solution stability and the computational efficiency. Finally, the dwell time solution is improved by a robust iterative refinement and a total dwell time reduction scheme. The superiority and general applicability of the proposed algorithm are verified on the simulations of different CCOS processes. A real application of UDO in improving a synchrotron X-ray mirror using Ion Beam Figuring (IBF) is then demonstrated. The simulation indicates that the estimated residual in the 92.3 mm × 15.7 mm CA can be reduced from 6.32 nm Root Mean Square (RMS) to 0.20 nm RMS in 3.37 min. After one IBF process, the measured residual in the CA converges to 0.19 nm RMS, which coincides with the simulation.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Thermodynamically consistent algorithms for models of incompressible multiphase polymer solutions with a variable mobility

Here we present a general strategy for developing structure and property preserving numerical algorithms for thermodynamically consistent models of incompressible multiphase polymer solutions with a variable mobility. We first present a formalism to derive thermodynamically consistent, incompressible, multiphase polymer models. Then, we develop the general strategy, known as the supplementary variable method, to devise thermodynamically consistent numerical approximations to the models. We illustrate the numerical strategy using newly developed models of incompressible diblock copolymer solutions coupled with an electric and a magnetic field, respectively. Mesh refinement is conducted to verify convergence rates of the developed schemes. Some numerical examples are given to exhibit underlying dynamics absent from and driven by the external fields, respectively, highlighting differences between models with the variable and constant mobilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Generalized quasiharmonic approximation via space group irreducible derivatives

The quasiharmonic approximation (QHA) is the simplest nontrivial approximation for interacting phonons under constant pressure, bringing the effects of anharmonicity into temperature-dependent observables. Nonetheless, the QHA is often implemented with additional approximations due to the complexity of computing phonons under arbitrary strains, and the generalized QHA, which employs constant stress boundary conditions, has not been completely developed. In this work we formulate the generalized QHA, providing a practical algorithm for computing the strain state and other observables as a function of temperature and true stress. We circumvent the complexity of computing phonons under arbitrary strains by employing irreducible second-order displacement derivatives of the Born-Oppenheimer potential and their strain dependence, which are efficiently and precisely computed using the lone irreducible derivative approach. We formulate two complementary strain parametrizations: a discretized strain grid interpolation and a Taylor series expansion in symmetrized strain. We illustrate our approach by evaluating the temperature and pressure dependence of select elastic constants and the thermal expansion in thoria (ThO 2 ) using density functional theory with three exchange-correlation functionals. The QHA results are compared to our measurements of the elastic constant tensor using time-domain Brillouin scattering and inelastic neutron scattering. Our irreducible derivative approach simplifies the implementation of the generalized QHA, which will facilitate reproducible, data-driven applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\langle \phi_i|e^{-\widehat{H}τ}|\phi_j\rangle$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, we show that a wide class of Hamiltonians relevant to condensed-matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, here we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Km‐Scale Simulations of Mesoscale Convective Systems Over South America—A Feature Tracker Intercomparison

Mesoscale convective systems (MCSs) are clusters of thunderstorms that are important in Earth's water and energy cycle. Additionally, they are responsible for extreme events such as large hail, strong winds, and extreme precipitation. Automated object-based analyses that track MCSs have become popular since they allow us to identify and follow MCSs over their entire life cycle in a Lagrangian framework. This rise in popularity was accompanied by an increasing number of MCS tracking algorithms, however, little is known about how sensitive analyses are concerning the MCS tracker formulation. Here, we assess differences between six MCS tracking algorithms on South American MCS characteristics and evaluate MCSs in kilometer-scale simulations with observational-based MCSs over 3 years. All trackers are run with a common set of MCS classification criteria to isolate tracker formulation differences. The tracker formulation substantially impacts MCS characteristics such as frequency, size, duration, and contribution to total precipitation. The evaluation of simulated MCS characteristics is less sensitive to the tracker formulation and all trackers agree that the model can capture MCS characteristics well across different South American climate zones. Dominant sources of uncertainty are the segmentation of cloud systems in space and time and the treatment of how MCSs are linked in time. Our results highlight that comparing MCS analyses that use different tracking algorithms is challenging. We provide general guidelines on how MCS characteristics compare between trackers to facilitate a more robust assessment of MCS statistics in future studies.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Deep reaction network exploration at a heterogeneous catalytic interface

Characterizing the reaction energies and barriers of reaction networks is central to catalyst development. However, heterogeneous catalytic surfaces pose several unique challenges to automatic reaction network characterization, including large sizes and open-ended reactant sets, that make ad hoc network construction the current state-of-the-art. Here, we show how automated network exploration algorithms can be adapted to the constraints of heterogeneous systems using ethylene oligomerization on silica-supported single-site Ga 3+ as a model system. Using only graph-based rules for exploring the network and elementary constraints based on activation energy and size for identifying network terminations, a comprehensive reaction network is generated and validated against standard methods. The algorithm (re)discovers the Ga-alkyl-centered Cossee-Arlman mechanism that is hypothesized to drive major product formation while also predicting several new pathways for producing alkanes and coke precursors. These results demonstrate that automated reaction exploration algorithms are rapidly maturing towards general purpose capability for exploratory catalytic applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Critical points of the random cluster model with Newman–Ziff sampling

Here, we present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. Here, this letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

42 ENGINEERING↗
DOE OSTI2022

Ultra-Short-Term Spatiotemporal Forecasting of Renewable Resources: An Attention Temporal Convolutional Network Based Approach

The rapid increase in the penetration of renewable energy resources characterized by high variability and uncertainty is bringing new challenges to the power system operation. To ensure the efficient and reliable operation of electric grid, an accurate and general short-term forecasting algorithm with interpretability is desired. Moreover, the extensive off-site information provided by the proliferation of new renewable plants stimulates the interests in the spatiotemporal forecasting. In this paper, an attention temporal convolutional network, which is built on stacked dilated causal convolutional networks and attention mechanisms, is proposed to perform the ultra-short-term spatiotemporal forecasting of renewable resources. Compared with the existing spatiotemporal forecasting methods, the presented model needs no domain knowledge and can be applied to different forecasting tasks such as solar generation and wind speed forecasting. Here, the attention mechanism improves the interpretability. The algorithm can be used to produce both point and probabilistic forecasts. Numerical results on the data sets from National Renewable Energy Laboratory show superior performance over five baselines, in terms of skill scores. Compared with the baselines, the average improvements of accuracy introduced by the proposed method for the point and probabilistic forecasting are 15.08% and 15.85%, respectively.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

PDEHats

This is code used to train and evaluate neural partial differential equation solvers on an open source fluid flow data. We evaluate two standard deep learning algorithms for their ability to generalize, a desirable capability for trusthworthy and performant models.

Amarel, James↗
DOE OSTI2020

Encoding the complete electric field of an ultraviolet ultrashort laser pulse in a near-infrared nonlinear-optical signal

We introduce a variation on the cross-correlation frequency-resolved optical gating (XFROG) technique that uses a near-infrared (NIR) nonlinear-optical signal to characterize pulses in the ultraviolet (UV). Using a transient-grating XFROG beam geometry, we create a grating using two copies of the unknown UV pulse and diffract a NIR reference pulse from it. We show that, by varying the delay between the UV pulses creating the grating, the UV pulse intensity-and-phase information can be encoded into a NIR signal. We also implemented a modified generalized-projections phase-retrieval algorithm for retrieving the UV pulses from these spectrograms. We performed proof-of-principle measurements of chirped pulses and double pulses, all at 400 nm. This approach should be extendable deeper into the UV and potentially even into the extreme UV or x-ray range.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Machine-Learning of Nonlocal Kernels for Anomalous Subsurface Transport from Breakthrough Curves

Anomalous behavior is ubiquitous in subsurface solute transport due to the presence of high degrees of heterogeneity at different scales in the media. Although fractional models have been extensively used to describe the anomalous transport in various subsurface applications, their application is hindered by computational challenges. Simpler nonlocal models characterized by integrable kernels and finite interaction length represent a computationally feasible alternative to fractional models; yet, the informed choice of their kernel functions still remains an open problem. We propose a general data-driven framework for the discovery of optimal kernels on the basis of very small and sparse data sets in the context of anomalous subsurface transport. Using spatially sparse breakthrough curves recovered from fine-scale particle-density simulations, we learn the best coarse-scale nonlocal model using a nonlocal operator regression technique. Predictions of the breakthrough curves obtained using the optimal nonlocal model show good agreement with fine-scale simulation results even at locations and time intervals different from the ones used to train the kernel, confirming the excellent generalization properties of the proposed algorithm. A comparison with trained classical models and with black-box deep neural networks confirms the superiority of the predictive capability of the proposed model.

97 MATHEMATICS AND COMPUTING↗