Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Quantum Chemistry Common Driver and Databases (QCDB) and Quantum Chemistry Engine (QCEngine): Automation and interoperability among computational chemistry programs

We report that community efforts in the computational molecular sciences (CMS) are evolving toward modular, open, and interoperable interfaces that work with existing community codes to provide more functionality and composability than could be achieved with a single program. The Quantum Chemistry Common Driver and Databases (QCDB) project provides such capability through an application programming interface (API) that facilitates interoperability across multiple quantum chemistry software packages. In tandem with the Molecular Sciences Software Institute and their Quantum Chemistry Archive ecosystem, the unique functionalities of several CMS programs are integrated, including CFOUR, GAMESS, NWChem, OpenMM, Psi4, Qcore, TeraChem, and Turbomole, to provide common computational functions, i.e., energy, gradient, and Hessian computations as well as molecular properties such as atomic charges and vibrational frequency analysis. Both standard users and power users benefit from adopting these APIs as they lower the language barrier of input styles and enable a standard layout of variables and data. These designs allow end-to-end interoperable programming of complex computations and provide best practices options by default.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1983

Recent developments in thermal analysis of large space structures

A numerical procedure for analysis of shadowed space heating of sparse structures, SSQ, is discussed. The SSQ program avoids inordinate computational complexity by confining attention to a single elemental location on a structural member of interest throughout an entire orbital period, proceeding then to similar treatment of individual alternate locations. The procedure considers a spacecraft in circular orbit and assumes fixed-Earth orientation of the spacecraft. Shadow orientation and interval duration, merged shadows, and computation of solar heat flux and thermal response are addressed. The output options of the SSQ FORTRAN 5 program and its efficiency are discussed. Application of the system to the analysis of a parabolic expandable truss antenna is considered.

Oneill, R. F.↗
NASA NTRS1993

The methodology of multi-viewpoint clustering analysis

One of the greatest challenges facing the software engineering community is the ability to produce large and complex computer systems, such as ground support systems for unmanned scientific missions, that are reliable and cost effective. In order to build and maintain these systems, it is important that the knowledge in the system be suitably abstracted, structured, and otherwise clustered in a manner which facilitates its understanding, manipulation, testing, and utilization. Development of complex mission-critical systems will require the ability to abstract overall concepts in the system at various levels of detail and to consider the system from different points of view. Multi-ViewPoint - Clustering Analysis MVP-CA methodology has been developed to provide multiple views of large, complicated systems. MVP-CA provides an ability to discover significant structures by providing an automated mechanism to structure both hierarchically (from detail to abstract) and orthogonally (from different perspectives). We propose to integrate MVP/CA into an overall software engineering life cycle to support the development and evolution of complex mission critical systems.

Mehrotra, Mala↗
DOE OSTI2022

GronOR: Scalable and Accelerated Nonorthogonal Configuration Interaction for Molecular Fragment Wave Functions

GronOR is a program package for nonorthogonal configuration interaction calculations. Electronic wave functions are constructed in terms of antisymmetrized products of multiconfiguration molecular fragment wave functions. The computational complexity of the nonorthogonal methodologies implemented in GronOR applied to large molecular assemblies requires a design that takes full advantage of massively parallel supercomputer architectures and accelerator technologies. This work describes the implementation strategy and resulting performance characteristics. In addition to parallelization and acceleration, the software development strategy includes aspects of fault resiliency and heterogeneous computing. The program was designed for large-scale supercomputers but also runs effectively on small clusters and workstations for small molecular systems. GronOR is available as open source to the scientific community.

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

Superior model for fault tolerance computation in designing nano-sized circuit systems

