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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Deep Learning-based Surrogate Model for Efficient Reservoir Simulation in Large-scale Geological Carbon Storage: Application in IBDP Dataset

This project introduces an advanced deep learning (DL)-based surrogate modeling approach to enhance the efficiency and accuracy of large-scale geological carbon storage (GCS) simulations. Using the Illinois Basin Decatur Project (IBDP) dataset as training data, the study employs a residual U-Net architecture to predict critical state variables such as pressure and CO₂ saturation, as well as CO₂ plume migration. By incorporating key geological parameters (e.g., porosity, permeability, and rock facies) and physics-informed inputs like the diffusive time of flight and time step, the DL model effectively reduces computational complexity while maintaining robust physical constraints. Compared to traditional simulators like Eclipse, the DL model achieves remarkable accuracy, with a root mean square error (RMSE) of 1.57 psi for pressure and 0.007 for saturation, and dramatically reduces computational time from hours to just 69.9 seconds for 50-step simulations. These results demonstrate the potential of innovative DL methodologies to improve the predictivity and operational efficiency of GCS simulations, providing a reliable foundation for decision-making in CCS operations. Supported by the SMART initiative, this project underscores the success of leveraging computational innovations to advance CCS technologies.

advanced deep learning↗
DOE OSTI2022

Impact of cyber attacks on distributed compressive sensing based state estimation in power distribution grids

Modern power distribution grids suffer from multiple vulnerabilities due to the tight integration between the physical system and the cyber infrastructure. Sophisticated and malicious cyber attacks continue to adversely impact the grid operation leading to performance degradation, service interruption, and grid failure. State estimation plays an essential role in grid monitoring and advancing cyber-attack situational awareness. In this regard, this paper first proposes a distributed compressive sensing (CS) state estimation approach for an unobservable distribution grid. Further, the proposed distributed CS approach divides the distribution grid into sub-areas to perform local state estimation. Then an alternating direction method of multipliers (ADMM) based iterative information exchange among neighboring areas is employed to complete the estimation process. In this estimation process, the impact of loss of measurement data, false data injection (FDI), replay, and neighborhood cyber-attacks is analyzed. Extensive simulations are performed on the IEEE 37-bus and IEEE 123-bus standard networks to demonstrate the algorithm’s robustness to the aforementioned cyber-attacks. A quantitative analysis of computational complexity and simulation time of the distributed CS based approach is also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Multi-Agent Control of Lane-Switching Automated Vehicles for Energy Efficiency

The proliferation of automatic control systems and their connectivity accents the performance of their interactions. In particular, connected and automated vehicles could become high-impact examples thanks to their energy use and productivity effects. Ideally, a controller might collectively optimize all agents' control moves for a given objective. However, limits on computational complexity, incomplete knowledge of the central planner, and risks of a single point of failure make distributed control attractive as well. This paper proposes a collaborative heuristic to approach the performance of centralized control with decentralized-like computational effort. The related centralized controller is also described in detail and evaluated as a baseline. A collaboration-intensive obstacle avoidance scenario involving electric vehicles is simulated to demonstrate benefits over fully decentralized control. While centralized optimization performed best with an 8.6 % energy reduction, the collaborative decentralized scheme reached a favorable computation-performance tradeoff with a 6.7 % energy reduction.

Dollar, R. Austin↗
DOE OSTI2020

Do optimization methods in deep learning applications matter?

With advances in deep learning, exponential data growth and increasing model complexity, developing efficient optimization methods are attracting much research attention. Several implementations favor the use of Conjugate Gradient (CG) and Stochastic Gradient Descent (SGD) as being practical and elegant solutions to achieve quick convergence, however, these optimization processes also present many limitations in learning across deep learning applications. Recent research is exploring higher-order optimization functions as better approaches, but these present very complex computational challenges for practical use. Comparing first and higher-order optimization functions, in this paper, our experiments reveal that Levemberg-Marquardt (LM) significantly supersedes optimal convergence but suffers from very large processing time increasing the training complexity of both, classification and reinforcement learning problems. Our experiments compare off-the-shelf optimization functions(CG, SGD, LM and L-BFGS) in standard CIFAR, MNIST, CartPole and FlappyBird experiments.The paper presents arguments on which optimization functions to use and further, which functions would benefit from parallelization efforts to improve pretraining time and learning rate convergence.

