Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Topographic hydro-conditioning to resolve surface depression storage and ponding in a fully distributed hydrologic model

Land surface depressions play a central role in the transformation of rainfall to ponding, infiltration and runoff, yet digital elevation models (DEMs) used by spatially distributed hydrologic models that resolve land surface processes rarely capture land surface depressions at spatial scales relevant to this transformation. Methods to generate DEMs through processing of remote sensing data, such as optical and light detection and ranging (LiDAR) have favored surfaces without depressions to avoid adverse slopes that are problematic for many hydrologic routing methods. Here, in this study, we present a new topographic conditioning workflow, Depression-Preserved DEM Processing (D2P) algorithm, which is designed to preserve physically meaningful surface depressions for depression-integrated and efficient hydrologic modeling. D2P includes several features: (1) an adaptive screening interval for delineation of depressions, (2) the ability to filter out anthropogenic land surface features (e.g., bridges), (3) the ability to blend river smoothing (e.g., a general downslope profile) and depression resolving functionality. From a case study in the Goodwin Creek Experimental Watershed, D2P successfully resolved 86% of the ponds at a DEM resolution of 10 m. Topographic conditioning was achieved with minimum impact as D2P reduced the number of modified cells from the original DEM by 51% compared to a conventional algorithm. Furthermore, hydrologic simulation using a D2P processed DEM resulted in a more robust characterization on surface water dynamics based on higher surface water storage as well as an attenuated and delayed peak streamflow.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Lowering post‐construction yield assessment uncertainty through better wind plant power curves

Abstract Many operational analyses of wind power plants require a statistical relationship, which can be called the wind plant power curve, to be developed between wind plant energy production and concurrent atmospheric variables. Currently, a univariate linear regression at monthly resolution is the industry standard for post‐construction yield assessments. Here, we evaluate the benefits in augmenting this conventional approach by testing alternative regressions performed with multiple inputs, at a finer time resolution, and using nonlinear machine‐learning algorithms. We utilize the National Renewable Energy Laboratory's open‐source software package OpenOA to assess wind plant power curves for 10 wind plants. When a univariate generalized additive model at daily or hourly resolution is used, regression uncertainty is reduced, in absolute terms, by up to 1.0 % and 1.2 % (corresponding to a −59 % and −80 % relative change), respectively, compared to a univariate linear regression at monthly resolution; also, a more accurate assessment of the mean long‐term wind plant production is achieved. Additional input variables also reduce the regression uncertainty: when temperature is added as an input to the conventional monthly linear regression, the operational analysis uncertainty connected to regression is reduced, in absolute terms, by up to 0.5 % (−43 % relative change) for wind power plants with strong seasonal variability. Adding input variables to the machine‐learning model at daily resolution can further reduce regression uncertainty, with up to a −10 % relative change. Based on these results, we conclude that a multivariate nonlinear regression at daily or hourly resolution should be recommended for assessing wind plant power curves.

17 WIND ENERGY↗
DOE OSTI2023

High-Impedance Non-Linear Fault Detection via Eigenvalue Analysis with low PMU Sampling Rates

This work presents a hybrid data-driven and physics-based framework for high-impedance fault detection in power systems. An innovative method based on eigenvalue analysis is expanded and validated. Phasor Measurement Unit data is used to estimate eigenvalues corresponding to the powerlines being monitored. The projection and drift of these eigenvalues is then tracked and evaluated. Faults are detected as they drive eigenvalues outside of their normal zones. Eigenvectors are leveraged to support and validate the decisions made by the main algorithm. This technique holds several advantages over contemporary techniques in that it utilizes technology that is already deployed in the field, it offers a significant degree of generality, and so far it has displayed a very high-level of sensitivity without sacrificing accuracy. Validation takes place in the form of simulations in the IEEE 13 Node System considering a popular high-impedance non-linear fault model. Test results are encouraging indicating potential for real-life applications.

Paramo, Gian↗
DOE OSTI2024

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Neutrino oscillations in matter using the adjugate of the Hamiltonian

We revisit neutrino oscillations in constant matter density for a number of different scenarios: three flavors with the standard Wolfenstein matter potential, four flavors with standard matter potential and three flavors with non-standard matter potentials. To calculate the oscillation probabilities for these scenarios one must determine the eigenvalues and eigenvectors of the Hamiltonians. We use a method for calculating the eigenvalues that is well known, determination of the zeros of determinant of matrix (λI - H), where H is the Hamiltonian, I the identity matrix and λ is a scalar. To calculate the associated eigenvectors we use a method that is little known in the particle physics community, the calculation of the adjugate (transpose of the cofactor matrix) of the same matrix, (λI - H). This method can be applied to any Hamiltonian, but provides a very simple way to determine the eigenvectors for neutrino oscillation in matter, independent of the complexity of the matter potential. This method can be trivially automated using the Faddeev–LeVerrier algorithm for numerical calculations. For the above scenarios we derive a number of quantities that are invariant of the matter potential, many are new such as the generalization of the Naumov–Harrison–Scott identity for four or more flavors of neutrinos. We also show how these matter potential independent quantities become matter potential dependent when off-diagonal non-standard matter effects are included.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Gate-based quantum computing for protein design

