Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗
DOE OSTI2023

Generalized Quantum Convolution for Multidimensional Data

The convolution operation plays a vital role in a wide range of critical algorithms across various domains, such as digital image processing, convolutional neural networks, and quantum machine learning. In existing implementations, particularly in quantum neural networks, convolution operations are usually approximated by the application of filters with data strides that are equal to the filter window sizes. One challenge with these implementations is preserving the spatial and temporal localities of the input features, specifically for data with higher dimensions. In addition, the deep circuits required to perform quantum convolution with a unity stride, especially for multidimensional data, increase the risk of violating decoherence constraints. In this work, we propose depth-optimized circuits for performing generalized multidimensional quantum convolution operations with unity stride targeting applications that process data with high dimensions, such as hyperspectral imagery and remote sensing. We experimentally evaluate and demonstrate the applicability of the proposed techniques by using real-world, high-resolution, multidimensional image data on a state-of-the-art quantum simulator from IBM Quantum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in paraxial optical systems. The MT is also an essential ingredient of the geometrical-optics modeling of caustics that we recently proposed. In particular, this application relies on the near-identity MT (NIMT); however, the NIMT approximation used so far is not exactly unitary and leads to numerical instability. Here, we develop a discrete MT that is exactly unitary, and approximate it to obtain a discrete NIMT that is also unitary and can be computed in linear time. We prove that the discrete NIMT converges to the discrete MT when iterated, thereby allowing the NIMT to compute MTs that are not necessarily near-identity. Finally, we then demonstrate the new algorithms with a series of examples.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Rays for Roots - Integrating Backscatter X-Ray Phenotyping, Modeling and Genetics to Increase Carbon Sequestration and Switchgrass Resource Use (Final Report)

To increase carbon (C) deposition in the soil and enhance crop resource use efficiency, characterizing root form and function is essential. Several root and soil traits have been linked to increased root-to-soil C transfer. Technology that could provide high-resolution characterization of many of these traits in field conditions would revolutionize our ability to study and understand how to increase C sequestration. In this effort, we developed an initial early prototype backscatter X-ray system for non-destructive imaging of root traits. We collected initial backscatter X-ray data in field and lab settings and carried out early analysis of these data. Along with this prototype, we also developed a suite of root phenotyping approaches including advanced minirhizotron image analysis, soil core imaging, and mesocosm imaging. Minirhizotron (MR) tubes are clear tubes inserted into the soil in the field and used to image roots and the surrounding soil. Our team has developed deep learning-based methods that can segment roots from soil that can learn from imprecise image-level labels. The ability to learn or fine-tune our deep learning algorithms from image-level labels allows easier and faster application of these approaches to new locations and new plant species. We have successfully implemented and applied our MR analysis approaches to thousands of switchgrass MR images collected across geographical regions. An advantage of MR imaging is the ability to collect root and soil images over time. Our soil core analysis included collecting hundreds of soil core samples from harvested switchgrass fields and imaging these cores with both X-ray CT and backscatter X-ray imaging. Initial segmentation approaches for the X-ray CT images of these cores have been developed and applied. An advantage of soil core analysis is that it preserves the three-dimensional structures of the roots and soil in the core collected. Our group also developed photogrammetry-based mesocosm root imaging and phenotyping approaches. In this approach, a plant was grown in a large mesocosm with a three-dimensional grid of thin supporting lines inserted throughout the mesocosm. After the plant (and, correspondingly, the root architecture is grown and established) the soil media was removed and the supporting lines approximately preserved the three-dimensional root architecture. Then, we applied photogrammetry techniques to create a three-dimensional digital representation of the root architecture for which we developed analysis algorithms including skeletonization. We carried out our phenotyping development with powerful switchgrass resources and physiological and agroecosystem modeling to deliver novel technology. This project contributes to multiple ARPA-E missions including reduction of foreign imports of energy, reduction of energy-related emissions including greenhouse gases, and ensuring that the United States maintains a technological lead in developing and deploying advanced energy technology. Furthermore, the developed tools could transform public and private plant breeding and could be broadly applicable to other crops and, potentially, other application areas. Our team of engineers, plant and soil scientists, and modelers i) developed an early prototype backscatter X-ray platform that can operate in field conditions; ii) developed a suite of root phenotyping and characterization approaches as described above; iii) developed and carried out plant biology and physiology roots studies and; iv) developed and implemented mechanistic physiological modeling.

42 ENGINEERING↗
DOE OSTI2022

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗
DOE OSTI2021

Impact of including second and later cancers in cause-specific survival estimates using population-based registry data

Background. Second or later primary cancers account for approximately 20% of incident cases in the United States. Currently, cause-specific survival (CSS) analyses exclude these cancers because the cause of death (COD) classification algorithm was available only for first cancers. The authors added rules for later cancers to the Surveillance, Epidemiology, and End Results cause-specific death classification algorithm and evaluated CSS to include individuals with prior tumors. Methods. The authors constructed 2 cohorts: 1) the first ever primary cohort, including patients whose first cancer was diagnosed during 2000 through 2016) and 2) the earliest matching primary cohort, including patients with any cancer who matched the selection criteria irrespective of whether it was the first or a later cancer diagnosed during 2000 through 2016. The cohorts' CSS estimates were compared using follow-up through December 31, 2017. The new rules were used in the second cohort for patients whose first cancers during 2000 through 2016 were their second or later cancers. Results. Overall, there were no statistically significant differences in CSS estimates between the 2 cohorts. Estimates were similar by age, stage, race, and time since diagnosis, except for patients with leukemia and those aged 65 to 74 years (3.4 percentage point absolute difference). Conclusions. The absolute difference in CSS estimates for the first cancer ever cohort versus earliest of any cancers cohort in the study period was small for most cancer types. As the number of newly diagnosed patients with prior cancers increases, the algorithm will make CSS more inclusive and enable estimating survival for a group of patients with cancer for whom life tables are not available or life tables are available but do not capture other-cause mortality appropriately.

