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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

In-pixel automatic threshold calibration for the CMS Endcap Timing Layer readout chip

We present the implementation and verification of an in-pixel automatic threshold calibration circuit for the CMS Endcap Timing Layer (ETL) in the High-Luminosity LHC upgrade. The discriminator threshold of the ETL readout chip (ETROC) needs to be calibrated regularly to mitigate the circuit baseline change. Traditional methods need a lot of communication through a slow control system hence are time-consuming. This paper describes an in-pixel automatic scheme with improvements in operating time and usability. In this scheme, a sample-accumulation circuit is used to measure the average discriminator output. A binary successive approximation and linear combination scan are applied to find the equivalent baseline. The actual calibration procedure has been first implemented in FPGA firmware and tested with the ETROC front-end prototype chip (ETROC0). The calibration circuit has been implemented with Triple Modular Redundancy (TMR) and verified with Single Event Effects (SEEs) simulation. A complete calibration process lasts 35 ms with a 40 MHz clock. In the worst case, the dynamic and static power consumption are estimated to be 300 uW and 10.4 uW, respectively. The circuit design, implemented in a 65 CMOS technology, will be integrated into ETROC2, the next iteration of the ETROC with a 16 x16 pixel matrix.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Polarimetric Geometric Modeling for mm-VLBI Observations of Black Holes

The Event Horizon Telescope (EHT) is a millimeter very long baseline interferometry (VLBI) array that has imaged the apparent shadows of the supermassive black holes M87* and Sagittarius A*. Polarimetric data from these observations contain a wealth of information on the black hole and accretion flow properties. In this work, we develop polarimetric geometric modeling methods for mm-VLBI data, focusing on approaches that fit data products with differing degrees of invariance to broad classes of calibration errors. We establish a fitting procedure using a polarimetric “m-ring” model to approximate the image structure near a black hole. By fitting this model to synthetic EHT data from general relativistic magnetohydrodynamic models, we show that the linear and circular polarization structure can be successfully approximated with relatively few model parameters. We then fit this model to EHT observations of M87* taken in 2017. In total intensity and linear polarization, the m-ring fits are consistent with previous results from imaging methods. In circular polarization, the m-ring fits indicate the presence of event-horizon-scale circular polarization structure, with a persistent dipolar asymmetry and orientation across several days. The same structure was recovered independently of observing band, used data products, and model assumptions. Despite this broad agreement, imaging methods do not produce similarly consistent results. Our circular polarization results, which imposed additional assumptions on the source structure, should thus be interpreted with some caution. Polarimetric geometric modeling provides a useful and powerful method to constrain the properties of horizon-scale polarized emission, particularly for sparse arrays like the EHT.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Neural operator prediction of linear instability waves in high-speed boundary layers

Here, we investigate if neural operators can predict the linear evolution of instability waves in high-speed boundary layers. To this end, we extend the design of the DeepOnet to ensure accurate and robust predictions, and also to perform data assimilation. In particular, we train DeepONet to take as inputs an upstream disturbance and a downstream location of interest, and to provide as output the perturbation field downstream in the boundary layer. DeepONet thus approximates the linearized and parabolized Navier-Stokes operator for this flow. For successful application to the high-speed boundary layer problem, we add sample weighting and Fourier input features to the regular DeepONet formulation. Once trained, the DeepOnet can perform fast and accurate predictions of the downstream disturbances within the range of training frequencies (inside the distribution). In addition, we show that DeepONet can solve the inverse problem, where downstream wall measurements are adopted as input, and a trained network can predict the upstream disturbances that led to these observations. This capability, along with the forward predictions, allows us to perform a full data assimilation cycle efficiently: starting from wall-pressure data, we predict the upstream disturbance using the inverse DeepONet and its evolution using the forward DeepONet. Finally, we introduce three new metrics to benchmark the training, evaluation and break-even cost of neural operators.

42 ENGINEERING↗
DOE OSTI2021

Iteration-based Linearized Distribution-level Locational Marginal Price for Three-phase Unbalanced Distribution Systems

Distributed energy resources (DERs) are rocking the utilities’ business landscape. It calls for competitive market environments that incentivize DERs to form maximum operating efficiency. Among proposed pricing schemes, distribution-level locational marginal price (DLMP) is effective in signaling the marginal generation cost differences driven by energy losses and network constraints. It can be derived from a distribution-level optimal power flow (OPF) framework, as it essentially presents the sensitivity of optimized generation cost towards incremental loads. However, due to the high resistance-to-inductance ratio and unbalanced characteristics of distribution networks, computational affordable DLMPs are highly challenged. This article provides a linear-approximated DLMP that can be solved efficiently and generalized to account for reactive power flow, three-phase unbalanced loads and meshed network structure. The successive linear programming technique is introduced to enhance the model accuracy. Case studies on an IEEE 123-Bus system validate its accuracy against a nonlinear benchmark and capability in offering proper incentives.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

