Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 1,135 records · Page 63

Mapping 3D grain and precipitate structure during in situ mechanical testing of open-cell metal foam using micro-computed tomography and high-energy X-ray diffraction microscopy

Open-cell metal foams are ultra-low-density cellular metals with complex hierarchical structures that span bulk, cell, ligament, and sub-ligament scales and give rise to desirable properties such as high strength-to-weight ratio and excellent energy absorption. Although literature suggests that intrinsic material structures at sub-ligament length scales (e.g., grains and precipitates) play an important role in mechanical behavior of open-cell metal foams, there are very few experimental measurements of such structures in three dimensions and for meaningful volumes of foam. This study seeks to map and track the three-dimensional (3D) grain and precipitate structures of an intact volume of open-cell aluminum foam by advancing microstructural characterization techniques that leverage X-ray micro-computed tomography (μCT) and far-field high-energy X-ray diffraction microscopy (FF-HEDM). A 6%-relative-density aluminum foam sample was mechanically tested in compression while μCT and FF-HEDM measurements were collected at interrupted loading states at beamline 1-ID of the Advanced Photon Source. Further, a new scanning strategy and reconstruction algorithm were established to enable characterization of a foam volume with diameter approximately four times wider than the nominal width of the X-ray beam. The result is a set of maps that detail both the 3D grain and precipitate structures throughout the foam volume at successive strain steps. A novel grain tracking procedure was developed to track individual grains within the foam volume by accounting for the large rigid-body motions that individual ligaments can undergo during mechanical loading. The ability to track grains and precipitate structures in three dimensions throughout large bulk deformation of ultra-low-density polycrystalline materials enables new possibilities for validating numerical models and investigating local failure mechanisms. Furthermore, the methods and procedures developed in this study could be applied to other ultra-low-density structures, such as additively manufactured lattices.

36 MATERIALS SCIENCE↗

Low energy light yield of fast plastic scintillators

Compact neutron imagers using double-scatter kinematic reconstruction are being designed for localization and characterization of special nuclear material. These neutron imaging systems rely on scintillators with a rapid prompt temporal response as the detection medium. As n-p elastic scattering is the primary mechanism for light generation by fast neutron interactions in organic scintillators, proton light yield data are needed for accurate assessment of scintillator performance. The proton light yield of a series of commercial fast plastic organic scintillators—EJ-200, EJ-204, and EJ-208—was measured via a double time-of-flight technique at the 88-Inch Cyclotron at Lawrence Berkeley National Laboratory. Using a tunable deuteron breakup neutron source, target scintillators housed in a dual photomultiplier tube configuration, and an array of pulse-shape- discriminating observation scintillators, the fast plastic scintillator light yield was measured over a broad and continuous energy range down to proton recoil energies of approximately 50 keV. Furthermore, this work provides key input to event reconstruction algorithms required for utilization of these materials in emerging neutron imaging modalities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Energy-conserving coupled trajectory mixed quantum–classical dynamics

The coupled-trajectory mixed quantum–classical method (CTMQC), derived from the exact factorization approach, has successfully predicted photo-chemical dynamics in a number of interesting molecules, capturing population transfer and decoherence from first principles. Furthermore, due to the approximations made, CTMQC does not guarantee energy conservation. We propose a modified algorithm, CTMQC-E, which redefines the integrated force in the coupled-trajectory term so to restore energy conservation, and demonstrate its accuracy on scattering in Tully’s extended coupling region model and photoisomerization in a retinal chromophore model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Development, Verification, and Validation of an OpenFOAM-Based Solver for Modeling Inertial Fusion Energy Chambers

Our work seeks to introduce a computational tool tailored to the physics of inertial fusion energy chambers, in particular, those concepts based on thick liquid walls. In this approach, the structural materials are protected by several neutron mean-free-paths of renewable liquid and thus will be able to survive much longer than un-shielded walls, with virtually all structures lasting for the life of the plant and enabling the use of commercially available and qualified materials. The OpenFOAM-based solver named rhoCentralFoam has been used as a starting point. rhoCentralFoam belongs to the standard OpenFOAM solver toolset. It is a high-speed, explicit compressible flow solver with shock-capturing capability. While the main features have been retained, the solver had to be restructured to make use of tabular data for equations of states, a necessary addition to model the complex thermo-physical properties of ionized gasses. This entailed the need to change the independent state variables used by the solver, resulting in a new thermodynamic library and slightly different solution algorithm. Moreover, a radiation heat transfer model based on the P-1 approximation was added to the solver. The solver is verified against an analytical solution from the Sedov-Taylor-Neumann test problem to showcase the ability of the hydrodynamic solvers to handle strong shocks, whereas the P-1 model was verified using a simple one-dimensional problem with an analytical solution. Additionally, a validation case involving shock-wave propagation through jet array is presented, and the results are compared with experimental data from the open literature. Lastly, in order to showcase the utility of the solver for practical cases, we applied the refined solver to two representative scenarios: gas venting within the HYLIFE-II chamber and the compression of the gas following the partial ablation of the liquid wall.

