Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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 559 records · Page 31

Iterated upwind schemes for gas dynamics

A class of high-resolution schemes established in integration of anelastic equations is extended to fully compressible flows, and documented for unsteady (and steady) problems through a span of Mach numbers from zero to supersonic. The schemes stem from iterated upwind technology of the multidimensional positive definite advection transport algorithm (MPDATA). The derived algorithms employ standard and modified forms of the equations of gas dynamics for conservation of mass, momentum and either total or internal energy as well as potential temperature. Numerical examples from elementary wave propagation, through computational aerodynamics benchmarks, to atmospheric small- and large-amplitude acoustics with intricate wave-flow interactions verify the approach for both structured and unstructured meshes, and demonstrate its flexibility and robustness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast neutron background characterization with the Radiological Multi-sensor Analysis Platform (RadMAP)

In an effort to characterize the fast neutron radiation background, 16 EJ-309 liquid scintillator cells were installed in the Radiological Multi-sensor Analysis Platform (RadMAP) to collect data in the San Francisco Bay Area. Each fast neutron event was associated with specific weather metrics (pressure, temperature, absolute humidity) and GPS coordinates. Furthermore, the expected exponential dependence of the fast neutron count rate on atmospheric pressure was demonstrated and event rates were subsequently adjusted given the measured pressure at the time of detection. Pressure adjusted data was also used to investigate the influence of other environmental conditions on the neutron background rate. Using National Oceanic and Atmospheric Administration (NOAA) coastal area lidar data, an algorithm was implemented to approximate sky-view factors (the total fraction of visible sky) for points along RadMAPs route. In the three areas we analyzed, San Francisco, Downtown Oakland, and Berkeley, all demonstrated a suppression in the background rate of over 50% for the range of sky-view factors measured. This effect, which is due to the shielding of cosmic-ray produced neutrons by surrounding buildings, was comparable to the pressure influence which yielded a 32% suppression in the count rate over the range of pressures measured.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Calibration of linear contact stiffnesses in discrete element models using a hybrid analytical-computational framework

Efficient selections of particle-scale contact parameters in discrete element modelling remain an open question. The purpose of this study is to provide a hybrid calibration framework to estimate linear contact stiffnesses (normal and tangential) for both two-dimensional and three-dimensional simulations. Analytical formulas linking macroscopic parameters (Young's modulus, Poisson's ratio) to mesoscopic particle parameters for granular systems are derived based on statistically isotropic packings under small-strain isotropic stress conditions. By taking the derived analytical solutions as initial approximations, the gradient descent algorithm automatically obtains a reliable numerical estimation. The introduced framework is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. The results show that this hybrid method practically reduces the time for artificial trials and errors to obtain reasonable stiffness parameters. The proposed framework can also be extended to other parameter calibration problems in DEM.

Calibration method↗

Combining Wave Function Methods with Density Functional Theory for Excited States

Here, we review state-of-the-art electronic structure methods based both on wave function theory (WFT) and density functional theory (DFT). Strengths and limitations of both the wave function and density functional based approaches are discussed, and modern attempts to combine these two methods are presented. The challenges in modeling excited-state chemistry using both single-reference and multireference methods are described. Topics covered include background, combining density functional theory with single-configuration wave function theory, generalized Kohn–Sham (KS) theory, global hybrids, range-separated hybrids, local hybrids, using KS orbitals in many-body theory (including calculations of the self-energy and the GW approximation), Bethe–Salpeter equation, algorithms to accelerate GW calculations, combining DFT with multiconfigurational WFT, orbital-dependent correlation functionals based on multiconfigurational WFT, building multiconfigurational wave functions from KS configurations, adding correlation functionals to multiconfiguration self-consistent-field (MCSCF) energies, combining DFT with configuration-interaction singles by means of time-dependent DFT, using range separation to combine DFT with MCSCF, embedding multiconfigurational WFT in DFT, and multiconfiguration pair-density functional theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Proof-of-concept of a reinforcement learning framework for wind farm energy capture maximization in time-varying wind

Here, we present a proof-of-concept distributed reinforcement learning framework for wind farm energy capture maximization. The algorithm we propose uses Q-Learning in a wake-delayed wind farm environment and considers time-varying, though not yet fully turbulent, wind inflow conditions. These algorithm modifications are used to create the Gradient Approximation with Reinforcement Learning and Incremental Comparison (GARLIC) framework for optimizing wind farm energy capture in time-varying conditions, which is then compared to the FLOw Redirection and Induction in Steady State (FLORIS) static lookup table wind farm controller baseline.

17 WIND ENERGY↗