Protein design is a technique to engineer proteins by permuting amino acids in the sequence to obtain novel functionalities. However, exploring all possible combinations of amino acids is generally impossible due to the exponential growth of possibilities with the number of designable sites. The present work introduces circuits implementing a pure quantum approach, Grover’s algorithm, to solve protein design problems. Our algorithms can adjust to implement any custom pair-wise energy tables and protein structure models. Moreover, the algorithm’s oracle is designed to consist of only adder functions. Quantum computer simulators validate the practicality of our circuits, containing up to 234 qubits. However, a smaller circuit is implemented on real quantum devices. Our results show that using iterations, the circuits find the correct results among all N possibilities, providing the expected quadratic speed up of Grover’s algorithm over classical methods (i.e.,).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

The impact of aerosol mixing state on immersion freezing: insights from classical nucleation theory and particle-resolved simulations

Immersion freezing, initiated by ice-nucleating particles (INPs) in supercooled aqueous droplets, plays an important role in the formation of ice crystals within clouds. The efficiency of immersion freezing depends strongly on INP composition and, crucially, on the mixing state – how chemical species are distributed across the particle population. Here, we quantify the impact of aerosol mixing state on immersion freezing using a combined theoretical and particle-resolved modeling approach. We derive analytical expressions for the frozen fraction of internally and externally mixed INP populations based on classical nucleation theory, showing that the frozen fraction is sensitive to whether ice-active species are present in all particles or only in a subset of the population. We introduce a multi-species immersion freezing scheme into the particle-resolved model PartMC, using the water activity-based immersion freezing model (ABIFM) to compute freezing probabilities for mixed-composition particles. To improve computational efficiency, we implement a Binned Tau-Leaping algorithm and demonstrate an order-of-magnitude speedup with minimal accuracy loss. Simulations reproduce the analytical trends in limiting cases and extend the analysis to more general aerosol populations, where mixing state continues to exert a substantial control on frozen fraction. Sensitivity analyses across particle size, species type, and cooling condition reveal that the mixing state effect is most pronounced when small amounts of highly efficient INPs are mixed with less efficient materials. These findings underscore the need to represent aerosol mixing state explicitly in models of heterogeneous ice nucleation to reduce uncertainty in cloud-phase partitioning.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

FunM2C: A Filter for Uncertainty Visualization of Multivariate Data on Multi-Core Devices

Uncertainty visualization is an emerging research topic in data visualization because neglecting uncertainty in visualization can lead to inaccurate assessments. In this paper, we study the propagation of multivariate data uncertainty in visualization. Although there have been a few advancements in probabilistic uncertainty visualization of multivariate data, three critical challenges remain to be addressed. First, the state-of-the-art probabilistic uncertainty visualization framework is limited to bivariate data (two variables). Second, existing uncertainty visualization algorithms use computationally intensive techniques and lack support for cross-platform portability. Third, as a consequence of the computational expense, integration into production visualization tools is impractical. In this work, we address all three issues and make a threefold contribution. First, we take a step to generalize the state-of-the-art probabilistic framework for bivariate data to multivariate data with an arbitrary number of variables. Second, through utilization of VTK-m’s shared-memory parallelism and cross-platform compatibility features, we demonstrate acceleration of multivariate uncertainty visualization on different many-core architectures, including OpenMP and AMD GPUs. Third, we demonstrate the integration of our algorithms with the ParaView software. We demonstrate the utility of our algorithms through experiments on multivariate simulation data with three and four variables.

Hari, Gautam↗
DOE OSTI2021

Machine-learning accelerated geometry optimization in molecular simulation

Geometry optimization is an important part of both computational materials and surface science because it is the path to finding ground state atomic structures and reaction pathways. These properties are used in the estimation of thermodynamic and kinetic properties of molecular and crystal structures. This process is slow at the quantum level of theory because it involves an iterative calculation of forces using quantum chemical codes such as density functional theory (DFT), which are computationally expensive and which limit the speed of the optimization algorithms. It would be highly advantageous to accelerate this process because then one could do either the same amount of work in less time or more work in the same time. Here, we provide a neural network (NN) ensemble based active learning method to accelerate the local geometry optimization for multiple configurations simultaneously. We illustrate the acceleration on several case studies including bare metal surfaces, surfaces with adsorbates, and nudged elastic band for two reactions. In all cases, the accelerated method requires fewer DFT calculations than the standard method. In addition, we provide an Atomic Simulation Environment (ASE)-optimizer Python package to make the usage of the NN ensemble active learning for geometry optimization easier.

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

Ameliorating the Courant-Friedrichs-Lewy condition in spherical coordinates: A double FFT filter method for general relativistic MHD in dynamical spacetimes

