Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical optimization”

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,207 records · Page 67

Programming approaches for scalability, performance, and portability of combustion physics codes

Here, this paper presents the process, strategy, and results associated with porting a typical combustion physics flow solver to current state-of-the-art and future massively-parallel computer architectures. Major focus is placed on the distinct algorithmic structure of these types of codes and how it can be integrated with modern programming paradigms for heterogeneous platforms (i.e., distributed many-core systems with accelerators). An end-to-end case study is presented that exemplifies the process in a generic manner, which then serves as a clear guide with respect to the strategy and best practices leading to a robust and adaptable framework that performs well, is durable over time, is portable, and requires minimal human-effort. This end is accomplished beginning with the use of a mature, validated, structured, multiblock code framework optimized for application of both Large Eddy Simulation (LES) and Direct Numerical Simulation (DNS). This code has been ported to a variety of platforms over the past decade, including most recently the Oak Ridge Leadership Computing Facility’s “Summit” Platform. The experience gained on these multiple platforms provides general insights and thus the results presented are not specific to any one code or platform other than the overarching trend toward distributed many-core systems with accelerators in order to move toward exascale performance. The resultant performance and scalability of the ported code is demonstrated on a real-world application; a state-of-the-art rotating detonation rocket engine simulation that matches the complex geometry and boundary conditions imposed as part of a companion experimental campaign.

97 MATHEMATICS AND COMPUTING↗

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗

Wind effect on the performance of solid particle solar receivers with and without the protection of an aerowindow

The wind conditions affect the performance of a solid particle solar receiver (SPSR) by convection heat transfer through the existing open aperture. Aerowindows have the potential of increasing the efficiency of an SPSR. In the present paper, the wind effect on the performance of an SPSR is investigated numerically with and without the protection of an aerowindow. The independence of the calculating domain in a wind field has been studied in order to select a proper domain for the numerical simulation. The cavity thermal efficiencies and the exiting temperature of the solid particles have been calculated and analyzed for different wind conditions. The numerical investigation of the SPSRs' performance can provide a guide in optimizing the prototype design, finding out the suitable working condition and proposing efficiency enhancing techniques for SPSRs. (author)

14 SOLAR ENERGY↗

Learning to simulate high energy particle collisions from unlabeled data

In many scientific fields which rely on statistical inference, simulations are often used to map from theoretical models to experimental data, allowing scientists to test model predictions against experimental results. Experimental data is often reconstructed from indirect measurements causing the aggregate transformation from theoretical models to experimental data to be poorly-described analytically. Instead, numerical simulations are used at great computational cost. We introduce Optimal-Transport-based Unfolding and Simulation (OTUS), a fast simulator based on unsupervised machine-learning that is capable of predicting experimental data from theoretical models. Without the aid of current simulation information, OTUS trains a probabilistic autoencoder to transform directly between theoretical models and experimental data. Identifying the probabilistic autoencoder’s latent space with the space of theoretical models causes the decoder network to become a fast, predictive simulator with the potential to replace current, computationally-costly simulators. Here, we provide proof-of-principle results on two particle physics examples, Z-boson and top-quark decays, but stress that OTUS can be widely applied to other fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Applications of atomic layer deposition and chemical vapor deposition for perovskite solar cells

Metal halide perovskite solar cells (PSCs) have rapidly evolved over the past decade to become a photovoltaic technology on the cusp of commercialization. In the process, numerous fabrication strategies have been explored with the goal of simultaneously optimizing for device efficiency, stability, and scalability. Atomic layer deposition (ALD) and chemical vapor deposition (CVD) have proven to be effective tools for the fabrication of various components of PSCs. This review article examines the application of ALD and CVD for the deposition and modification of charge transport layers, passivation layers, absorber materials, encapsulants, and electrodes. It outlines the use of these vapor deposition techniques in state-of-the-art, multi-junction solar cell devices, and also contains a discussion of the stability of metal halide perovskite materials under ALD and CVD conditions based on in situ characterization reported in literature. Finally, this article concludes with insights into future ALD and CVD research directions that could be undertaken to further aid the deployment of PSCs in emerging solar photovoltaic markets.

14 SOLAR ENERGY↗

Modeling laser wakefield accelerator experiments with ultrafast particle-in-cell simulations in boosted frames

The development of new laser systems at the 10 Petawatt range will push laser wakefield accelerators to novel regimes, for which theoretical scalings predict the possibility to accelerate electron bunches up to tens of GeVs in meter-scale plasmas. Numerical simulations will play a crucial role in testing, probing, and optimizing the physical parameters and the setup of future experiments. Fully kinetic simulations are computationally very demanding, pushing the limits of today's supercomputers. In this paper, the recent developments in the OSIRIS framework [R. A. Fonseca et al., Lect. Notes Comput. Sci. 2331, 342 (2002)] are described, in particular the boosted frame scheme, which leads to a dramatic change in the computational resources required to model laser wakefield accelerators. Results from one-to-one modeling of the next generation of laser systems are discussed, including the confirmation of electron bunch acceleration to the energy frontier.

43 PARTICLE ACCELERATORS↗