Asymptotic errors in adiabatic evolution

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved Hamiltonian. Understanding corrections to the adiabatic result that arise when the evolution of the Hamiltonian is slow—but not arbitrarily slow—has become increasingly important, especially since adiabatic evolution has been proposed as a method of state preparation in quantum computing. Here, this paper identifies two regimes, an adiabatic regime in which corrections are generically small and can depend on details of the evolution throughout the path, and a hyperadiabatic regime in which the error is given by a form similar to an asymptotic expansion in the inverse of the evolution time with the coefficients depending principally on the behavior at the endpoints. However, the error in this hyperadiabatic regime is neither given by a true asymptotic series nor solely dependent on the endpoints: the coefficients combine the contributions from both endpoints, with relative phase factors that depend on the average spectral gaps along the trajectory, multiplied by the evolution time. The central result of this paper is to identify a quantity, referred to as the typical error, which is obtained by appropriately averaging the error over evolution times that are small compared to the evolution time itself. This typical error is characterized by an asymptotic series and depends solely on the endpoints of the evolution, remaining independent of the details of the intermediate evolution.

adiabatic approximation↗

Parallel variable selection for effective performance prediction

Large data analysis problems often involve a large number of variables, and the corresponding analysis algorithms may examine all variable combinations to find the optimal solution. For example, to model the time required to complete a scientific workflow, we need to consider the impact of dozens of parameters. To reduce the model building time and reduce the likelihood of overfitting, we look to variable selection methods to identify the critical variables for the performance model. In this work, we create a combination of variable selection and performance prediction methods that is as effective as the exhaustive search approach when the exhaustive search could be completed in a reasonable amount of time. To handle the cases where the exhaustive search is too time consuming, we develop the parallelized variable selection algorithm. Additionally, we develop a parallel grouping mechanism that further reduces the variable selection time by 70%.As a case study, we exercise the variable selection technique with the performance measurement data from the Palomar Transient Factory (PTF) workflow. The application scientists have determined that about 50 variables and parameters are important to the performance of the workflows. Our tests show that the Sequential Backward Selection algorithm is able to approximate the optimal subset relatively quickly. By reducing the number of variables used to build the model from 50 to 4, we are able to maintain the prediction quality while reducing the model building time by a factor of 6. Using the parallelization and grouping techniques we developed in this work, the variable selection process was reduced from over 18 hours to 15 minutes while ending up with the same variable subset.

Wang, J↗

Model-based Assessment for Balancing Privacy Requirements and Operational Capabilities

The smart grid changes the way energy is produced and distributed. In addition both, energy and information is exchanged bidirectionally among participating parties. Therefore heterogeneous systems have to cooperate effectively in order to achieve a common high-level use case, such as smart metering for billing or demand response for load curtailment. Furthermore, a substantial amount of personal data is often needed for achieving that goal. Capturing and processing personal data in the smart grid increases customer concerns about privacy and in addition, certain statutory and operational requirements regarding privacy aware data processing and storage have to be met. An increase of privacy constraints, however, often limits the operational capabilities of the system. In this paper, we present an approach that automates the process of finding an optimal balance between privacy requirements and operational requirements in a smart grid use case and application scenario. This is achieved by formally describing use cases in an abstract model and by finding an algorithm that determines the optimum balance by forward mapping privacy and operational impacts. For this optimal balancing algorithm both, a numeric approximation and – if feasible – an analytic assessment are presented and investigated. The system is evaluated by applying the tool to a real-world use case from the University of Southern California (USC) microgrid.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Efficient Delaunay Tessellation through K-D Tree Decomposition

Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.

Morozov, Dmitriy↗

Accuracy of Some Approximate Gaussian Filters for the Navier--Stokes Equation in the Presence of Model Error

Bayesian state estimation of a dynamical system from a stream of noisy measurements is important in many geophysical and engineering applications where high dimensionality of the state space, sparse observations, and model error pose key challenges. In this work, three computationally feasible, approximate Gaussian data assimilation/filtering algorithms are considered in various regimes of turbulent 2D Navier--Stokes dynamics in the presence of model error. The first source of error arises from the necessary use of reduced models for the forward dynamics of the filters, while a particular type of representation error arises from the finite resolution of observations which mix up information about resolved and unresolved dynamics. Two stochastically parameterized filtering algorithms, referred to as cSPEKF and GCF, are compared with 3DVAR---a prototypical time-sequential algorithm known to be accurate for filtering dissipative systems for a suitably inflated “background” covariance. We provide the first evidence that the stochastically parameterized algorithms, which do not rely on detailed knowledge of the underlying dynamics and do not require covariance inflation, can compete with or outperform an optimally tuned 3DVAR algorithm, and they can overcome competing sources of error in a range of dynamical scenarios.

97 MATHEMATICS AND COMPUTING↗

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗

Real-time time-dependent density functional theory in Quantum Espresso and related codes