Ozyildirim, Buse Melis↗
DOE OSTI2016

SELF-GRAVITATIONAL FORCE CALCULATION OF INFINITESIMALLY THIN GASEOUS DISKS ON NESTED GRIDS

We extend the work of Yen et al. and develop second-order formulae to accommodate a nested grid discretization for the direct self-gravitational force calculation for infinitesimally thin gaseous disks. This approach uses a two-dimensional kernel that is derived for infinitesimally thin disks and is free of artificial boundary conditions. The self-gravitational force calculation is presented in generalized convolution forms for a nested grid configuration. A numerical technique derived from a fast Fourier transform is employed to reduce the computational complexity to be nearly linear. By comparing with analytic potential–density pairs associated with the generalized Maclaurin disks, the extended approach is verified to be of second-order accuracy when using numerical simulations. The proposed method is accurate, computationally fast, and has the potential to be applied to studies of planetary migration and the gaseous morphology of disk galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

The Effect of Geometry, Spin, and Orbital Optimization in Achieving Accurate, Correlated Results for Iron–Sulfur Cubanes

Iron–sulfur clusters comprise an important functional motif in the catalytic centers of biological systems, capable of enabling important chemical transformations at ambient conditions. This remarkable capability derives from a notoriously complex electronic structure that is characterized by a high density of states that is sensitive to geometric changes. The spectral sensitivity to subtle geometric changes has received little attention from correlated, large active space calculations, owing partly to the exceptional computational complexity for treating these large and correlated systems accurately. Here, to provide insight into this aspect, we report the first Complete Active Space Self Consistent Field (CASSCF) calculations for different geometries of the [Fe(II/III) 4 S 4 (SMe) 4 ] -2 clusters using two complementary, correlated solvers: spin-pure Adaptive Sampling Configuration Interaction (ASCI) and Density Matrix Renormalization Group (DMRG). We find that the previously established picture of a double-exchange driven magnetic structure, with minute energy gaps (<1 mHa) between consecutive spin states, has a weak dependence on the underlying geometry. However, the spin gap between the singlet and the spin state 2S + 1 = 19, corresponding to a maximal number of Fe-d electrons being unpaired and of parallel spin, is strongly geometry dependent, changing by a factor of 3 upon slight deformations that are still within biologically relevant parameters. The CASSCF orbital optimization procedure, using active spaces as large as 86 electrons in 52 orbitals, was found to reduce this gap compared to typical mean-field orbital approaches. Our results show the need for performing large active space calculations to unveil the challenging electronic structure of these complex catalytic centers and should serve as accurate starting points for fully correlated treatments upon inclusion of dynamical correlation outside the active space.

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

GPU Data Access on Complex Geometries for D3Q19 Lattice Boltzmann Method

GPU performance of the lattice Boltzmann method (LBM) depends heavily on memory access patterns. When LBM is advanced with GPUs on complex computational domains, geometric data is typically accessed indirectly, and lattice data is typically accessed lexicographically in the Structure of Array (SoA) layout. Although there are a variety of existing access patterns beyond the typical choices, no study has yet examined the relative efficacy between them. Here, we compare a suite of memory access schemes via empirical testing and performance modeling. We find strong evidence that semi-direct addressing is the superior addressing scheme for the majority of cases examined: Semi-direct addressing increases computational speed and often reduces memory consumption. For lattice layout, we find that the Collected Structure of Arrays (CSoA) layout outperforms the SoA layout. When compared to state-of-the-art practices, our recommended addressing modifications lead to performance gains between 10-40% across different complex geometries, fluid volume fractions, and resolutions. The modifications also lead to a decrease in memory consumption by as much as 17%. Having discovered these improvements, we examine a highly resolved arterial geometry on a leadership class system. On this system we present the first near-optimal strong results for LBM with arterial geometries run on GPUs. We also demonstrate that the above recommendations remain valid for large scale, many device simulations, which leads to an increased computational speed and average memory usage reductions. To understand these observations, we employ performance modeling which reveals that semi-direct methods outperform indirect methods due to a reduced number of total loads/stores in memory, and that CSoA outperforms SoA and bundling due to improved caching behavior.

