Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “successive linear approximation”

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 37 records · Page 2

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

Modeling Contact Angle vs. Temperature for the Quartz-Water-Decane System

Innovative approaches are needed to improve the efficiency of oil recovery technologies to meet the growing demands of fossil-fuel based energy consumption. Enhanced oil recovery (EOR) methods such as low-salinity waterflooding and chemically tuned waterflooding aim to optimize the reservoir’s wetting properties, detaching oil globules from rock surfaces and allowing easier oil flow through pore throats. This wetting behavior is commonly quantified by contact angle measurements of the rock-oil-brine interface, which have been thoroughly investigated and theorized for many systems at ambient temperatures and pressures. However, few studies exist for extending contact angle theories away from ambient conditions. In this paper, we model the contact angles of a quartz-water-decane system at elevated temperatures using the surface tension component (STC) approach. Temperature-dependent van der Waals [Lifshitz-van der Waals (LW)] interactions and hydrogen-bonding (acid-base) interactions were calculated and are incorporated into the model for the quartz-water-decane interface. Additionally, the Hough and White procedure was used to create temperature-dependent dielectric functions of quartz, water, and normal decane for calculations of Hamaker coefficients. Hamaker coefficients calculated this way are highly linear with temperature and agree well with Israelachvili’s approximation. The acid-base interactions likely contribute the most to system wettability changes. Resulting contact angles of the quartz-water-decane system shift from water-wet (16°) to slightly water-wet (57.4°) as temperature increases. The model was also successfully verified for the quartz-air-water system. Our results can be used in future studies to determine optimal injected water compositions for specific rock-oil-brine and other systems with consideration of reservoir temperature.

02 PETROLEUM↗

Deep Koopman operators for causal discovery

Causal discovery aims to identify cause-effect mechanisms for better scientific understanding, explainable decision-making, and more accurate modeling. Standard statistical frameworks, such as Granger causality, lack the ability to quantify causal relationships in nonlinear dynamics due to the presence of complex feedback mechanisms, timescale mixing, and nonstationarity. Thus, applying these methods to study causal dynamics in real-world systems, such as the Earth, is a major challenge. Addressing this shortcoming, we leverage deep learning and a Koopman operator-theoretic formalism to present a class of causal discovery algorithms. Kausal uses deep Koopman operator methods to approximate nonlinear dynamics in a linearized vector space in which traditional causal inference methods such as Granger causality can be more easily applied. Our idealized experiments demonstrate Kausal’s superior ability in discovering and characterizing causal signals compared to existing deep learning and non-deep learning state-of-the-art approaches. Finally, the successful identification of major El Niño and La Niña events in observations showcases Kausal’s skill to handle real-world applications.

54 ENVIRONMENTAL SCIENCES↗

Application of machine learning and artificial intelligence to extend EFIT equilibrium reconstruction

Recent progress in the application of machine learning (ML)/artificial intelligence (AI) algorithms to improve the Equilibrium Fitting (EFIT) code equilibrium reconstruction for fusion data analysis applications is presented. A device-independent portable core equilibrium solver capable of computing or reconstructing equilibrium for different tokamaks has been created to facilitate adaptation of ML/AI algorithms. A large EFIT database comprising of DIII-D magnetic, motional Stark effect, and kinetic reconstruction data has been generated for developments of EFIT model-order-reduction (MOR) surrogate models to reconstruct approximate equilibrium solutions. Furthermore, a neural-network MOR surrogate model has been successfully trained and tested using the magnetically reconstructed datasets with encouraging results. Other progress includes developments of a Gaussian process Bayesian framework that can adapt its many hyperparameters to improve processing of experimental input data and a 3D perturbed equilibrium database from toroidal full magnetohydrodynamic linear response modeling using the Magnetohydrodynamic Resistive Spectrum - Feedback (MARS-F) code for developments of 3D-MOR surrogate models.

Gaussian process↗

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

Tight-binding study of beryllium

In this work, we have applied the Naval Research Laboratory Tight-binding (NRL-TB) Method to the hcp alkaline-earth metal Beryllium. This approach consists of fitting to energy band and total energy data generated by the Linearized Augmented Plane Wave (LAPW) for the fcc, bcc, sc, and hcp structures as a function of volume. First, we found that using the Generalized Gradient Approximation (GGA) for the input data secures a better agreement to experimental volumes than the LDA. Second, we found that including small volumes to the fit is needed to get TB parameters that are transferable enough to successfully predict the energies of structures that were not fitted, and to perform molecular dynamics (MD) simulations. The non-orthogonal Hamiltonian obtained, is successful in correctly predicting the hcp lattice as the ground state of Be and finding eight other structures, that were not fitted to LAPW, positioned at higher energies. In addition, the NRL-TB produces accurate energy bands, densities of states, elastic constants, the Bain path and several quantities derived from MD simulations.