High-throughput determination of Hubbard $U$ and Hund $J$ values for transition metal oxides via the linear response formalism

DFT+U provides a convenient, cost-effective correction for the self-interaction error (SIE) that arises when describing correlated electronic states using conventional approximate density functional theory (DFT). The success of a DFT+U(+J) calculation hinges on the accurate determination of its Hubbard U and Hund J parameters, and the linear response (LR) methodology has proven to be computationally effective and accurate for calculating these parameters. This study provides a high-throughput computational analysis of the U and J values for transition metal d-electron states in a representative set of over 1000 magnetic transition metal oxides (TMOs), providing a frame of reference for researchers who use DFT+U to study transition metal oxides. In order to perform this high-throughput study, an ATOMATE workflow is developed for calculating U and J values automatically on massively parallel supercomputing architectures. Here, to demonstrate an application of this workflow, the spin-canting magnetic structure and unit cell parameters of the multiferroic olivine LiNiPO4 are calculated using the computed Hubbard U and Hund J values for Ni-d and O-p states, and are compared with experiment. Both the Ni-d U and J corrections have a strong effect on the Ni-moment canting angle. Additionally, including a O-pU value results in a significantly improved agreement between the computed lattice parameters and experiment

36 MATERIALS SCIENCE↗
DOE OSTI2020

Preparation of excited states for nuclear dynamics on a quantum computer

We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time T = O(√1 - F) to approximate the action of an excitation operator Ô with fidelity F and success probability P ≈ 1 – F. The second method probabilistically applies the excitation operator using the Linear Combination of Unitaries (LCU) algorithm. We benchmark these techniques on emulated and real quantum devices, using a toy model for thermal neutron-proton capture. Despite its larger memory footprint, the LCU-based method is efficient even on current generation noisy devices and can be implemented at a lower gate cost than a naive analysis would suggest. Here, these findings show that quantum techniques designed to achieve good asymptotic scaling on fault tolerant quantum devices might also provide practical benefits on devices with limited connectivity and gate fidelity.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Learning Optimal Power Flow Solutions using Linearized Models in Power Distribution Systems

Solving nonlinear optimal power flow (OPF) problem is computationally expensive, and poses scalability challenges for power distribution networks. An alternative to solving the original nonlinear OPF is the linear approximated OPF models. Although, these linear approximated OPF models are fast, the resulting solutions may result in significant optimality gap. Lately, the application of machine learning (ML) methods in successfully solving the nonlinear OPF has been reported. These methods learn and estimate the nonlinear control policies using a purely data-driven approach. In this paper, we propose an approach to complements the ML based approach to solving OPF using solutions from known linearized OPF model. Specifically, we use supervised learning to map the solutions of linear OPF to nonlinear control variables. Unlike, the traditional ML based methods for OPF that approximate the full distribution feeder model using function approximation, our approach uses a two-node approximation of radial networks. The proposed approach is validated using IEEE 123 bus test system for OPF solutions obtained using the nonlinear OPF models.

optimal power flow, power distribution systems, su↗
DOE OSTI2025

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗
DOE OSTI2022

GPS Measurements of Precipitable Water Vapor Can Improve Survey Calibration: A Demonstration from KPNO and the Mayall z -band Legacy Survey

Dual-band Global Positioning Satellite (GPS) measurements of precipitable water vapor (PWV) at the Kitt Peak National Observatory predict the overall per-image sensitivity of the Mayall z-band Legacy Survey (MzLS). The per-image variation in the brightness of individual stars is strongly correlated with the measured PWV and the color of the star. Synthetic stellar spectra through TAPAS transmission models successfully predict the observed PWV-induced photometric variation. We find that PWV absorption can be well approximated by a linear relationship with (airmass × PWV) 0.6 and present an update on the traditional treatment in the literature. The MzLS zero-point sensitivity in electrons s –1 varies with a normalized-mean absolute deviation of 61 mmag. PWV variation accounts 23 mmag of this zero-point variation. The MzLS per-image absolute sensitivity decreases by 40 mmag per effective mm of PWV. The overall gray offset portion of this variation is corrected by the calibration to a reference catalog. But the relative calibration error between blue (r – z < 0.5 mag) versus red (1.2 mag < r – z) stars increases by 0.3–2 mmag per effective mm of PWV. We argue that GPS systems provide more precise PWV measurements than using differential measurements of stars of different colors and recommend that observatories install dual-band GPS as a low-maintenance, low-cost, auxiliary calibration system. We extend our results of the need for well-calibrated PWV measurements by presenting the calculations of the PWV photometric impact on three science cases of interest: stellar photometry, supernova cosmology, and quasar identification and variability.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Multiqubit entanglement generation with squeezed modes