A set of subroutines that interact with an existing computer program, Quantum Espresso (QE), that takes a set of electronic orbitals from QE and propagates them forward in time in response to a number of perturbations. These perturbations include the motion of ions and a wide spectrum of applied electromagnetic fields (e.g., static magnetic fields, slowly-varying electric fields, x-rays, etc.). From the time evolution of the electronic orbitals comes time-varying values of physical observables like the electronic charge and current densities and atomic forces. These are further post-processed to yield properties of interest like stopping powers, conductivities, and the dynamic structure factor. The electronic orbitals are described in a plane wave basis and the equations of motion are carried out using a unitary or approximately unitary time propagation algorithm. Related work will include subroutines for interfacing this capability, as well as others that already exist within QE, with a fork of QE that is more extensible and modular.SAND2019-12611 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Baczewski, Andrew↗

Statistically significant relational data mining :

This report summarizes the work performed under the project (3z(BStatitically significant relational data mining.(3y (BThe goal of the project was to add more statistical rigor to the fairly ad hoc area of data mining on graphs. Our goal was to develop better algorithms and better ways to evaluate algorithm quality. We concetrated on algorithms for community detection, approximate pattern matching, and graph similarity measures. Approximate pattern matching involves finding an instance of a relatively small pattern, expressed with tolerance, in a large graph of data observed with uncertainty. This report gathers the abstracts and references for the eight refereed publications that have appeared as part of this work. We then archive three pieces of research that have not yet been published. The first is theoretical and experimental evidence that a popular statistical measure for comparison of community assignments favors over-resolved communities over approximations to a ground truth. The second are statistically motivated methods for measuring the quality of an approximate match of a small pattern in a large graph. The third is a new probabilistic random graph model. Statisticians favor these models for graph analysis. The new local structure graph model overcomes some of the issues with popular models such as exponential random graph models and latent variable models.

Berry, Jonathan W.↗

High Fidelity Simulations of Large-Scale Wireless Networks (Part I)

Wireless systems and networks have experienced rapid growth over the last decade with the advent of smart devices for everyday use. These systems, which include smartphones, vehicular gadgets, and internet-of-things devices, are becoming ubiquitous and ever-more important. They pose interesting research challenges for design and analysis of new network protocols due to their large scale and complexity. In this work, we focus on the challenging aspect of simulating the inter-connectivity of many of these devices in wireless networks. The quantitative study of large scale wireless networks, with counts of wireless devices in the thousands, is a very difficult problem with no known acceptable solution. By necessity, simulations of this scale have to approximate reality, but the algorithms employed in most modern-day network simulators can be improved for wireless network simulations. In this report, we present advances that we have made and propositions for continuation of progress towards a framework for high fidelity simulations of wireless networks. This work is not complete in that a final simulation framework tool is yet to be produced. However, we highlight the major bottlenecks and address them individually with initial results showing enough promise.

42 ENGINEERING↗

Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

97 MATHEMATICS AND COMPUTING↗

Case Study: NREL Campus Chilled Water Storage Potential: Benchmark Datasets Development and Applications, Task 4 - Use Case Demonstration

The Benchmark Datasets Development and Applications project is a three-year collaboration between the National Renewable Energy Laboratory (NREL), Oak Ridge National Laboratory, Pacific Northwest National Laboratory, and Lawrence Berkeley National Laboratory. The project seeks to collect and curate high-resolution, well-calibrated time series of building operational and indoor/outdoor environmental data, which are crucial to understanding and optimizing building energy efficiency performance and demand flexibility capabilities as well as benchmarking energy algorithms. Project outcomes include approximately twelve high-fidelity building datasets, enhanced data representation tools, and four case studies to illustrate example applications. The goal of these case studies is to define and execute analyses that demonstrate how one or more datasets collected through this project can address a data gap or challenge historically faced by building stakeholders. This technical paper summarizes the findings of one of these case studies, in which we studied the operational efficiencies of the central cooling system at NREL. We looked at three years of data from the three chillers in the Field Test Laboratory Building (FTLB), from 2019 to 2021, to compare equipment operation and demand throughout the time period. Our analysis indicates that all three chillers are operating at or below the optimal loading conditions for most of the operation time, and thus there was no efficiency drop due to loading of the chillers at full capacity. Our recommendation is that no chiller capacity increase is needed; instead, the central plant could benefit from adopting advanced control logics for optimal sequencing of chillers during part load operations. Analysis of adding chilled water thermal storage to the central plant indicated 34% savings in demand cost and 24.5% savings in total cost (energy consumption and demand charge cost). The payback period is estimated to be 11-22 years with an assumed TES cost of $\$$100-$200 per ton. This case study shows how a selected dataset is used to solve a practical building problem - learning the operational status of its components, analyzing the effectiveness of a proposed new technique, and aiding decision-making for the building operations and maintenance team.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model

Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