36 MATERIALS SCIENCE↗

Achieving High-Resolution Hard X-ray Microscopy using Monolithic 2D Multilayer Laue Lenses

This article introduces the 2D multilayer Laue lens (MLL) nanofocusing optics recently developed for high-resolution hard X-ray microscopy. The new optics utilized a micro-electro-mechanical-system (MEMS)-based template to accommodate two linear MLL optics in a pre-aligned configuration. Angular misalignment between the two lenses was controlled in tens of millidegrees, and the lateral position error was on a micrometer scale. Using the developed 2D MLLs, an astigmatism-free point focus of approximately 14 nm by 13 nm in horizontal and vertical directions, respectively, at 13.6 keV photon energy was obtained. In conclusion, the success of 2D MLL optics with an approaching 10 nm resolution is a significant step forward for the development of high-resolution hard X-ray microscopy and applications of MLL optics in the hard X-ray community.

36 MATERIALS SCIENCE↗

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

Adsorptive denitrogenation of model aviation fuel using mesoporous silica in a packed bed adsorption system

This study aims to understand the effects of system process parameters such as flow rate, adsorbent particle size, and use of recycled adsorbent on denitrogenation performance of a model fuel using mesoporous silica gel. The goal is to reduce the nitrogen content of the model fuel from 1500 parts per million to single-digit ppm to meet ASTM specifications for drop-in fuels. This work was done with the intent of applying adsorptive denitrogenation to sustainable aviation fuel (SAF) product fractions produced via hydrothermal liquefaction (HTL). The adsorption performance of the silica is evaluated via packed column breakthrough data, with data generated from collecting from the column outlet and quantifying nitrogen content via gas chromatography. Select experiments use a significantly larger (2.5x column diameter and length) column to demonstrate linear scalability of the process. Thermogravimetric analysis data is collected to evaluate the effects of thermal calcination as a sorbent regeneration method. Effects of a more complex feed are also investigated using a known reference fuel with additional added nitrogen containing compounds. The results presented in this work successfully demonstrate up to 99.8 % removal of NCCs from a model fuel fraction at an original NCC concentration of approximately 1500 ppm to single-digit parts per million after treatment. We also examine calcination of sorbent materials to remove the adsorbed species to enable sorbent reuse and minimize waste generation and show that the calcined material can be reused up to 5 cycles with reduced adsorption capacity. Overall, this work indicates that adsorptive denitrogenation using silica gel is a viable solution to enable the integration of HTL-derived aviation fuels into existing fuel infrastructure.

Adsorption techniques↗

Time dependent supervisory control update with FARM using rolling window

This report describes improvements to the Feasible Actuator Range Modifier (FARM) component of the RAVEN-based HYBRID framework for analysis of Integrated Energy Systems (IES). FARM supports the HERON plug-in that solves the power dispatch problem. The solution to the dispatch problem involves economically optimal dispatches that satisfy limits on production variables and their rates of variation (explicit constraints) as well as process variables tied to the service life of equipment (implicit constraints). FARM serves to validate or confirm that a HERON solution for explicit constraints also satisfies the implicit constraints. FARM-alpha was released by Argonne National Laboratory in January 2021 followed by FARM-Beta in January 2022 with the latter providing increased flexibility for the user. In this report, FARM-Gamma, the latest version of the code, is described. The major improvement is the implementation of a system identification algorithm based on the Dynamic Mode Decomposition with Control (DMDc) coupled with a “Rolling Window” scheme that allows obtaining linear time-varying state-space models. This feature equips FARM with the most accurate approximation of system dynamics, and it relieves the user from the burden of performing an exhaustive off-line characterization of the dynamics. FARM-Gamma capabilities are assessed by solving the power dispatch problem for a representative IES unit. The simulation times corresponding to the different releases are estimated and compared. These values capture the increasing computational burden of the successively higher fidelity state-space models adopted by FARM-Alpha, FARM-Beta and FARM-Gamma. The code implementation provides significant flexibility, i.e., the user can always select the most suitable version of FARM according to the problem to be solved and the available computational resources. It is anticipated that FARM will play a role in addressing several future IES applications. We outline how it can support the coordinated management and safe operation of a nuclear plant coupled to industrial processes to produce hydrogen and synfuels.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Higher-order LaSDI: Reduced order modeling with multiple time derivatives