Numerical simulations of merging compact objects and their remnants form the theoretical foundation for gravitational wave and multimessenger astronomy. While Cartesian-coordinate-based adaptive mesh refinement is commonly used for simulations, spherical-like coordinates are more suitable for nearly spherical remnants and azimuthal flows due to lower numerical dissipation in the evolution of fluid angular momentum, as well as requiring fewer numbers of computational cells. However, the use of spherical coordinates to numerically solve hyperbolic partial differential equations can result in severe Courant-Friedrichs-Lewy (CFL) stability condition time step limitations, which can make simulations prohibitively expensive. This paper addresses this issue for the numerical solution of coupled spacetime and general relativistic magnetohydrodynamics evolutions by introducing a double fast Fourier transform (FFT) filter and implementing it within the fully message passing interface (mpi)-parallelized sphericalnr framework in the einstein toolkit. In conclusion, we demonstrate the effectiveness and robustness of the filtering algorithm by applying it to a number of challenging code tests, and show that it passes these tests effectively, demonstrating convergence while also increasing the time step significantly compared to unfiltered simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Multiresolution GPC-Structured Control of a Single-Loop Cold-Flow Chemical Looping Testbed

Chemical looping is a near-zero emission process for generating power from coal. It is based on a multi-phase gas-solid flow and has extremely challenging nonlinear, multi-scale dynamics with jumps, producing large dynamic model uncertainty, which renders traditional robust control techniques, such as linear parameter varying H ∞ design, largely inapplicable. This process complexity is addressed in the present work through the temporal and the spatiotemporal multiresolution modeling along with the corresponding model-based control laws. Namely, the nonlinear autoregressive with exogenous input model structure, nonlinear in the wavelet basis, but linear in parameters, is used to identify the dominant temporal chemical looping process dynamics. The control inputs and the wavelet model parameters are calculated by optimizing a quadratic cost function using a gradient descent method. The respective identification and tracking error convergence of the proposed self-tuning identification and control schemes, the latter using the unconstrained generalized predictive control structure, is separately ascertained through the Lyapunov stability theorem. The rate constraint on the control signal in the temporal control law is then imposed and the control topology is augmented by an additional control loop with self-tuning deadbeat controller which uses the spatiotemporal wavelet riser dynamics representation. The novelty of this work is three-fold: (1) developing the self-tuning controller design methodology that consists in embedding the real-time tunable temporal highly nonlinear, but linearly parametrizable, multiresolution system representations into the classical rate-constrained generalized predictive quadratic optimal control structure, (2) augmenting the temporal multiresolution loop by a more complex spatiotemporal multiresolution self-tuning deadbeat control loop, and (3) demonstrating the effectiveness of the proposed methodology in producing fast recursive real-time algorithms for controlling highly uncertain nonlinear multiscale processes. The latter is shown through the data from the implemented temporal and augmented spatiotemporal solutions of a difficult chemical looping cold flow tracking control problem.

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

Vectorization techniques for probability distribution functions using VecCore

Probability distribution functions (PDFs) are very used in modeling random processes and physics simulations. Improving the performance of algorithms that generate many random numbers under complex PDFs is often a very challenging task when methods as direct functions are not available. In this work we present general strategies on how to vectorize some PDFs using VecCore library. We show the results for the Exponential, Gaussian, discrete Poisson and Gamma probability distributions.

Chaparro Amaro, Oscar R.↗
DOE OSTI2023

Evaluation of Portable Programming Models to Accelerate LArTPC Detector Simulations

The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector responses is essential for analysis algorithm development and physics model interpretations. Accurate LArTPC detector response simulations are computationally demanding, and can become a bottleneck in the analysis workflow. Compute devices such as General-Purpose Graphics Processing Units (GPGPUs) have the potential to substantially accelerate simulations compared to traditional CPU-only processing. The software development for these compute accelerators often carries the cost of specialized code refactorization and porting to match the target hardware architecture. With the rapid evolution and increased diversity of the computer architecture landscape, it is highly desirable to have a portable solution that also maintains reasonable performance. We report our ongoing effort in evaluating Kokkos as a basis for this portable programming model using LArTPC simulations in the context of the Wire-Cell Toolkit, a C++ library for LArTPC simulations, data analysis, reconstruction and visualization.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

A differentiable perturbation-based weak lensing shear estimator

Upcoming imaging surveys will use weak gravitational lensing to study the large-scale structure of the Universe, demanding sub-per cent accuracy for precise cosmic shear measurements. We present a new differentiable implementation of our perturbation-based shear estimator (fpfs), using jax, which is publicly available as part of a new suite of analytic shear algorithms called anacal. This code can analytically calibrate the shear response of any non-linear observable constructed with the fpfs shapelets and detection modes utilizing autodifferentiation (ad), generalizing the formalism to include a family of shear estimators with corrections for detection and selection biases. Using the ad capability of jax, it calculates the full Hessian matrix of the non-linear observables, which improves the previously presented second-order noise bias correction in the shear estimation. As an illustration of the power of the new anacal framework, we optimize the effective galaxy number density in the space of the generalized shear estimators using an LSST-like galaxy image simulation for the 10 yr LSST. For the generic shear estimator, the magnitude of the multiplicative bias |m| is below 3 × 10 –3 (99.7 per cent confidence interval), and the effective galaxy number density is improved by 5 per cent. We also discuss some planned future additions to the anacal software suite to extend its applicability beyond the fpfs measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