We present a hybrid continuous variable–discrete variable entanglement generation protocol using linear optics and homodyne measurements, capable of producing multiple high-fidelity Bell pairs per protocol iteration, with an approximate 0.5 success probability. The effectiveness of the protocol is determined by the squeezing strength. To increase the number of Bell pairs, approximately 3 dB of extra squeezing is needed for each additional Bell pair. The protocol also generates single Bell pairs with an approximate 0.75 probability for squeezing strengths ⪅ 15 dB , achievable with current technology.

Macridin, Alexandru [Fermilab] (ORCID:000000022228↗
DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A large enhancement of ionic conductivity in SrCoO 2.5 controlled by isostructural phase transition and negative linear compressibility

The exploration of next-generation materials and the underlying mechanisms for high ionic conductivity have been the mainstay of the study in the solid state ionic field, but with limited success. Here, we performed closely integrated in situ high-pressure structural and electronic characterizations on SrCoO 2.5 , a typical material for solid fuel cell application. We discovered that the activation energy for ionic transport decreased by approximately 47% at 13.6 GPa upon compression, demonstrating a large enhancement of conductivity. Such a desired functional behavior is strongly interlinked with the pressure-driven isostructural phase transition at which negative linear compressibility occurs along c-lattice, weakening the interaction between Co and O atoms and then enhancing the ionic diffusion. Our results provide fundamental insight of the solid ionic mechanism and materials-by-design for future high-performance oxides.

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

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗
DOE OSTI2025

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

On the Convergence of Physics Informed Neural Networks for Linear Second-Order Elliptic and Parabolic Type PDEs

Physics informed neural networks (PINNs) are deep learning based techniques for solving partial differential equations (PDEs) encountered in computational science and engineering. Guided by data and physical laws, PINNs find a neural network that approximates the solution to a system of PDEs. Such a neural network is obtained by minimizing a loss function in which any prior knowledge of PDEs and data are encoded. Despite its remarkable empirical success in one, two or three dimensional problems, there is little theoretical justification for PINNs. As the number of data grows, PINNs generate a sequence of minimizers which correspond to a sequence of neural networks. We want to answer the question: Does the sequence of minimizers converge to the solution to the PDE? We consider two classes of PDEs: linear second-order elliptic and parabolic. By adapting the Schauder approach and the maximum principle, we show that the sequence of minimizers strongly converges to the PDE solution in C 0 . Furthermore, we show that if each minimizer satisfies the initial/boundary conditions, the convergence mode becomes H 1 . Computational examples are provided to illustrate our theoretical findings. To the best of our knowledge, this is the first theoretical work that shows the consistency of PINNs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Striking luminescence phenomena of carbon dots and their applications as a double ratiometric fluorescence probes for H2S detection

Here, we report some new observations on the luminescence of carbon dots (CDs) that are passivated with polyethylene glycol, and explored them, for the first time, as highly sensitive H2S detection probe. The as-prepared CDs have an ultraviolet (UV) emission at 350 nm and a green emission at 540 nm when excited at 270 nm, but they have only a green emission at 523 nm when excited at 365 nm. As Na2S is added to the CDs, the UV emission decreases gradually, while the green emission increases slightly, and interestingly a new emission appears at 455 nm is increased linearly in intensity with the increase of Na2S concentration. The blue emission at 455 nm is from the intrinsic core of CDs, and the green emissions at 540 or 523 nm are from their surface states, while the UV emission at 350 nm is from the anchored PEG. Both the emission intensity ratios of F-450/F-350 and F-455/F-523 show an excellent linear relationship with the Na2S concentration in the range of 0-800 mu M, and the detection limit estimated from both of them is approximately 7.0 nM, indicating our method is the most sensitive H2S CDs based detection method reported thus far. Furthermore, the detection was tested successfully for H2S imaging in live cells. We propose that the interactions of H2S with the CDs and the anchored ligands, as well as the energy transfer between the ligands and the CDs, are responsible for the luminescence responses for H2S detection. Our studies enrich the world of carbon dots with plenty of potential applications. (C) 2020 Elsevier Ltd. All rights reserved.

Bioimaging↗