Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Gradient information”

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 55 records · Page 3

Real-Time Background Oriented Schlieren: Catching Up With Knife Edge Schlieren

Background Oriented Schlieren (BOS) is a widely used technique that provides density gradient information in flow fields of interest, without imposing stringent optical quality requirements on the facility/experiment windows and/or optics used in the BOS setup. Typically, the BOS reference image is acquired before the test begins (flow off) and then the "live" image data are acquired during the actual testing/experiment (flow on). The raw BOS image data, while displayed in real-time as they are acquired from the camera, unfortunately provide little if any visual indication of the density gradients in the flow. Generally, the "live" images must be processed off-line after the testing is completed, providing no indication of the success of the BOS setup and no feedback on the operational success of the test. Advances in computer processing hardware enables the implementation of real-time processing and display of the BOS image data. Two different approaches to implementing the real-time BOS (RT-BOS) processing capability are described herein. First, a traditional multi-core Central Processing Unit (CPU) based approach using scheduled parallel threads is used to build a RT-BOS processing engine. In the second approach, a Graphical Processing Unit (GPU) approach is used to costruct a RT-BOS processing engine. Generally, high core count CPU processors can provide a useful processing rate for RT-BOS. However, the GPU based approach exceeds the processing capability of the CPU approach, at a fraction of the cost. The GPU approach places no restrictions on the Host PC processing capability, except that it be capable of acquiring the BOS image data from the camera in real-time.

Wernet, Mark P.↗

Variational assimilation of VAS data into a mesoscale model Assimilation method and sensitivity experiments

The assimilation of temperature and moisture gradient information from the Visible IR Spin-Scan Radiometer's Atmospheric Sounder (VAS) into a mesoscale model is presently undertaken by means of a variational method and followed by tests of the sensitivity of both diabatic and adiabatic versions of the model to VAS data assimilations for the case of July 20-21, 1981. The synoptic scale effects of the assimilation of VAS data are noted to be negligible; the greatest impact was instead on mesoscale forecasts of convective instability patterns. The additional assimilation of relative humidity gradients did not significantly change the patterns of the forecast instabilities. The greatest improvements from assimilation resulted from the resolution of the strong mesoscale temperature gradients by the asynoptic VAS data.

Cram, J. M.↗

Estimating noise levels of remotely sensed measurements from satellites using spatial structure analysis

A technique is presented whereby the noise level of satellite measurements of the atmosphere and earth can be estimated. The technique analyzes a spatial array of data measured by a satellite instrument. A minimum of about 200 satellite measurements is required, preferably in a regular pattern. Statistical structure analysis is used to describe a combination of the mean gradient and noise in the data. The noise level is then estimated by separating out the gradient information and leaving only the noise. Results are presented for four satellite sounding instruments, and effective blackbody or brightness temperature noise levels were compared to prelaunch specifications or inflight calibrations for each instrument. Comparisons showed that in the absence of cloud-contaminated measurements (in the case of infrared data) and away from the highly variable ground surface, the noise level of various satellite instruments can be obtained without the need for calibration data. The noise levels imply how much spatial averaging is possible, without smearing the detected geophysical gradient, and how much is necessary, to meet the absolute signal accuracy requirements for the intended use of the satellite measurements.

Hillger, Donald W.↗

Distributed Automatic Differentiation for Ptychography

Synchrotron radiation light source facilities are leading the way to ultrahigh resolution X-ray imaging. High resolution imaging is essential to understanding the fundamental structure and interaction of materials at the smallest length scale possible. Diffraction based methods achieve nanoscale imaging by replacing traditional objective lenses by pixelated area detectors and computational image reconstruction. Among these methods, ptychography is quickly becoming the standard for sub-30 nanometer imaging of extended samples, but at the expense of increasingly high data rates and volumes. This paper presents a new distributed algorithm for solving the ptychographic image reconstruction problem based on automatic differentiation. Input datasets are subdivided between multiple graphics processing units (GPUs); each subset of the problem is then solved either entirely independent of other subsets (asynchronously) or through sharing gradient information with other GPUs (synchronously). The algorithm was evaluated on simulated and real data acquired at the Advanced Photon Source, scaling up to 192 GPUs. The synchronous variant of our method outperformed an existing multi-GPU implementation in terms of accuracy while running at a comparable execution time.

distributed algorithms↗

A nonlinear programming approach for optimizing two-stage lifting vehicle ascent to orbit