As CMOS technology scales nano-metrically, reliability turns out to be a decisive subject in the design methodology of nano-sized circuit systems. As a result, several computational approaches have been developed to compute and evaluate reliability of desired nano-electronic circuits. The process of computing reliability becomes very troublesome and time consuming as the computational complexity build ups with the desired circuit size. Therefore, being able to measure reliability instantly and superiorly is fast becoming necessary in designing modern logic integrated circuits. For this purpose, the paper firstly looks into the development of an automated reliability evaluation tool based on the generalization of Probabilistic Gate Model (PGM) and Boolean Difference-based Error Calculator (BDEC) models. The Matlab-based tool allows users to significantly speed-up the task of reliability analysis for very large number of nano-electronic circuits. Secondly, by using the developed automated tool, the paper explores into a comparative study involving reliability computation and evaluation by PGM and, BDEC models for different implementations of same functionality circuits. Based on the reliability analysis, BDEC gives exact and transparent reliability measures, but as the complexity of the same functionality circuits with respect to gate error increases, reliability measure by BDEC tends to be lower than the reliability measure by PGM. The lesser reliability measure by BDEC is well explained in this paper using distribution of different signal input patterns overtime for same functionality circuits. Simulation results conclude that the reliability measure by BDEC depends not only on faulty gates but it also depends on circuit topology, probability of input signals being one or zero and also probability of error on signal lines.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

ν-point energy correletors with F AST EEC: Small-x physics from LHC jets

In recent years, energy correlators have emerged as a powerful tool for studying jet substructure, with promising applications such as probing the hadronization transition, analyzing the quark-gluon plasma, and improving the precision of top quark mass measurements. The projected N-point correlator measures correlations between N final-state particles by tracking the largest separation between them, showing a scaling behavior related to DGLAP splitting functions. These correlators can be analytically continued in N, commonly referred to as ν-correlators, allowing access to non-integer moments of the splitting functions. Of particular interest is the ν → 0 limit, where the small momentum fraction behavior of the splitting functions requires resummation. Originally, the computational complexity of evaluating ν-correlators for M particles scaled as 2 2M , making it impractical for real-world analyses. However, by using recursion, we reduce this to M 2M , and through the FastEEC method of dynamically resolving subjets, M is replaced by the number of subjets. This breakthrough enables, for the first time, the computation of ν-correlators for LHC data. In practice, limiting the number of subjets to 16 is sufficient to achieve percent-level precision, which we validate using known integer-ν results and convergence tests for non-integer ν. We have implemented this in an update to FastEEC and conducted an initial study of power-law scaling in the perturbative regime as a function of ν, using CMS Open Data on jets. The results agree with DGLAP evolution, except at small ν, where the anomalous dimension saturates to a value that matches the BFKL anomalous dimension.

Energy correlators↗
NASA NTRS2021

Near-Optimum Real-Time Range Estimation Algorithms for Proximity Links

The renewed interest in space exploration and cis-lunar situational awareness demands accurate ranging algorithms to enable navigation solutions for a multitude of spacecraft, rovers, and human explorers on the Moon and even on Mars, in the near future. Current state-of-the-art in ground-based ranging accuracy is on the order of 30 cm, however complicated equipment calibration and significant post-processing is required to achieve this level of ranging accuracy. This article examines ad-hoc approaches that achieve near-optimum real-time ranging performance with reduced complexity by utilizing a DPLL (digital phase-locked loop) to track the phase of the residual carrier for both direct and subcarrier modulated PN sequences, and a DCL (digital Costas loop) to obtain independent estimates of carrier phase and optimal combinations of these implementations to achieve near-optimum real-time performance with reduced computational complexity.

Cheung, Kar-Ming↗
DOE OSTI2021

QUBO formulations for training machine learning models

Abstract Training machine learning models on classical computers is usually a time and compute intensive process. With Moore’s law nearing its inevitable end and an ever-increasing demand for large-scale data analysis using machine learning, we must leverage non-conventional computing paradigms like quantum computing to train machine learning models efficiently. Adiabatic quantum computers can approximately solve NP-hard problems, such as the quadratic unconstrained binary optimization (QUBO), faster than classical computers. Since many machine learning problems are also NP-hard, we believe adiabatic quantum computers might be instrumental in training machine learning models efficiently in the post Moore’s law era. In order to solve problems on adiabatic quantum computers, they must be formulated as QUBO problems, which is very challenging. In this paper, we formulate the training problems of three machine learning models—linear regression, support vector machine (SVM) and balanced k-means clustering—as QUBO problems, making them conducive to be trained on adiabatic quantum computers. We also analyze the computational complexities of our formulations and compare them to corresponding state-of-the-art classical approaches. We show that the time and space complexities of our formulations are better (in case of SVM and balanced k-means clustering) or equivalent (in case of linear regression) to their classical counterparts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Optimizing Kernel Machines Using Deep Learning

