Search NASA⌕ Search

SEARCH · Search NASA

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

How Many Trip Requests Could We Support? An Activity-Travel Based Vehicle Scheduling Approach

In a world of ever-changing travel behavior and ever-increasing modal options, is vital to have integrated models that could capture the interactions between supply and demand layers of travel. Addressing this need, we propose three different versions of network representation and mathematical models for the activity-based vehicle routing problem to connect activity-travel graphs of passengers (demand layer) to spatio-temporal networks of vehicles (supply layer). Versions I and II are arc-based, while version III is path-based. In version I, we introduce the concept of activity-travel graphs for passengers. For vehicles, we construct space–time networks and add a new dimension, called “under-service state”, to track the execution status of trip requests at any location and time. In version II, we reduce the complexity of the network structure by eliminating the state dimension and some other modifications in the structure of the passengers’ and vehicles’ network. Although both versions can capture various behavioral constraints of the activity-based vehicle routing problem (e.g., mandatory and optimal activities, duration of activities, chain of activities, preferred starting and ending times of activities), due to the high level of complexity of the network structure, both versions can only solve small-sized problems. To tackle the computational complexity, we propose a path-based network representation in version III, and to make a balance between the disutility of passengers and vehicles, we present a tolled user equilibrium problem. Mathematical models are coded in C and GAMS and implemented on real-world Phoenix regional transportation network with more than 39 million trip requests, which demonstrate the effectiveness of the proposed solution for the original and restricted master problems.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Tunable Stochasticity in an Artificial Spin Network

Metamaterials present the possibility of artificially generating advanced functionalities through engineering of their internal structure. Artificial spin networks, in which a large number of nanoscale magnetic elements are coupled together, are promising metamaterial candidates that enable the control of collective magnetic behavior through tuning of the local interaction between elements. In this work, the motion of magnetic domain-walls in an artificial spin network leads to a tunable stochastic response of the metamaterial, which can be tailored through an external magnetic field and local lattice modifications. This type of tunable stochastic network produces a controllable random response exploiting intrinsic stochasticity within magnetic domain-wall motion at the nanoscale. An iconic demonstration used to illustrate the control of randomness is the Galton board. In this system, multiple balls fall into an array of pegs to generate a bell-shaped curve that can be modified via the array spacing or the tilt of the board. A nanoscale recreation of this experiment using an artificial spin network is employed to demonstrate tunable stochasticity. Furthermore, this type of tunable stochastic network opens new paths toward post-Von Neumann computing architectures such as Bayesian sensing or random neural networks, in which stochasticity is harnessed to efficiently perform complex computational tasks.

Artificial spin network↗
DOE OSTI2023

Advanced data analysis in inertial confinement fusion and high energy density physics

Bayesian analysis enables flexible and rigorous definition of statistical model assumptions with well-characterized propagation of uncertainties and resulting inferences for single-shot, repeated, or even cross-platform data. This approach has a strong history of application to a variety of problems in physical sciences ranging from inference of particle mass from multi-source high-energy particle data to analysis of black-hole characteristics from gravitational wave observations. The recent adoption of Bayesian statistics for analysis and design of high-energy density physics (HEDP) and inertial confinement fusion (ICF) experiments has provided invaluable gains in expert understanding and experiment performance. In this Review, we discuss the basic theory and practical application of the Bayesian statistics framework. We highlight a variety of studies from the HEDP and ICF literature, demonstrating the power of this technique. Due to the computational complexity of multi-physics models needed to analyze HEDP and ICF experiments, Bayesian inference is often not computationally tractable. Two sections are devoted to a review of statistical approximations, efficient inference algorithms, and data-driven methods, such as deep-learning and dimensionality reduction, which play a significant role in enabling use of the Bayesian framework. We provide additional discussion of various applications of Bayesian and machine learning methods that appear to be sparse in the HEDP and ICF literature constituting possible next steps for the community. We conclude by highlighting community needs, the resolution of which will improve trust in data-driven methods that have proven critical for accelerating the design and discovery cycle in many application areas.