Prediction of Microstructure in High-Strength Ductile Forging Parts

Governmental, environmental and economic demands call for lighter, stiffer and at the same time cheaper products in the vehicle industry. Especially safety relevant parts have to be stiff and at the same time ductile. The strategy of this project was to improve the mechanical properties of forging steel alloys by employing a high-strength and ductile bainitic microstructure in the parts while maintaining cost effective process chains to reach these goals for high stressed forged parts. Therefore, a new steel alloy combined with an optimized process chain has been developed. To optimize the process chain with a minimum of expensive experiments, a numerical approach was developed to predict the microstructure of the steel alloy after the process chain based on FEM simulations of the forging and cooling combined with deformation-time-temperature-transformation-diagrams.

36 MATERIALS SCIENCE↗

COMPARING NUMERICAL METHODS FOR ISOTHERMAL MAGNETIZED SUPERSONIC TURBULENCE

Many astrophysical applications involve magnetized turbulent flows with shock waves. Ab initio star formation simulations require a robust representation of supersonic turbulence in molecular clouds on a wide range of scales imposing stringent demands on the quality of numerical algorithms. We employ simulations of supersonic super-Alfvenic turbulence decay as a benchmark test problem to assess and compare the performance of nine popular astrophysical MHD methods actively used to model star formation. The set of nine codes includes: ENZO, FLASH, KT-MHD, LL-MHD, PLUTO, PPML, RAMSES, STAGGER, and ZEUS. These applications employ a variety of numerical approaches, including both split and unsplit, finite difference and finite volume, divergence preserving and divergence cleaning, a variety of Riemann solvers, and a range of spatial reconstruction and time integration techniques. We present a comprehensive set of statistical measures designed to quantify the effects of numerical dissipation in these MHD solvers. We compare power spectra for basic fields to determine the effective spectral bandwidth of the methods and rank them based on their relative effective Reynolds numbers. We also compare numerical dissipation for solenoidal and dilatational velocity components to check for possible impacts of the numerics on small-scale density statistics. Finally, we discuss the convergence of various characteristics for the turbulence decay test and the impact of various components of numerical schemes on the accuracy of solutions. The nine codes gave qualitatively the same results, implying that they are all performing reasonably well and are useful for scientific applications. We show that the best performing codes employ a consistently high order of accuracy for spatial reconstruction of the evolved fields, transverse gradient interpolation, conservation law update step, and Lorentz force computation. The best results are achieved with divergence-free evolution of the magnetic field using the constrained transport method and using little to no explicit artificial viscosity. Codes that fall short in one or more of these areas are still useful, but they must compensate for higher numerical dissipation with higher numerical resolution. This paper is the largest, most comprehensive MHD code comparison on an application-like test problem to date. We hope this work will help developers improve their numerical algorithms while helping users to make informed choices about choosing optimal applications for their specific astrophysical problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Existence of a robust optimal control process for efficient measurements in a two-qubit system

The verification of quantum entanglement is essential for quality control in quantum communication. In this work we propose an efficient protocol to directly verify the two-qubit entanglement of a known target state through a single-expectation-value measurement. Our method provides exact entanglement quantification using the concurrence measure without performing quantum state tomography. We prove the existence of a unitary transformation that drives a known initial state of a two-qubit system to a designated final state, where the trace over a chosen observable directly yields the concurrence of the initial state. Furthermore, we implement an optimal control process of that transformation and demonstrate its effectiveness through numerical simulations. We also show that this process is robust to environmental noise. Our approach offers advantages in directly verifying entanglement with low circuit depth, making it suitable for industrial-scale quality control of entanglement generation. Our results presented here provide mathematical justification for our earlier computational experiments.