Building highly non-linear and non-parametric models is central to several state-of-the-art machine learning systems. Kernel methods form an important class of techniques that induce a reproducing kernel Hilbert space (RKHS) for inferring non-linear models through the construction of similarity functions from data. These methods are particularly preferred in cases where the training data sizes are limited and when prior knowledge of the data similarities is available. Despite their usefulness, they are limited by the computational complexity and their inability to support end-to-end learning with a task specific objective. On the other hand, deep neural networks have become the de facto solution for end-to-end inference in several learning paradigms. In this article, we explore the idea of using deep architectures to perform kernel machine optimization, for both computational efficiency and end-to-end inferencing. To this end, we develop the DKMO (Deep Kernel Machine Optimization) framework, that creates an ensemble of dense embeddings using Nystrõm kernel approximations and utilizes deep learning to generate task-specific representations through the fusion of the embeddings. Intuitively, the filters of the network are trained to fuse information from an ensemble of linear subspaces in the RKHS. Furthermore, we introduce the kernel dropout regularization to enable improved training convergence. Finally, we extend this framework to the multiple kernel case, by coupling a global fusion layer with pre-trained deep kernel machines for each of the constituent kernels. Using case studies with limited training data, and lack of explicit feature sources, we demonstrate the effectiveness of our framework over conventional model inferencing techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Distributed Halide

Many image processing tasks are naturally expressed as a pipeline of small computational kernels known as stencils. Halide is a popular domain-specific language and compiler designed to implement image processing algorithms. Halide uses simple language constructs to express what to compute and a separate scheduling co-language for expressing when and where to perform the computation. This approach has demonstrated performance comparable to or better than hand-optimized code. Until now, however, Halide has been restricted to parallel shared memory execution, limiting its performance for memory-bandwidth-bound pipelines or large-scale image processing tasks. We present an extension to Halide to support distributed-memory parallel execution of complex stencil pipelines. These extensions compose with the existing scheduling constructs in Halide, allowing expression of complex computation and communication strategies. Existing Halide applications can be distributed with minimal changes, allowing programmers to explore the tradeoff between recomputation and communication with little effort. Approximately 10 new of lines code are needed even for a 200 line, 99 stage application. On nine image processing benchmarks, our extensions give up to a 1.4× speedup on a single node over regular multithreaded execution with the same number of cores, by mitigating the effects of non-uniform memory access. The distributed benchmarks achieve up to 18× speedup on a 16 node testing machine and up to 57× speedup on 64 nodes of the NERSC Cori supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

DG2DAG: Learning Directed Acyclic Graphs from Functional Priors

Physics-based systems-of-systems models are computationally expensive. Reduced graphical models can decrease computational complexity, but may not proffer an end-to-end model from upstream inputs to downstream outputs. We consequently are interested in reducing models on directed graphs to models on a directed acyclic subgraph such that preserves accurate reconstruction of nodes. The consequence is a model with a topological ordering, providing a one-way flow of computation, and a causal interpr