47 OTHER INSTRUMENTATION↗
DOE OSTI2018

Coupling Exascale Multiphysics Applications: Methods and Lessons Learned

With the growing computational complexity of science and the complexity of new and emerging hardware, it is time to re-evaluate the traditional monolithic design of computational codes. One new paradigm is constructing larger scientific computational experiments from the coupling of multiple individual scientific applications, each targeting their own physics, characteristic lengths, and/or scales. We present a framework constructed by leveraging capabilities such as in-memory communications, workflow scheduling on HPC resources, and continuous performance monitoring. This code coupling capability is demonstrated by a fusion science scenario, where differences between the plasma at the edges and at the core of a device have different physical descriptions. This infrastructure not only enables the coupling of the physics components, but it also connects in situ or online analysis, compression, and visualization that accelerate the time between a run and the analysis of the science content. Results from runs on Titan and Cori are presented as a demonstration.

Choi, Jong Youl↗
DOE OSTI2021

Mechanical coupling in the nitrogenase complex

The enzyme nitrogenase reduces dinitrogen to ammonia utilizing electrons, protons, and energy obtained from the hydrolysis of ATP. Mo-dependent nitrogenase is a symmetric dimer, with each half comprising an ATP-dependent reductase, termed the Fe Protein, and a catalytic protein, known as the MoFe protein, which hosts the electron transfer P-cluster and the active-site metal cofactor (FeMo-co). A series of synchronized events for the electron transfer have been characterized experimentally, in which electron delivery is coupled to nucleotide hydrolysis and regulated by an intricate allosteric network. We report a graph theory analysis of the mechanical coupling in the nitrogenase complex as a key step to understanding the dynamics of allosteric regulation of nitrogen reduction. This analysis shows that regions near the active sites undergo large-scale, large-amplitude correlated motions that enable communications within each half and between the two halves of the complex. Computational predictions of mechanically regions were validated against an analysis of the solution phase dynamics of the nitrogenase complex via hydrogen-deuterium exchange. These regions include the P-loops and the switch regions in the Fe proteins, the loop containing the residue β-188Ser adjacent to the P-cluster in the MoFe protein, and the residues near the protein-protein interface. In particular, it is found that: (i) within each Fe protein, the switch regions I and II are coupled to the [4Fe-4S] cluster; (ii) within each half of the complex, the switch regions I and II are coupled to the loop containing β-188Ser; (iii) between the two halves of the complex, the regions near the nucleotide binding pockets of the two Fe proteins (in particular the P-loops, located over 130 Å apart) are also mechanically coupled. Notably, we found that residues next to the P-cluster (in particular the loop containing β-188Ser) are important for communication between the two halves.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

GraMeR: Gra ph Me ta R einforcement learning for multi-objective influence maximization

Influence maximization (IM) is a combinatorial problem of identifying a subset of seed nodes in a network (graph), which when activated, provide a maximal spread of influence in the network for a given diffusion model and a budget for seed set size. IM has numerous applications such as viral marketing, epidemic control, sensor placement and other network-related tasks. However, its practical uses are limited due to the computational complexity of current algorithms. Recently, deep reinforcement learning has been leveraged to solve IM in order to ease the computational burden. However, there are serious limitations in current approaches, including narrow IM formulation that only consider influence via spread and ignore self-activation, low scalability to large graphs, and lack of generalizability across graph families leading to a large running time for every test network. In this work, we address these limitations through a unique approach that involves: (1) Formulating a generic IM problem as a Markov decision process that handles both intrinsic and influence activations; (2)incorporating generalizability via meta-learning across graph families. There are previous works that combine deep reinforcement learning with graph neural network, but this work solves a more realistic IM problem and incorporates generalizability across graphs via meta reinforcement learning. Extensive experiments are carried out in various standard networks to validate performance of the proposed Graph Meta Reinforcement learning (GraMeR) framework. Finally, the results indicate that GraMeR is multiple orders faster and generic than conventional approaches when applied on small to medium scale graphs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A rotationally invariant approach based on Gutzwiller wave function for correlated electron systems