An optimal atmospheric flight branched trajectory-shaping capability is presented based on the Davidon-Fletcher-Powell variable metric parameter optimization technique. Gradient information is generated using finite difference methods. A typical atmospheric flight branched optimization problem is analyzed which requires the determination of 31 parameters. This parameter set includes the three-dimensional description of vehicle attitude control angles for three branches of flight: first-stage ascent, second-stage ascent, and first-stage flyback. The important inflight inequality contraints required to maintain the integrity of the vehicles are considered. Some of the numerical methods employed are discussed, along with several new auxiliary techniques developed to improve the compatibility of the numerical gradient and iterator.

Kamm, J. L.↗

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗

Multi-Agent Safe Policy Learning for Power Management of Networked Microgrids

This paper presents a supervised multi-agent safe policy learning (SMAS-PL) method for optimal power management of networked microgrids (MGs) in distribution systems. While unconstrained reinforcement learning (RL) algorithms are black-box decision models that could fail to satisfy grid operational constraints, our proposed method considers AC power flow equations and other operational limits. Accordingly, the training process employs the gradient information of operational constraints to ensure that the optimal control policy functions generate safe and feasible decisions. Furthermore, we have developed a distributed consensus-based optimization approach to train the agents’ policy functions while maintaining MGs’ privacy and data ownership boundaries. After training, the learned optimal policy functions can be safely used by the MGs to dispatch their local resources, without the need to solve a complex optimization problem from scratch. Lastly, numerical experiments have been devised to verify the performance of the proposed method.

, policy gradient↗

Analytical gradient-based optimization of CALPHAD model parameters

The calibration of CALPHAD (CALculation of PHAse Diagrams) models involves the solution of a very challenging high-dimensional multiobjective optimization problem. Traditional approaches to parameter fitting predominantly rely on gradient-free methods, which while robust, are computationally inefficient and often scale poorly with model complexity. In this work, we introduce and demonstrate a generalizable framework for analytic gradient-based optimization of the parameters of the CALPHAD model enabled by the recently formalized Jansson derivative technique. This method allows for efficient evaluation of gradients of thermodynamic properties at equilibrium with respect to model parameters, even in the presence of arbitrarily complex internal degrees of freedom. Leveraging these semi-analytic gradients, we employ the conjugate gradient (CG) method to optimize thermodynamic model parameters for four binary alloy systems: Cu-Mg, Fe-Ni, Cr-Ni, and Cr-Fe. Across all systems, CG achieves comparable or superior optimality relative to Bayesian ensemble Markov Chain Monte Carlo (MCMC) with improvements in computational efficiency ranging from one to three orders of magnitude. Furthermore, our results establish a new paradigm for CALPHAD assessments in which high fidelity data-rich model calibration becomes tractable using deterministic gradient-informed algorithms.

CALPHAD↗

Chemoattractant receptors activate, recruit and capture G proteins for wide range chemotaxis

Highlights: • Chemotactic GPCR forms an unconventional complex with the activated Gα. • Receptors activate, recruit and capture G proteins at different cAMP concentrations. • Capture of Gα can contribute to gradient sensing at high cAMP concentrations. The wide range sensing of extracellular signals is a common feature of various sensory cells. Eukaryotic chemotactic cells driven by GPCRs and their cognate G proteins are one example. This system endows the cells directional motility towards their destination over long distances. There are several mechanisms to achieve the long dynamic range, including negative regulation of the receptors upon ligand interaction and spatial regulation of G proteins, as we found recently. However, these mechanisms are insufficient to explain the 10{sup 5}-fold range of chemotaxis seen in Dictyostelium. Here, we reveal that the receptor-mediated activation, recruitment, and capturing of G proteins mediate chemotactic signaling at the lower, middle and higher concentration ranges, respectively. These multiple mechanisms of G protein dynamics can successfully cover distinct ranges of ligand concentrations, resulting in seamless and broad chemotaxis. Furthermore, single-molecule imaging analysis showed that the activated Gα subunit forms an unconventional complex with the agonist-bound receptor. This complex formation of GPCR-Gα increased the membrane-binding time of individual Gα molecules and therefore resulted in the local accumulation of Gα. Our findings provide an additional chemotactic dynamic range mechanism in which multiple G protein dynamics positively contribute to the production of gradient information.

60 APPLIED LIFE SCIENCES↗

Adaptive, problem-tailored variational quantum eigensolver mitigates rough parameter landscapes and barren plateaus