Voronin, Alexey [Sandia National Laboratories (SNL↗
DOE OSTI2017

Acceleration of diffusive molecular dynamics simulations through mean field approximation and subcycling time integration

Highlights: • Two numerical methods are presented to accelerate DMD simulations. • The methods greatly reduce the computation time without much loss of accuracy. • The accelerated DMD model is capable of simulating long-term mass transport at atomistic length scales. • Demonstrated for the propagation of an atomically sharp phase boundary over 30 seconds. - Abstract: Diffusive Molecular Dynamics (DMD) is a class of recently developed computational models for the simulation of long-term diffusive mass transport at atomistic length scales. Compared to previous atomistic models, e.g., transition state theory based accelerated molecular dynamics, DMD allows the use of larger time-step sizes, but has a higher computational complexity at each time-step due to the need to solve a nonlinear optimization problem at every time-step. This paper presents two numerical methods to accelerate DMD based simulations. First, we show that when a many-body potential function, e.g., embedded atom method (EAM), is employed, the cost of DMD is dominated by the computation of the mean of the potential function and its derivatives, which are high-dimensional random variables. To reduce the cost, we explore both first- and second-order mean field approximations. Specifically, we show that the first-order approximation, which uses a point estimate to calculate the mean, can reduce the cost by two to three orders of magnitude, but may introduce relatively large error in the solution. We show that adding an approximate second-order correction term can significantly reduce the error without much increase in computational cost. Second, we show that DMD can be significantly accelerated through subcycling time integration, as the cost of integrating the empirical diffusion equation is much lower than that of the optimization solver. To assess the DMD model and the numerical approximation methods, we present two groups of numerical experiments that simulate the diffusion of hydrogen in palladium nanoparticles. In particular, we show that the computational framework is capable of capturing the propagation of an atomically sharp phase boundary over a time window of more than 30 seconds. The effects of the proposed numerical methods on solution accuracy and computation time are also assessed quantitatively.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Efficient Optimization of Energy Recovery From Geothermal Reservoirs With Recurrent Neural Network Predictive Models

Improving the long-term energy production performance of geothermal reservoirs can be accomplished by optimizing field development and management plans. Reliable prediction models, however, are needed to evaluate and optimize the performance of the underlying reservoirs under various operation and development strategies. In traditional frameworks, physics-based simulation models are used to predict the energy production performance of geothermal reservoirs. However, detailed simulation models are not trivial to construct, require a reliable description of the reservoir conditions and properties, and entail high computational complexity. Data-driven predictive models can offer an efficient alternative for use in optimization workflows. This paper presents an optimization framework for net power generation in geothermal reservoirs using a variant of the recurrent neural network (RNN) as a data-driven predictive model. The RNN architecture is developed and trained to replace the simulation model for computationally efficient prediction of the objective function and its gradients with respect to the well control variables. The net power generation performance of the field is optimized by automatically adjusting the mass flow rate of production and injection wells over 12 years, using a gradient-based local search algorithm. Two field-scale examples are presented to investigate the performance of the developed data-driven prediction and optimization framework. Furthermore, the prediction and optimization results from the RNN model are evaluated through comparison with the results obtained by using a numerical simulation model of a real geothermal reservoir.

15 GEOTHERMAL ENERGY↗
DOE OSTI2022

An Information Theoretic Approach to Identify Dominant Voltage Influencers for Unbalanced Distribution Systems

Smart distribution grid with multiple renewable energy sources can experience random voltage fluctuations due to variable generation, which may result in voltage violations. Traditional voltage control algorithms are inadequate to handle fast voltage variations. Therefore, new dynamic control methods are being developed that can significantly benefit from the knowledge of dominant voltage influencer (DVI) nodes. DVI nodes for a particular node of interest refer to nodes that have a relatively high impact on the voltage fluctuations at that node. Conventional power flow-based algorithms to identify DVI nodes are computationally complex, which limits their use in real-time applications. This paper proposes a novel information theoretic voltage influencing score (VIS) that quantifies the voltage influencing capacity of nodes with DERs/active loads in a three phase unbalanced distribution system. VIS is then employed to rank the nodes and identify the DVI set. VIS is derived analytically in a computationally efficient manner and its efficacy to identify DVI nodes is validated using the IEEE 37-node test system. It is shown through experiments that KL divergence and Bhattacharyya distance are effective indicators of DVI nodes with an identifying accuracy of more than 90%. Additionally, the computation burden is also reduced by an order of 5, thus providing the foundation for efficient voltage control.

42 ENGINEERING↗
DOE OSTI2022

Validation and parameterization of a novel physics-constrained neural dynamics model applied to turbulent fluid flow

We report, in fluid physics, data-driven models to enhance or accelerate time to solution are becoming increasingly popular for many application domains, such as alternatives to turbulence closures, system surrogates, or for new physics discovery. In the context of reduced order models of high-dimensional time-dependent fluid systems, machine learning methods grant the benefit of automated learning from data, but the burden of a model lies on its reduced-order representation of both the fluid state and physical dynamics. In this work, we build a physics-constrained, data-driven reduced order model for Navier–Stokes equations to approximate spatiotemporal fluid dynamics in the canonical case of isotropic turbulence in a triply periodic box. The model design choices mimic numerical and physical constraints by, for example, implicitly enforcing the incompressibility constraint and utilizing continuous neural ordinary differential equations for tracking the evolution of the governing differential equation. We demonstrate this technique on a three-dimensional, moderate Reynolds number turbulent fluid flow. In assessing the statistical quality and characteristics of the machine-learned model through rigorous diagnostic tests, we find that our model is capable of reconstructing the dynamics of the flow over large integral timescales, favoring accuracy at the larger length scales. More significantly, comprehensive diagnostics suggest that physically interpretable model parameters, corresponding to the representations of the fluid state and dynamics, have attributable and quantifiable impact on the quality of the model predictions and computational complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Wind Farm Layout Optimization with Loads Considerations

The objective of this paper is to improve the annual energy production of a wind farm by optimizing the layout of a wind farm, while considering fatigue loads on turbines. In this paper, the loads are estimated using the edgewise bending moment computed using CCBlade, a steady-state blade element momentum code. The edgewise bending moment is then used to calculate fatigue damage using Miner's rule. The fatigue damage is used to constrain the layout optimization problem. We show that our method can predict blade root damage with similar trends to damage calculated with other methods, such as a complex, computationally expensive large-eddy simulation and unsteady aeroelastic code. We also optimize wind farm layouts and show that, for a simple problem with two wind directions and ten turbines, the fatigue damage can be constrained without sacrificing wind farm power production.

17 WIND ENERGY↗
DOE OSTI2021

Sensor enabled data-driven predictive analytics for modeling and control with high penetration of DERs in distribution systems

The electric power grid is undergoing a tremendous transformation due to the increasing penetration of renewable energy resources beginning with wind and more recently with the distributed energy resources (DERs) such as solar and battery storage. DERs have dramatically changed the role of the distribution systems in the overall power grid, and they are expected to contribute a significant portion of power generation in the future. If current trends for DERs continue, system operation and control will need to change dramatically for improved grid reliability and resiliency. As renewable resources increase in penetration, new and challenging operational, planning, and design problems are expected to emerge. Some of the key challenges that arise in the planning and operation of the future grid are: 1) Quantifying the impact of high DER penetration in distribution systems on bulk grid behavior over multiple time scales. 2) Identifying whether a particular DER configuration/settings have a large impact on the overall grid behavior. These challenges can be addressed in an offline manner using detailed T&D grid models and they can also be addressed in an online manner using sensor measurements. In particular, the advancement and planned growth in sensor technology in power grid over various voltage levels provide us with a unique opportunity to tackle these challenges from a data analytic perspective without needing detailed T&D grid models. A few questions that naturally arise when addressing the challenges from DERs using sensor data are: 1) How can we use limited sensor measurements to monitor & control voltage stability and small signal stability of the bulk system? 2) How can we ensure that the developed data analytic methods are robust to data availability and quality issues? 3) How can we compute the developed analytics in a scalable manner using streaming measurements? In this project, we addressed the aforementioned challenges arising from DERs and answered the questions raised above on how to effectively use the sensor measurements to enhance the reliability and performance of the electric grid. Thus, the overarching goal of this project is to develop effective reduced/representative system models from data that make the computational complexity sufficiently manageable so as to be useful to simulate, analyze, and even control complex non-linear power systems dynamics with large penetrations of DERs. In order to achieve the objective, the project team established a four-fold technical approach 1) Formulated a combined transmission-distribution co-simulation framework for data generation and validation, 2) Derived reduced/representative models of power systems based on data-driven methods for efficient computation and appropriate representation of system behavior, 3) Developed data driven characterization of power system behavior based on transfer operator theory, machine learning and optimization for model estimation, 4) Incorporated a scalable data management and processing architecture using distributed Kafka streaming applications that coordinate input data streams to the developed data analytics. The key accomplishments of the project are: 1) Development of a scalable multi-timescale T&D co-simulation framework (both for steady state and for dynamic co-simulation) using commercial solvers (PSSE and GridLAB-D). The steady-state T&D co-simulation interface is shared with our industry partner (PJM). 2) A structured reduced order dynamic model of distribution systems that can represent partial motor stalling along with a systematic procedure to derive the model parameters. 3) A PMU based online method to monitor, localize and mitigate fault-induced delayed voltage recovery using DER reactive support and load control in distribution systems. 4) Development of linear operator based robust methodologies for dynamic state estimation, uncertainty quantification, system identification and trajectory prediction for power system dynamics. 5) An adaptive damping control for utilizing wind energy resources to provide oscillation damping and system stability. 6) Implementation of Kafka-based framework for efficient processing of streaming data using Linux-based local virtual environment.

DER integration↗
DOE OSTI2025

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