Rodriguez, Ricardo [McPherson Coll.] (ORCID:000000↗

Tensor operators: Constructions and applications for long-range interaction systems

We consider the representation of operators in terms of tensor networks and their application to the ground-state approximation and time evolution of systems with long-range interactions. We provide an explicit construction to represent an arbitrary many-body Hamilton operator in terms of a one-dimensional tensor network (i.e., as a matrix product operator). For pairwise interactions, we show that such a representation is always efficient and requires a tensor dimension growing only linearly with the number of particles. For systems obeying certain symmetries or restrictions we find optimal representations with minimal tensor dimension. We discuss the analytic and numerical approximation of operators in terms of low-dimensional tensor operators. We demonstrate applications for time evolution and the ground-state approximation, in particular for long-range interaction with inhomogeneous couplings. The operator representations are also generalized to other geometries such as trees and two-dimensional lattices, where we show how to obtain and use efficient tensor network representations respecting a given geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quadratic dynamical decoupling: Universality proof and error analysis

We prove the universality of the generalized QDD{sub N{sub 1N{sub 2}}} (quadratic dynamical decoupling) pulse sequence for near-optimal suppression of general single-qubit decoherence. Earlier work showed numerically that this dynamical decoupling sequence, which consists of an inner Uhrig DD (UDD) and outer UDD sequence using N{sub 1} and N{sub 2} pulses, respectively, can eliminate decoherence to O(T{sup N}) using O(N{sup 2}) unequally spaced ''ideal'' (zero-width) pulses, where T is the total evolution time and N=N{sub 1}=N{sub 2}. A proof of the universality of QDD has been given for even N{sub 1}. Here we give a general universality proof of QDD for arbitrary N{sub 1} and N{sub 2}. As in earlier proofs, our result holds for arbitrary bounded environments. Furthermore, we explore the single-axis (polarization) error suppression abilities of the inner and outer UDD sequences. We analyze both the single-axis QDD performance and how the overall performance of QDD depends on the single-axis errors. We identify various performance effects related to the parities and relative magnitudes of N{sub 1} and N{sub 2}. We prove that using QDD{sub N{sub 1N{sub 2}}} decoherence can always be eliminated to O(T{sup min{l_brace}N{sub 1},N{sub 2}{r_brace}}).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single-ancilla ground state preparation via Lindbladians

We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this Lindbladian is algorithmic and should not be seen as a specific approximation to some weakly coupled system-bath dynamics in nature. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer. It can prepare the ground state even when the initial state has zero overlap with the ground state, bypassing the most significant limitation of methods like quantum phase estimation. As a variant, we also propose a discrete-time algorithm, demonstrating even better efficiency and providing a near-optimal simulation cost depending on the desired evolution time and precision. Numerical simulations using Ising and Hubbard models demonstrate the efficacy and applicability of our method. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

Coupled Lindblad Pseudomode Theory for Simulating Open Quantum Systems

Coupled Lindblad pseudomode theory is a promising approach for simulating non-Markovian quantum dynamics on both classical and quantum platforms, with dynamics that can be realized as a quantum channel. We provide theoretical evidence that the number of coupled pseudomodes only needs to scale as polylog⁡(𝑇/𝜖) in the simulation time 𝑇 and precision 𝜖. Inspired by the realization problem in control theory, we also develop a robust numerical algorithm for constructing the coupled modes that avoid the nonconvex optimization required by existing approaches. We demonstrate the effectiveness of our method by computing population dynamics and absorption spectra for the spin-boson model. Furthermore, this Letter provides a significant theoretical and computational improvement to the coupled Lindblad framework, which impacts a broad range of applications from classical simulations of quantum impurity problems to quantum simulations on near-term quantum platforms.

Anderson impurity model↗

Neural Networks-Based Inverter Control: Modeling and Adaptive Optimization for Smart Distribution Networks

The optimal voltage control of inverter-based resources, especially under the high penetration of solar photovoltaics, is critical to the stability of the distribution power system. However, the computational complexity as well as the coordinated operation performance of the voltage control optimization in the distribution power system limits the real-time applications. To mitigate this issue, a model-free based adaptive optimal control scheme for the smart inverter is proposed to maximize the active power generation, minimize the power loss, and maintain the bus voltages in smart distribution networks. An inverter-based optimization model for coordinated operation is first established, considering the uncertainties of renewable power generation. Subsequently, by collecting the data and control strategies, the neural networks (NNs) based algorithm is proposed to efficiently predict the best possible control strategy. The main objective of this scheme is to accurately predict candidate optimal solutions with near-negligible feasibility and optimization gaps, with the advantage of avoiding complicated iteration-based numerical algorithms. Thereafter, the co-simulation among OpenDSS, MATLAB, and Python is set up to fully take advantage of the three individual software. Experiments are conducted based on different control parameter characteristics and structures of NNs. Finally, the results reveal that an average mean squared error of 0.013 and 1 ms response time are achieved, which is lower than some state-of-the-art methods.

42 ENGINEERING↗

Humate's Role in Terrestrial Greenhouse Gas and Water Reduction

Carbon dioxide (CO 2 ) is considered the sole culprit for global warming; however, nitrous oxide (N 2 O), a greenhouse gas (GHG) with approximately 300 times more global warming potential than CO 2 , accounts for 6% of the GHG emissions in the United States. Seventy five percent of N 2 O emissions come from synthetic nitrogen (N) fertilizer usage in the agriculture sector primarily due to excess fertilization. Numerous studies have shown that changes in soil management practices, specifically optimizing N fertilizer use and amending soil with organic and humate materials can reverse soil damage and improve a farmer's or land reclamation company's balance sheet. Soil restoration is internationally recognized as one of the lowest cost GHG abatement opportunities available. Profitability improves in two ways: (1) lower operating costs resulting from lower input costs (water and fertilizer); and (2) increased revenue by participation in emerging GHG offsets markets, and water quality trading markets.

54 ENVIRONMENTAL SCIENCES↗

Distributed Barrier Certificates for Safe Operation of Inverter-Based Microgrids

Inverter-interfaced microgrids differ from the traditional power systems due to their lack of inertia. Vanishing timescale separation between voltage and frequency dynamics makes it critical that faster-timescale stabilizing control laws also guarantee by-construction the satisfaction of voltage limits during transients. In this article, we apply a barrier functions method to compute distributed active and reactive power setpoint control laws that certify satisfaction of voltage limits during transients. Using sum-of-squares optimization tools, we propose an algorithmic construction of these control laws. Numerical simulations are provided to illustrate the proposed method.

Kundu, Soumya↗

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