Abstract Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider the Adaptive, Problem-Tailored Variational Quantum Eiegensolver (ADAPT-VQE) ansätze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction accomplishes two things: First, it provides an initialization strategy that can yield solutions with over an order of magnitude smaller error compared to random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still “burrow” toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to barren plateaus and random initialization. Even if such barren plateaus appear in the parameter landscape, our analysis suggests that ADAPT-VQE avoids such regions by design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Steady state likelihood ratio sensitivity analysis for stiff kinetic Monte Carlo simulations

Kinetic Monte Carlo simulation is an integral tool in the study of complex physical phenomena present in applications ranging from heterogeneous catalysis to biological systems to crystal growth and atmospheric sciences. Sensitivity analysis is useful for identifying important parameters and rate-determining steps, but the finite-difference application of sensitivity analysis is computationally demanding. Techniques based on the likelihood ratio method reduce the computational cost of sensitivity analysis by obtaining all gradient information in a single run. However, we show that disparity in time scales of microscopic events, which is ubiquitous in real systems, introduces drastic statistical noise into derivative estimates for parameters affecting the fast events. In this work, the steady-state likelihood ratio sensitivity analysis is extended to singularly perturbed systems by invoking partial equilibration for fast reactions, that is, by working on the fast and slow manifolds of the chemistry. Derivatives on each time scale are computed independently and combined to the desired sensitivity coefficients to considerably reduce the noise in derivative estimates for stiff systems. The approach is demonstrated in an analytically solvable linear system.

Núñez, M.↗

Accurate parameterization of the kinetic energy functional

The absence of a reliable formulation of kinetic energy density functional has hindered the development of orbital free density functional theory. Using the data-aided learning paradigm, we propose a simple prescription to accurately model the kinetic energy density of any system. Our method relies on a dictionary of functional forms for local and nonlocal contributions which have been proposed in the literature and the appropriate coefficients are calculated via a linear regression framework. To model the nonlocal contributions, we explore two new nonlocal functionals - a functional that captures fluctuations in electronic density and a functional that incorporates gradient information. Since, the analytical functional forms of the kernels present in these nonlocal terms are not known from theory, we propose a basis function expansion to model these seemingly difficult nonlocal quantities. This allows us to easily reconstruct kernels for any system using only a few structures. The proposed method is able to learn kinetic energy densities and total kinetic energies of molecular and periodic systems, such as H 2 , LiH, LiF and a one-dimensional chain of 8 hydrogens using data from Kohn-Sham density functional theory calculations for only a few structures. For the ease of reproduction, codes used to generate the models are provided in the supporting materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Differentiable Simulation of a Liquid Argon Time Projection Chamber

Liquid argon time projection chambers (LArTPCs) are widely used in particle detection for their tracking and calorimetric capabilities. The particle physics community actively builds and improves high-quality simulators for such detectors in order to develop physics analyses in a realistic setting. The ability of these simulators to mimic real, measured data is limited by the modeling of the physical detectors used for data collection. This modeling can be improved by performing dedicated calibration measurements. Conventional approaches calibrate individual detector parameters or processes one at a time. However, the impact of detector processes is entangled, making this a poor description of the underlying physics. We introduce a differentiable simulator that enables a gradient-based optimization, allowing for the first time a simultaneous calibration of all detector parameters. We describe the procedure of making a differentiable simulator, highlighting the challenges of retaining the physics quality of the standard, non-differentiable version while providing meaningful gradient information. We further discuss the advantages and drawbacks of using our differentiable simulator for calibration. Finally, we provide a starting point for extensions to our approach, including applications of the differentiable simulator to physics analysis pipelines.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian differential programming for robust systems identification under uncertainty

This paper presents a machine learning framework for Bayesian systems identification from noisy, sparse and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of recent developments in differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling. This allows an efficient inference of the posterior distributions over plausible models with quantified uncertainty, while the use of sparsity-promoting priors enables the discovery of interpretable and parsimonious representations for the underlying latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed methods, including nonlinear oscillators, predator–prey systems and examples from systems biology. Taken together, our findings put forth a flexible and robust workflow for data-driven model discovery under uncertainty. All codes and data accompanying this article are available at https://bit.ly/34FOJMj .

Science & Technology - Other Topics↗

Gaussian processes meet NeuralODEs: a Bayesian framework for learning the dynamics of partially observed systems from scarce and noisy data