Here, we introduce a rotationally invariant approach combined with the Gutzwiller conjugate gradient minimization method to study correlated electron systems. In the approach, the Gutzwiller projector is parametrized based on the number of electrons occupying the onsite orbitals instead of the onsite configurations. The approach efficiently groups the onsite orbitals according to their symmetry and greatly reduces the computational complexity, which yields a speedup of $20 \sim 50 \times $ in the minimal basis energy calculation of dimers. The computationally efficient approach promotes more accurate calculations beyond the minimal basis that is inapplicable in the original approach. A large-basis energy calculation of F 2 demonstrates favorable agreements with standard quantum-chemical calculations Bytautas et al (2007 J. Chem. Phys. 127 164317).

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

Data-Driven Nonlinear Subspace Modeling for Prediction and Control of Molten Iron Quality Indices in Blast Furnace Ironmaking

Blast furnace (BF) in ironmaking is a nonlinear dynamic process with complicated physical-chemical reactions, where multi-phase and multi-field coupling and large time delay occur during its operation. In BF operation, the molten iron temperature (MIT) as well as Si, P and S contents of molten iron are the most essential molten iron quality (MIQ) indices, whose measurement, modeling and control have always been important issues in metallurgic engineering and automation field. This paper develops a novel data-driven nonlinear state space modeling for the prediction and control of multivariate MIQ indices by integrating hybrid modeling and control techniques. First, to improve modeling efficiency, a data-driven hybrid method combining canonical correlation analysis and correlation analysis is proposed to identify the most influential controllable variables as the modeling inputs from multitudinous factors would affect the MIQ indices. Then, a Hammerstein model for the prediction of MIQ indices is established using the LS-SVM based nonlinear subspace identification method. Such a model is further simplified by using piecewise cubic Hermite interpolating polynomial method to fit the complex nonlinear kernel function. Compared to the original Hammerstein model, this simplified model can not only significantly reduce the computational complexity, but also has almost the same reliability and accuracy for a stable prediction of MIQ indices. Last, in order to verify the practicability of the developed model, it is applied in designing a genetic algorithm based nonlinear predictive controller for multivariate MIQ indices by directly taking the established model as a predictor. Industrial experiments show the advantages and effectiveness of the proposed approach.

Blast furnace (BF)↗
DOE OSTI2020

Heterogeneous Reconstruction of Tracks and Primary Vertices With the CMS Pixel Tracker

The High-Luminosity upgrade of the Large Hadron Collider (LHC) will see the accelerator reach an instantaneous luminosity of 7 × 10 34 cm −2 s −1 with an average pileup of 200 proton-proton collisions. These conditions will pose an unprecedented challenge to the online and offline reconstruction software developed by the experiments. The computational complexity will exceed by far the expected increase in processing power for conventional CPUs, demanding an alternative approach. Industry and High-Performance Computing (HPC) centers are successfully using heterogeneous computing platforms to achieve higher throughput and better energy efficiency by matching each job to the most appropriate architecture. In this paper we will describe the results of a heterogeneous implementation of pixel tracks and vertices reconstruction chain on Graphics Processing Units (GPUs). The framework has been designed and developed to be integrated in the CMS reconstruction software, CMSSW. The speed up achieved by leveraging GPUs allows for more complex algorithms to be executed, obtaining better physics output and a higher throughput.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2019

Detecting anomalous behavior via user authentication graphs

Significant and aggregate user authentication activity may be analyzed across a population of users and computers in one or more networks to differentiate between authorized users and intruders in a network, and/or to detect inappropriate behavior by otherwise authorized users. Dynamic graphs and graph models over user and computer authentication activity, including time-constrained models, may be used for the purposes of profiling and analyzing user behavior in computer networks. More specifically, an edge-based breadth first search of graphs may be used that enforces time-constraints while maintaining traditional breadth first search computational complexity equivalence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Accelerating geostatistical modeling using geostatistics-informed machine Learning