Herschlag, Gregory↗
DOE OSTI2021

Spectral Equivalence of Low-Order Discretizations for High-Order H(curl) and H(div) Spaces

In this paper, we present spectral equivalence results for high-order tensor product edge- and face-based finite elements for the H(curl) and H(div) function spaces. Specifically, we show for certain choices of shape functions that the mass and stiffness matrices of the high-order elements are spectrally equivalent to those for an assembly of low-order elements on the associated Gauss--Lobatto--Legendre mesh. Based on this equivalence, efficient preconditioners can be designed with favorable computational complexity. Numerical results are presented which confirm the theory and demonstrate the benefits of the equivalence results for overlapping Schwarz preconditioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Spectral Equivalence Properties of Higher-Order Tensor Product Finite Elements and Applications to Preconditioning

In this study, we present spectral equivalence results for higher-order tensor product edge-, face- and interior-based finite elements. Specifically, we show for certain choices of shape functions that the mass and stiffness matrices of the higher-order elements are spectrally equivalent to those for an assembly of lowest-order elements on the associated Gauss-Lobatto-Legendre mesh. Based on this equivalence, efficient preconditioners can be designed with favorable computational complexity. Numerical results are presented which confirm the theory and demonstrate the benefits of the equivalence results for overlapping Schwarz preconditioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient Monte Carlo event generation for neutrino-nucleus exclusive cross sections

Modern neutrino-nucleus cross section computations need to incorporate sophisticated nuclear models to achieve greater predictive precision. However, the computational complexity of these advanced models often limits their practicality for experimental analyses. To address this challenge, we introduce a new Monte Carlo method utilizing normalizing flows to generate surrogate cross sections that closely approximate those of the original model while significantly reducing computational overhead. As a case study, we built a Monte Carlo event generator for the neutrino-nucleus cross section model developed by the Ghent group. This model employs a Hartree-Fock procedure to establish a quantum mechanical framework in which both the bound and scattering nucleon states are solutions to the mean-field nuclear potential. The surrogate cross sections generated by our method demonstrate excellent accuracy with a relative effective sample size of more than 98.4%, providing a computationally efficient alternative to traditional Monte Carlo sampling methods for differential cross sections.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Material coherence from trajectories via Burau eigenanalysis of braids

In this paper, we provide a numerical tool to study a material’s coherence from a set of 2D Lagrangian trajectories sampling a dynamical system, i.e., from the motion of passive tracers. We show that eigenvectors of the Burau representation of a topological braid derived from the trajectories have levelsets corresponding to components of the Nielsen–Thurston decomposition of the dynamical system. One can thus detect and identify clusters of space–time trajectories corresponding to coherent regions of the dynamical system by solving an eigenvalue problem. Unlike previous methods, the scalable computational complexity of our braid-based approach allows the analysis of large amounts of trajectories.

36 MATERIALS SCIENCE↗
DOE OSTI2017

Robust determination of the chemical potential in the pole expansion and selected inversion method for solving Kohn-Sham density functional theory

Fermi operator expansion (FOE) methods are powerful alternatives to diagonalization type methods for solving Kohn-Sham density functional theory (KSDFT). One example is the pole expansion and selected inversion (PEXSI) method, which approximates the Fermi operator by rational matrix functions and reduces the computational complexity to at most quadratic scaling for solving KSDFT. Unlike diagonalization type methods, the chemical potential often cannot be directly read off from the result of a single step of evaluation of the Fermi operator. Hence multiple evaluations are needed to be sequentially performed to compute the chemical potential to ensure the correct number of electrons within a given tolerance. This hinders the performance of FOE methods in practice. In this paper, we develop an efficient and robust strategy to determine the chemical potential in the context of the PEXSI method. The main idea of the new method is not to find the exact chemical potential at each self-consistent-field (SCF) iteration but to dynamically and rigorously update the upper and lower bounds for the true chemical potential, so that the chemical potential reaches its convergence along the SCF iteration. Instead of evaluating the Fermi operator for multiple times sequentially, our method uses a two-level strategy that evaluates the Fermi operators in parallel. In the regime of full parallelization, the wall clock time of each SCF iteration is always close to the time for one single evaluation of the Fermi operator, even when the initial guess is far away from the converged solution. We demonstrate the effectiveness of the new method using examples with metallic and insulating characters, as well as results from ab initio molecular dynamics.

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