Survival Analysis↗
DOE OSTI2022

Dendrite-resolved, full-melt-pool phase-field simulations to reveal non-steady-state effects and to test an approximate model

In this report we study the epitaxial, columnar growth of (multiply oriented) dendrites/cells for a spot melt in a polycrystalline Al–Cu substrate using two-dimensional, phase-field, direct numerical simulations (DNS) at the full-melt-pool scale. Our main objective is to compare the expensive DNS model to a much cheaper but approximate “line” model in which a single-crystal phase-field simulation is confined to a narrow rectangular geometry. To perform this comparison, we develop algorithms that automatically extract quantities of interest (QoIs) from both DNS and line models. These QoIs allow us to quantitatively assess the assumptions in the line model and help us analyze its discrepancy with the DNS model. We consider four sets of heat source parameters, mimicking welding and additive manufacturing conditions, that create a combination shallow and deep melt pools. Our largest DNS simulation used 16K x 14K grid points in space. Our main findings can be summarized as follows. Under AM conditions, the QoIs of line models are in excellent agreement with the full DNS results for both shallow and deep melt pools. Under welding conditions, the primary spacing of the DNS model is smaller than the prediction of line model. We identify a geometric crowding effect that accounts for the discrepancies between the DNS and line models. We propose two potential mechanisms that determine the response of the microstructure to geometric crowding.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗
DOE OSTI2024

Quantum Tensor-Product Decomposition from Choi-State Tomography

The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt or tensor-product decomposition. While quantum technological implementations of the former are thoroughly studied, entangling properties on the operator level are harder to extract in the quantum computational framework because of the exponential nature of sample complexity. Here, we present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor-product decomposition of a unitary the effect of which on the small subsystem is captured in classical memory, while the effect on the environment is accessible as a quantum resource. This quantum algorithm may be used to make predictions about operator nonlocality and effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries. We demonstrate the method and its applications on a time-evolution unitary of an isotropic Heisenberg model in two dimensions. Published by the American Physical Society 2024

Mansuroglu, Refik (ORCID:000000017352513X)↗
DOE OSTI2025

Single-Shot Reconstruction of Electron Beam Longitudinal Phase Space in a Laser Wakefield Accelerator

We report on a single-shot longitudinal phase-space reconstruction diagnostic for electron beams in a laser wakefield accelerator via the experimental observation of distinct periodic modulations in the angularly resolved spectra. Such modulated angular spectra arise as a result of the direct interaction between the ultrarelativistic electron beam and the laser driver in the presence of the wakefield. A constrained theoretical model for the coupled oscillator, assisted by a genetic algorithm, can recreate the experimental electron spectra and, thus, fully reconstructs the longitudinal phase-space distribution of the electron beam with a temporal resolution of approximately 1.3 fs. In particular, it reveals the slice energy spread of the electron beam, which is important to measure for applications such as x-ray free electron lasers. In our experiment, the root-mean-square energy spread retrieved is bounded at 9.9 MeV, corresponding to a 0.9%–3.0% relative spread, despite the overall GeV energy beam having approximately 100% relative energy spread.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules

Abstract Materials simulations involving strongly correlated electrons pose fundamental challenges to state‐of‐the‐art electronic structure methods but are hypothesized to be the ideal use case for quantum computing algorithms. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real‐world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near‐term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using the VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies using it have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near‐term feasibility of modeling a molecule with d‐orbitals on real quantum hardware. We demonstrate that the inclusion of d‐orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE + UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

tih_vqe [SWR-23-32]

This software supports the paper, "Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules," published in the International Journal of Quantum Chemistry, whose abstract is as follows: Materials simulations involving strongly correlated electrons pose fundamental challenges to state-of-the-art electronic structure methods but are hypothesized to be the ideal use case for quantum computing. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real-world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately-sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near-term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near-term feasibility of modeling a molecule with d-orbitals on real quantum hardware. We demonstrate that the inclusion of d-orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE+UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

Graf, Peter↗
DOE OSTI2022

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗
DOE OSTI2025

Evaluation of the performance of event reconstruction algorithms in the JSNS 2 experiment using a 252 Cf calibration source

JSNS 2 investigates short-baseline neutrino oscillations using a 24-meter baseline and a 17-tonne Gd-loaded liquid scintillator target. Accurate event-reconstruction algorithms are crucial for analyzing experimental data. The algorithms undergo meticulous validation through calibration with a 252 Cf source. This paper outlines the methodology and evaluates the reconstruction performance, focusing on neutrino interactions up to approximately 50 MeV for sterile neutrino searches. Both 252 Cf and Michel electron events are studied to evaluate reconstruction accuracy. The analysis concludes that the uncertainty of the fiducial volume, with an appropriate correction, is much less than the requirement of JSNS 2 requirement (10%). Furthermore, the energy resolution is measured to be 3.3 ± 0.1% for the Michel electron endpoint and 4.3 ± 0.1% for the n-Gd peak in the central region.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