Ordinary Kriging (OK) is a popular geostatistical algorithm for spatial interpolation and estimation. The computational complexity of OK changes quadratically and cubically for memory and speed, respectively, given the number of data. Therefore, it is computationally intensive and also challenging to process a large set of data, especially in three-dimensional (3D) cases. This paper develops a geostatistics-informed machine learning (GIML) model to improve the efficiency of OK by reducing the number of points required to be estimated using OK. Specifically, only a very few of the unknown points are estimated by OK to get the weights and estimations, which are used as the training dataset. Moreover, the governing equations of OK are used to guide our proposed machine learning to better reproduce the spatial distributions. Our results show that the proposed GIML can reduce the computational time of OK by at least one order of magnitude. The effectiveness of the GIML is evaluated and compared using a 2D case. Furthermore, we demonstrate its efficiency and robustness by considering a different number of training samples on various 3D simulation grids.

58 GEOSCIENCES↗
DOE OSTI2024

Designing multicomponent hydrides with potential high T c superconductivity

While hydrogen-rich materials have been demonstrated to exhibit high T c superconductivity at high pressures, there is an ongoing search for ternary, quaternary, and more chemically complex hydrides that achieve such high critical temperatures at much lower pressures. First-principles searches are impeded by the computational complexity of solving the Eliashberg equations for large, complex crystal structures. Here, we adopt a simplified approach using electronic indicators previously established to be correlated with superconductivity in hydrides. This is used to study complex hydride structures, which are predicted to exhibit promisingly high critical temperatures for superconductivity. In particular, we propose three classes of hydrides inspired by the Fm$\overline{3}$ m RH 3 structures that exhibit strong hydrogen network connectivity, as defined through the electron localization function. The first class [RH 11 X 3 Y] is based on a Pm$\overline{3}$m structure showing moderately high T c , where the T c estimate from electronic properties is compared with direct Eliashberg calculations and found to be surprisingly accurate. The second class of structures [(RH 11 ) 2 X 6 YZ] improves on this with promisingly high density of states with dominant hydrogen character at the Fermi energy, typically enhancing T c . The third class [(R 1 H 11 )(R 2 H 11 )X 6 YZ] improves the strong hydrogen network connectivity by introducing anisotropy in the hydrogen network through a specific doping pattern. These design principles and associated model structures provide flexibility to optimize both T c and the structural stability of complex hydrides.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2019

Uncertainty quantification and propagation in CALPHAD modeling

Design is about making decisions bounded by a quantifiable degree of certainty. In the context of alloy design, Integrated Computational Materials Engineering (ICME) provides the framework whereby performance requirements are ultimately transformed into alloy/processing specifications through the combination of (complex) computational models connecting process-structure-property-performance relationships and experiments. Most ICME approaches consider the models used as deterministic and thus do not provide the means to make alloy design decisions with proper confidence measures. At the root of ICME lie CALPHAD models that describe the thermodynamics and phase stability of phases under specific thermodynamic boundary conditions. To date, the vast majority of efforts within the CALPHAD community have been deterministic in that thermodynamic models and the resulting thermodynamic properties and phase diagram features do not explicitly account for the uncertainties inherent in the model formulation or in the experimental/computational data used. In this contribution, we provide an overview of the state of the field. We review major efforts thus far and we then provide a (brief) tutorial on basic concepts of uncertainty quantification and propagation (UQ/UP) in CALPHAD. We discuss the major features of frequentist and Bayesian interpretations of uncertainty and proceed with a discussion of recent case studies in which UQ has been used to parameterize models for the thermodynamic properties of phases. We follow our discussion by presenting frameworks and demonstrating the propagation of uncertainty in thermodynamic properties and phase diagram predictions and briefly discuss how we can use Bayesian frameworks for rigorous model selection as well as for model fusion. Furthermore, we close our contribution by providing context for what has been done and what remains to be accomplished in order to fully embrace the management of uncertainty in CALPHAD modeling, a foundational element of ICME.