Incremental principal component pursuit for video background modeling

An incremental Principal Component Pursuit (PCP) algorithm for video background modeling that is able to process one frame at a time while adapting to changes in background, with a computational complexity that allows for real-time processing, having a low memory footprint and is robust to translational and rotational jitter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Rank-reduced coupled-cluster. III. Tensor hypercontraction of the doubles amplitudes

In this work, we develop a quartic-scaling implementation of coupled-cluster singles and doubles (CCSD) based on low-rank tensor hypercontraction (THC) factorizations of both the electron repulsion integrals (ERIs) and the doubles amplitudes. This extends our rank-reduced (RR) coupled-cluster method to incorporate higher-order tensor factorizations. The THC factorization of the doubles amplitudes accounts for most of the gain in computational efficiency as it is sufficient, in conjunction with a Cholesky decomposition of the ERIs, to reduce the computational complexity of most contributions to the CCSD amplitude equations. Further THC factorization of the ERIs reduces the complexity of certain terms arising from nested commutators between the doubles excitation operator and the two-electron operator. We implement this new algorithm using graphical processing units and demonstrate that it enables CCSD calculations for molecules with 250 atoms and 2500 basis functions using a single computer node. Furthermore, we show that the new method computes correlation energies with comparable accuracy to the underlying RR-CCSD method.

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

Limitations of Hartree–Fock with quantum resources

The Hartree–Fock problem provides the conceptual and mathematical underpinning of a large portion of quantum chemistry. As efforts in quantum technology aim to enhance computational chemistry algorithms, the Hartree–Fock method, central to many other numerical approaches, is a natural target for quantum enhanced algorithms. While quantum computers and quantum simulation offer many prospects for the future of modern chemistry, the non-deterministic polynomial-complete Hartree–Fock problem is not a likely candidate. Here, we highlight this fact from a number of perspectives including computational complexity, practical examples, and the full characterization of energy landscapes for simple systems.

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

A Brief Description of the Kokkos implementation of the SNAP potential in ExaMiniMD.

Within the EXAALT project, the SNAP [1] approach is being used to develop high accuracy potentials for use in large-scale long-time molecular dynamics simulations of materials behavior. In particular, we have developed a new SNAP potential that is suitable for describing the interplay between helium atoms and vacancies in high-temperature tungsten[2]. This model is now being used to study plasma-surface interactions in nuclear fusion reactors for energy production. The high-accuracy of SNAP potentials comes at the price of increased computational cost per atom and increased computational complexity. The increased cost is mitigated by improvements in strong scaling that can be achieved using advanced algorithms [3].

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2016

Efficacy of the SU(3) scheme for ab initio large-scale calculations beyond the lightest nuclei

We report on the computational characteristics of ab initio nuclear structure calculations in a symmetry-adapted no-core shell model (SA-NCSM) framework. We examine the computational complexity of the current implementation of the SA-NCSM approach, dubbed LSU3shell, by analyzing ab initio results for 6 Li and 12 C in large harmonic oscillator model spaces and SU3-selected subspaces. We demonstrate LSU3shell’s strong-scaling properties achieved with highly-parallel methods for computing the many-body matrix elements. Results compare favorably with complete model space calculations and significant memory savings are achieved in physically important applications. In particular, a well-chosen symmetry-adapted basis affords memory savings in calculations of states with a fixed total angular momentum in large model spaces while exactly preserving translational invariance.

74 ATOMIC AND MOLECULAR PHYSICS↗