Solving complex partial differential equations (PDEs) is essential across scientific disciplines but often requires numerical models that can be prohibitively expensive in time-sensitive applications. Reduced-order models (ROMs) address this challenge by exploiting low-dimensional structure to create fast approximations. The Latent Space Dynamics Identification (LaSDI) framework has demonstrated success in learning ROMs for parameterized PDE families, but remains limited to first-order systems. Here, in this paper, we propose Higher-Order LaSDI (HLaSDI), which extends the LaSDI framework to PDEs with arbitrary order of time derivatives. This generalization significantly expands the applicability of LaSDI-based methods to systems previously outside their scope, including hyperbolic PDEs. We demonstrate HLaSDI’s accuracy and efficiency on several linear and nonlinear benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Bump Morphology of the CMAGIC Diagram

Abstract We apply the color–magnitude intercept calibration method (CMAGIC) to the Nearby Supernova Factory SNe Ia spectrophotometric data set. The currently existing CMAGIC parameters are the slope and intercept of a straight line fit to the linear region in the color–magnitude diagram, which occurs over a span of approximately 30 days after maximum brightness. We define a new parameter, ω XY , the size of the “bump” feature near maximum brightness for arbitrary filters X and Y . We find a significant correlation between the slope of the linear region, β XY , in the CMAGIC diagram and ω XY . These results may be used to our advantage, as they are less affected by extinction than parameters defined as a function of time. Additionally, ω XY is computed independently of templates. We find that current empirical templates are successful at reproducing the features described in this work, particularly SALT3, which correctly exhibits the negative correlation between slope and “bump” size seen in our data. In 1D simulations, we show that the correlation between the size of the “bump” feature and β XY can be understood as a result of chemical mixing due to large-scale Rayleigh–Taylor instabilities.

79 ASTRONOMY AND ASTROPHYSICS↗

LCLS-II Helium Refrigeration System Commissioning Results

SLAC National Accelerator Laboratory has upgraded to LCLS-II, featuring a 4 GeV superconducting linear accelerator composed of 37 cryomodules and two large helium refrigeration systems with a cooling capacity of 4 kW at 2.0 K. The LCLS-II Helium Refrigeration System (HRS) consists of two compressor stations, each with a power of approximately 4.5 MW, two 4.5 K cold boxes, each with a power of 18 kW equivalent at 4.5 K, and two sets of cold compressors that can each produce a flow of 230 g/s at 31 mbar (2.0K). Performance tests of the HRS were meticulously planned and successfully carried out, with results demonstrating that it exceeded the process requirements for LCLS-II operations. This paper provides a detailed presentation of the LCLS-II HRS performance and the challenges encountered during the commissioning phase.

42 ENGINEERING↗

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↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Efficient simulations of charge density waves in the transition metal Dichalcogenide TiSe 2

Charge density waves (CDWs) in transition metal dichalcogenides are the subject of growing scientific interest due to their rich interplay with exotic phases of matter and their potential technological applications. Here, using density functional theory with advanced meta-generalized gradient approximations (meta-GGAs) and linear response time-dependent density functional theory (TDDFT) with state-of-the-art exchange-correlation kernels, we investigate the electronic, vibrational, and optical properties in 1T-TiSe 2 with and without CDW. In both bulk and monolayer TiSe 2 , the electronic bands and phonon dispersions in either normal or CDW (semiconducting) phase are described well via meta-GGAs, which separate the valence and conduction bands just as HSE06 does but with significantly more computational feasibility. The experimentally observed humps of electron energy loss spectroscopy are successfully reproduced in TDDFT. Our work opens the door to simulating these complexities in CDW compounds from first principles by revealing meta-GGAs as an accurate low-cost alternative to HSE06.

Electronic properties and materials↗

Resilient Operating Constraints for Power Distribution Systems under Setpoint Attacks

Integration and operation of distributed generation (DG) and energy storage (ES) in power distribution systems are enabled by communication networks and embedded sensor and control devices that increase the vulnerability of the systems to cyber-threats, broadening the attack surface and making adversary actions more unpredictable. This paper proposes a methodology that uses ellipsoidal approximations to quantify the potential damage caused by successful attacks that affect, directly or indirectly, the desired operation setpoints and may drive the power distribution operation to unsafe states by violating the limits of voltage or line flows. More specifically, a new methodology is introduced to find the optimal non-symmetric operating constraints that can be imposed to each DG and ES in order to guarantee that the power distribution system is resilient to any malicious setpoints. The proposed method takes as inputs the system topology, DG and ES capabilities, and load limits to solve a convex optimization problem formulated using linear matrix inequalities (LMIs) and the power flow equations. The proposed solution is agnostic to the attacker's action or load profile and it does not require any assumption about the location or means of the attack. The numerical results on a test distribution feeder with several DG and ES illustrate how the proposed resilient operating constraints guarantee the security of the power distribution system under setpoint attacks.

Giraldo, Jairo↗