42 ENGINEERING↗
DOE OSTI2019

The Dominant Influencer of Voltage Fluctuation (DIVF) for Power Distribution System

Variability in power generation at multiple consumer owned renewable energy sources can cause random voltage fluctuations, which may result in voltage violations at multiple nodes in a power distribution system. Traditional methods of voltage control are ineffective to address fast voltage variations. New dynamic methods of voltage control using end user devices can significantly benefit from the knowledge of the dominant influencer of voltage fluctuation (DIVF). This paper introduces information theoretic metrics to identify DIVF for every node in the power distribution system. A node can be DIVF due to its location in the distribution system and its capacity to generate and change its power. Use of traditional power flow algorithms to identify the DIVF is computationally complex which limits their use in real-time applications. In this work, information theoretic indicators of the DIVF are computed analytically in a computationally efficient manner, and their effectiveness to identify the DIVF is tested using the IEEE 69 node test system. From simulations, it is illustrated that differential entropy, Kullback-Leibler distance and Frechet distance are effective indicators of the DIVF and can successfully identify the most influential nodes providing the foundation for intelligent voltage control.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction

Several reduced order models have been successfully developed for nonlinear dynamical systems. To achieve a considerable speed-up, a hyper-reduction step is needed to reduce the computational complexity due to nonlinear terms. Many hyper-reduction techniques require the construction of nonlinear term basis, which introduces a computationally expensive offline phase. A novel way of constructing nonlinear term basis within the hyper-reduction process is introduced. In contrast to the traditional hyper-reduction techniques where the collection of nonlinear term snapshots is required, the SNS method avoids collecting the nonlinear term snapshots. Instead, it uses the solution snapshots that are used for building a solution basis, which enables avoiding an extra data compression of nonlinear term snapshots. As a result, the SNS method provides a more efficient offline strategy than the traditional model order reduction techniques, such as the DEIM, GNAT, and ST-GNAT methods. The SNS method is theoretically justified by the conforming subspace condition and the subspace inclusion relation. It is useful for model order reduction of large-scale nonlinear dynamical problems to reduce the offline cost. It is especially useful for ST-GNAT that has shown promising results, such as a good accuracy with a considerable online speed-up for hyperbolic problems in a recent paper by Choi and Carlberg [SIAM J. Sci. Comput., 41 (2019), pp. A26--A58], because ST-GNAT involves an expensive offline cost related to collecting nonlinear term snapshots. Error analysis for the SNS method is presented. Numerical results support that the accuracy of the solution from the SNS method is comparable to the traditional methods and a considerable speed-up (i.e., a factor of two to a hundred) is achieved in the offline phase.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automated Fire Detection for Industrial Settings with Pretrained Convolutional Networks

Early fire detection in industrial environments is critical to preventing equipment damage, personal injury, and operational disruptions. Traditional smoke detectors, while effective, often experience delays due to the time required for smoke to reach sensors, allowing fires to spread. Manual fire watch operations and human surveillance of camera feeds are resource-intensive and prone to human error. To address these challenges, this paper explores the application of convolutional neural networks for automated fire detection, specifically in industrial settings. By leveraging 11 different pre-trained machine vision models from TensorFlow and enhancing them with transfer learning on a custom-built industrial fire dataset, we optimized fire detection performance. Here, we analyzed each machine vision model architecture in terms of its depth, width, and input image resolution, considering both resource requirements and detection accuracy. We further explored the option of combining multiple models into an ensemble classifier to evaluate whether the performance improvements could justify the much greater computational complexity and other practical impacts. A cost-benefit analysis is presented to evaluate the trade-offs between performance and computational expense. Our findings identify that EfficientNetV2L, specifically tailored for industrial applications, provides the optimal balance between costs involved in training and using the model versus the overall fire detection performance. Additionally, we present a qualitative analysis of model performance using the technique of gradient-based class activation mapping to provide explainability by visualizing model decisions.

artificial intelligence↗