We present a machine learning framework (GP-NODE) for Bayesian model discovery from partial, noisy and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling and Gaussian Process priors over the observed system states. This allows us to exploit temporal correlations in the observed data, and efficiently infer posterior distributions over plausible models with quantified uncertainty. The use of the Finnish Horseshoe as a sparsity-promoting prior for free model parameters also enables the discovery of parsimonious representations for the latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed GP-NODE method including predator–prey systems, systems biology and a 50-dimensional human motion dynamical system. This article is part of the theme issue ‘Data-driven prediction in dynamical systems’.

Science & Technology - Other Topics↗

Selective-diffusion regularization for enhancement of microcalcifications in digital breast tomosynthesis reconstruction

Purpose: Digital breast tomosynthesis (DBT) has been shown to improve mass detection. Detection of microcalcifications is more challenging because of the large breast volume to be searched for subtle signals. The simultaneous algebraic reconstruction technique (SART) was found to provide good image quality for DBT, but the image noise is amplified with an increasing number of iterations. In this study, the authors developed a selective-diffusion (SD) method for noise regularization with SART to improve the contrast-to-noise ratio (CNR) of microcalcifications in the DBT slices for human or machine detection. Methods: The SD method regularizes SART reconstruction during updating with each projection view. Potential microcalcifications are differentiated from the noisy background by estimating the local gradient information. Different degrees of regularization are applied to the signal or noise classes, such that the microcalcifications will be enhanced while the noise is suppressed. The new SD method was compared to several current methods, including the quadratic Laplacian (QL) method, the total variation (TV) method, and the nonconvex total p-variation (TpV) method for noise regularization with SART. A GE GEN2 prototype DBT system with a stationary digital detector was used for the acquisition of DBT scans at 21 angles in 3 deg. increments over a {+-}30 deg. range. The reconstruction image quality without regularization and that with the different regularization methods were compared using the DBT scans of an American College of Radiology phantom and a human subject. The CNR and the full width at half maximum (FWHM) of the line profiles of microcalcifications within the in-focus DBT slices were used as image quality measures. Results: For the comparison of large microcalcifications in the DBT data of the subject, the SD method resulted in comparable CNR to the nonconvex TpV method. Both of them performed better than the other two methods. For subtle microcalcifications, the SD method was superior to other methods in terms of CNR. In both the subject and phantom DBT data, for large microcalcifications, the FWHM of the SD method was comparable to that without regularization, which was wider than that of the TV type methods. For subtle microcalcifications, the SD method had comparable FWHM values to the TV type methods. All three regularization methods were superior to the QL method in terms of FWHM. Conclusions: The SART regularized by the selective-diffusion method enhanced the CNR and preserved the sharpness of microcalcifications. In comparison with three existing regularization methods, the selective-diffusion regularization was superior to the other methods for subtle microcalcifications.

60 APPLIED LIFE SCIENCES↗

Noise suppression in reconstruction of low-Z target megavoltage cone-beam CT images

Purpose: To improve the image contrast-to-noise (CNR) ratio for low-Z target megavoltage cone-beam CT (MV CBCT) using a statistical projection noise suppression algorithm based on the penalized weighted least-squares (PWLS) criterion. Methods: Projection images of a contrast phantom, a CatPhan{sup Registered-Sign} 600 phantom and a head phantom were acquired by a Varian 2100EX LINAC with a low-Z (Al) target and low energy x-ray beam (2.5 MeV) at a low-dose level and at a high-dose level. The projections were then processed by minimizing the PWLS objective function. The weighted least square (WLS) term models the noise of measured projection and the penalty term enforces the smoothing constraints of the projection image. The variance of projection data was chosen as the weight for the PWLS objective function and it determined the contribution of each measurement. An anisotropic quadratic form penalty that incorporates the gradient information of projection image was used to preserve edges during noise reduction. Low-Z target MV CBCT images were reconstructed by the FDK algorithm after each projection was processed by the PWLS smoothing. Results: Noise in low-Z target MV CBCT images were greatly suppressed after the PWLS projection smoothing, without noticeable sacrifice of the spatial resolution. Depending on the choice of smoothing parameter, the CNR of selected regions of interest in the PWLS processed low-dose low-Z target MV CBCT image can be higher than the corresponding high-dose image.Conclusion: The CNR of low-Z target MV CBCT images was substantially improved by using PWLS projection smoothing. The PWLS projection smoothing algorithm allows the reconstruction of high contrast low-Z target MV CBCT image with a total dose of as low as 2.3 cGy.

60 APPLIED LIFE SCIENCES↗