Chamber dynamics↗

Topological bifurcation of magnetic islands in NSTX-U

The topological bifurcation of magnetic islands is observed in two M3D-C1 linear resistive MHD calculations of model NSTX-U equilibria during the application of small 3D magnetic perturbation fields. In comparing to a DIII-D ELM suppression case, reconstructed from shot 147170 at time slice 3745 ms, we propose that stronger kink response in the NSTX-U plasma may be the primary causes of the bifurcations. Island evolution and bifurcation in both the DIII-D and the two NSTX-U cases with the increase of perturbation current are analyzed. Further, a hypothesis is proposed that such magnetic island topology bears an intrinsic property to confine charged particles and cause their density inside the islands to rise, which is examined by implementing a random kick algorithm in the magnetic field line integration code TRIP3D-GPU to approximate electron collisional transport. Although full consideration of all forces between electrons is missing as it requires 3D large scale kinetic simulation in toroidal geometry, the positive result of this approximate transport simulation does provide first step confirmation towards fully validating the hypothesis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Resources required for topological quantum factoring

We consider a hypothetical topological quantum computer composed of either Ising or Fibonacci anyons. For each case, we calculate the time and number of qubits (space) necessary to execute the most computationally expensive step of Shor's algorithm, modular exponentiation. For Ising anyons, we apply Bravyi's distillation method [S. Bravyi, Phys. Rev. A 73, 042313 (2006)] which combines topological and nontopological operations to allow for universal quantum computation. With reasonable restrictions on the physical parameters we find that factoring a 128-bit number requires approximately 10{sup 3} Fibonacci anyons versus at least 3x10{sup 9} Ising anyons. Other distillation algorithms could reduce the resources for Ising anyons substantially.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗

Real-time nonlinear optimization as a generalized equation.

We establish results for the problem of tracking a time-dependent manifold arising in real-time optimization by casting this as a parametric generalized equation. We demonstrate that if points along a solution manifold are consistently strongly regular, it is possible to track the manifold approximately by solving a single linear complementarity problem (LCP) at each time step. We derive sufficient conditions guaranteeing that the tracking error remains bounded to second order with the size of the time step even if the LCP is solved only approximately. We use these results to derive a fast, augmented Lagrangian tracking algorithm and demonstrate the developments through a numerical case study.

36 MATERIALS SCIENCE↗

Semi-Analytical Hierarchical Bayesian Inference of Nonlinear Model Structure in Stochastic Dynamics: Applied to Compartmental Models of Infectious Diseases

A Bayesian computational framework for parsimonious inference in stochastic nonlinear dynamical systems is presented. This framework enables the concurrent estimation of system states, time-varying parameters, time-invariant parameters, and the optimal sparsity structure of the model parameters. Because differential equation-based models are often simplified mechanistic or phenomenological representations, robust inference from noisy measurement data requires explicit treatment of model error and uncertainty. Model error and time-varying parameters can be represented as random processes, enabling inference while making minimal assumptions about the underlying sources of discrepancy and variability. Adopting stochastic differential equation representations affords the model significant flexibility, but can also render it susceptible to overfitting during statistical inversion, where the inferred model may track noise rather than the underlying signal. To alleviate the effects of overfitting and to enable the discovery of the optimal sparse representation of the time-invariant parameters, a Bayesian sparse learning algorithm is embedded within the framework. This sparse learning framework adopts an approximate hierarchical Bayesian setting defined by a series of semi-analytical expressions. The model structure inference framework is validated using a stochastic compartmental model for tracking and forecasting active cases of an infectious disease. Compartmental models describe population-level infectious disease dynamics through interactions among population fractions grouped by disease state. Mathematically, such models consist of a system of coupled ordinary differential equations. This example adopts an expressive compartmental model that includes multiple possible interactions between disease states, motivated by early uncertainty surrounding COVID-19 reinfection dynamics and their implications for long-term epidemic forecasting. The sparse learning exercise permits the inference of a priori unknown epidemiological dynamics from simulated public health data, discovering the nested compartmental model that optimizes the trade-off between average data-fit and model complexity. It is shown that inducing sparsity among the model parameters eliminates redundant interactions between compartments, equivalently revealing the optimal coupling structure between differential equations.

97 MATHEMATICS AND COMPUTING↗

Efficient and robust gradient enhanced Kriging emulators.

%E2%80%9CNaive%E2%80%9D or straight-forward Kriging implementations can often perform poorly in practice. The relevant features of the robustly accurate and efficient Kriging and Gradient Enhanced Kriging (GEK) implementations in the DAKOTA software package are detailed herein. The principal contribution is a novel, effective, and efficient approach to handle ill-conditioning of GEK's %E2%80%9Ccorrelation%E2%80%9D matrix, RN%CC%83, based on a pivoted Cholesky factorization of Kriging's (not GEK's) correlation matrix, R, which is a small sub-matrix within GEK's RN%CC%83 matrix. The approach discards sample points/equations that contribute the least %E2%80%9Cnew%E2%80%9D information to RN%CC%83. Since these points contain the least new information, they are the ones which when discarded are both the easiest to predict and provide maximum improvement of RN%CC%83's conditioning. Prior to this work, handling ill-conditioned correlation matrices was a major, perhaps the principal, unsolved challenge necessary for robust and efficient GEK emulators. Numerical results demonstrate that GEK predictions can be significantly more accurate when GEK is allowed to discard points by the presented method. Numerical results also indicate that GEK can be used to break the curse of dimensionality by exploiting inexpensive derivatives (such as those provided by automatic differentiation or adjoint techniques), smoothness in the response being modeled, and adaptive sampling. Development of a suitable adaptive sampling algorithm was beyond the scope of this work; instead adaptive sampling was approximated by omitting the cost of samples discarded by the presented pivoted Cholesky approach.

Dalbey, Keith R.↗

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗

Approximating Nash Equilibrium in Day-ahead Electricity Market Bidding with Multi-agent Deep Reinforcement Learning

In this paper, a day-ahead electricity market bidding problem with multiple strategic generation company (GEN-CO) bidders is studied. The problem is formulated as a Markov game model, where GENCO bidders interact with each other todevelop their optimal day-ahead bidding strategies. Considering unobservable information in the problem, a model-free and data-driven approach, known as multi-agent deep deterministic policy gradient (MADDPG), is applied for approximating the Nash equilibrium (NE) in the above Markov game. The MADDPG algorithm has the advantage of generalization due to the automatic feature extraction ability of the deep neural networks. The algorithm is tested on an IEEE 30-bus system with three competitive GENCO bidders in both an uncongested caseand a congested case. Comparisons with a truthful bidding strategy and state-of-the-art deep reinforcement learning methods including deep Q network and deep deterministic policy gradient (DDPG) demonstrate that the applied MADDPG algorithm can find a superior bidding strategy for all the market participants with increased profit gains. In addition, the comparison with a conventional model-based method shows that the MADDPG algorithm has higher computational efficiency, which is feasible for real-world applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Analog system for computing sparse codes

A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

Rozell, Christopher John↗

Design and Optimization of a Gas-Cooled, Airfoil Fin Microchannel Heat Exchanger

High-performance microchannel heat exchangers are needed to supply heat for power conversion for nuclear microreactors. An airfoil fin microchannel design, constructed of Alloy 617 with helium as the working fluid, was analyzed and optimized using a design of experiments with artificial intelligence and machine learning techniques. The use of airfoil fins offers the potential to reduce pressure drop across the heat exchanger, as compared to other types of channel configurations. A framework for topology optimization of airfoil fin PCHEs has been developed that can be readily extended to different fin sizes and shapes, as well as different inlet and operating conditions, materials of construction, and working fluids. An optimization procedure was developed that employs computational fluid dynamics for a set of design points identified using Latin hypercube sampling. STAR-CCM+ was used to analyze a simplified two-channel configuration where five parameters were varied – inlet angle, fin scale, extent of staggering, transverse and longitudinal pitches. Two methods were compared for generating surrogate models – a 5D polynomial and a regression neural network. A response surface approximation was created from the surrogate models and input to a genetic algorithm. The genetic algorithm identified a set of optimal points on the Pareto front. The optimal geometry was found across six channel Reynolds numbers ranging from 1000 to 5000 to analyze how varying inlet conditions affects the optimal design. A set of optimal designs that maximizes heat transfer and minimizes pressure drop was identified, and a thermal stress analysis was performed on the optimal design. This work has developed a digital framework for the expedient topology design and evaluation of PCHE designs for gas-cooled microreactor applications. Correlations for the Nusselt number and Darcy friction factor were developed that can be useful for thermal hydraulic analyses using system codes. A thermal stress analysis was conducted and a brief discussion of the status of code cases of PCHEs for nuclear applications is given. Testing and thermomechanical modeling is needed to facilitate future code compliance of PCHEs for high pressure and high temperature applications.

42 ENGINEERING↗

Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry

Determining Hamiltonian ground states and energies is a challenging task with many possible approaches on quantum computers. While variational quantum eigensolvers are popular approaches for near term hardware, adiabatic state preparation is an alternative that does not require noisy optimization of parameters. Beyond adiabatic schedules, QAOA is an important method for optimization problems. In this work we modify QAOA to apply to finding ground states of molecules and empirically evaluate the modified algorithm on several molecules. This modification applies physical insights used in classical approximations to construct suitable QAOA operators and initial state. We find robust qualitative behavior for QAOA as a function of the number of steps and size of the parameters, and demonstrate this behavior also occurs in standard QAOA applied to combinatorial search. To this end we introduce QAOA phase diagrams that capture its performance and properties in various limits. In particular we show a region in which non-adiabatic schedules perform better than the adiabatic limit while employing lower quantum circuit depth. We further provide evidence our results and insights also apply to QAOA applications beyond chemistry.

Kremenetski, Vladimir↗

SU-F-BRD-09: Is It Sufficient to Use Only Low Density Tissue-Margin to Compensate Inter-Fractionation Setup Uncertainties in Lung Treatment?

Purpose: In lung radiation treatment, PTV is formed with a margin around GTV (or CTV/ITV). Although GTV is most likely of water equivalent density, the PTV margin may be formed with the surrounding low-density tissues, which may lead to unreal dosimetric plan. This study is to evaluate whether the concern of dose calculation inside the PTV with only low density margin could be justified in lung treatment. Methods: Three SBRT cases were analyzed. The PTV from the original plan (Plan-O) was created with a 5–10 mm margin outside the ITV to incorporate setup errors and all mobility from 10 respiratory phases. Test plans were generated with the GTV shifted to the PTV edge to simulate the extreme situations with maximum setup uncertainties. Two representative positions as the very posterior-superior (Plan-PS) and anterior-inferior (Plan-AI) edge were considered. The virtual GTV was assigned a density of 1.0 g.cm−3 and surrounding lung, including the PTV margin, was defined as 0.25 g.cm−3. Also, additional plan with a 1mm tissue-margin instead of full lung-margin was created to evaluate whether a composite-margin (Plan-Comp) has a better approximation for dose calculation. All plans were generated on the average CT using Analytical Anisotropic Algorithm with heterogeneity correction on and all planning parameters/monitor unites remained unchanged. DVH analyses were performed for comparisons. Results: Despite the non-static dose distribution, the high-dose region synchronized with tumor positions. This might due to scatter conditions as greater doses were absorbed in the solid-tumor than in the surrounding low-density lungtissue. However, it still showed missing target coverage in general. Certain level of composite-margin might give better approximation for the dosecalculation. Conclusion: Our exploratory results suggest that with the lungmargin only, the planning dose of PTV might overestimate the coverage of the target during treatment. The significance of this overestimation might warrant further investigation.

60 APPLIED LIFE SCIENCES↗

Method for estimating the density of high-level nuclear waste glass

A database of over 1100 silicate glass compositions and densities was compiled and used to evaluate the efficacy of an algorithm for estimating the density of silicate glass compositions. We sought to develop a parsimonious algorithm based on the additivity of partial molar volumes of individual oxide components weighted by their mole fraction in a glass composition. Bound molar volumes were used for oxides in which the density of the oxide bound in a glass matrix was previously determined. The bound molar volumes were known for oxides covering 97.5 mole percent of the database compositional space. The measured glass densities were plotted against the estimated glass densities and a linear regression yielded an R 2 adj. = 0.95 and a slope and intercept of approximately one and zero, respectively. This regression suggests that glass densities estimated by the algorithm, within analysis uncertainty, are equal to the measured densities of the glasses. In addition to the development of the density estimation, we corroborated many of the referenced bound molar volume data used in the parameterization of the estimation algorithm via linear regression of the individual partial molar volumes versus the inverse measured densities (specific volumes) of the glasses in the database.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