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 OSTI2024

Forward variable selection enables fast and accurate dynamic system identification with Karhunen-Loève decomposed Gaussian processes

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are O ( N P 2 ) in training and O ( P ) per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a ‘Susceptible, Infected, Recovered’ (SIR) toy problem, along with the experimental ‘Cascaded Tanks’ benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package.

Hayes, Kyle↗
DOE OSTI2024

Optimization of Solid Oxide Electrolysis Cell Systems Accounting for Long-Term Performance and Health Degradation

This study focuses on optimizing solid oxide electrolysis cell (SOEC) systems for efficient and durable long-term hydrogen (H2) production. While the elevated operating temperatures of SOECs offer advantages in terms of efficiency, they also lead to chemical degradation, which shortens cell lifespan. To address this challenge, dynamic degradation models are coupled with a steady-state, two-dimensional, non-isothermal SOEC model and steady-state auxiliary balance of plant equipment models, within the IDAES modeling and optimization framework. A quasi-steady state approach is presented to reduce model size and computational complexity. Long-term dynamic simulations at constant H2 production rate illustrate the thermal effects of chemical degradation. Dynamic optimization is used to minimize the lifetime cost of H2 production, accounting for SOEC replacement, operating, and energy expenses. Several optimized operating profiles are compared by calculating the Levelized Cost of Hydrogen (LCOH).

Giridhar, Nishant↗
DOE OSTI2026

Cathodic Protection Modeling for Hanford Underground Double-Shell Tank Farms

Hanford stores millions of gallons of radioactive and chemically hazardous waste from the production of weapon materials in tank farms consisting of underground carbon-steel storage tanks surrounded by reinforced concrete. Six of these Hanford tank farms use double-shell storage tanks (DSTs). The DST farms were constructed from 1968 to 1986 with a planned 40–50 year design life, so some are already operating beyond their initial life expectancy. Ultrasonic testing (UT) has indicated significant thinning on the bottom of the secondary (outer) liner of these tanks, believed to arise from groundwater intrusion driving concrete side corrosion. There is no direct access to the steel/concrete interface between the tank and the concrete pad, making it difficult to apply a chemical-based mitigation strategy or to conduct repairs, but cathodic protection (CP) is a possible method to inhibit further concrete-side corrosion. Hanford already uses CP to protect below grade steel piping within the tank farms and connected to the tanks, but this system was not designed to protect the tank bottoms. CP design must account for the structures surrounding the DSTs, including the steel reinforcing bars (rebar) within the concrete pad and vault, various process lines, and the existing CP system. In this study, finite element analysis (FEA) modeling was carried out to simulate CP protection of 1) a single tank and CP anode to develop options for modeling the rebar and to compare to a simpler circuit model and 2) the entire Hanford AN tank farm as a representative example consisting of seven tanks, associated piping, and both existing and new CP anodes. Both circuit and FEA models predict that significant protective current could be delivered to the bottoms of the tanks with the addition of tank-protection anodes below the depth of the tanks. Simulations with only the existing pipe-protection anodes active confirmed that only a very small current to the tank bottoms is predicted under present conditions. Multiple simplified representations of the dome and wall rebar were tested to reduce the computational complexity of the tank-farm simulations, resulting in modeling the rebar as edge elements with a prescribed effective circumference that matches the real rebar surface area. The geometry of the rebar is also simplified into horizontal hoops around the tank walls and radial rebar over the dome with increased effective circumference to retain the target surface area. This simplification was found to greatly reduce the complexity and solution time of the models without large changes in current distributions, especially to the tank bottom. A range of values were tested for model parameters such as soil and concrete resistivities and polarization resistance to investigate their impact on the current and electric potential distributions. Depending on the parameters used, FEA simulations predict some risk of overprotection, particularly on the piping system; since overprotection can also lead to surface damage associated with hydrogen gas generation at the interface (e.g. hydrogen embrittlement or damage to coatings), this needs to be considered when refining the design of the new CP system. Comparison between the FEA models and the circuit model representation demonstrated that the circuit model could not match the predicted FEA current distribution, even when using the exact same surface areas. This discrepancy appeared to be at least partly attributable to the impact of the relative positions of the tank components and anodes to each other and to the ground surface. The FEA model accounts for the relative positions since it solves the governing equations in three dimensions, but the circuit model cannot account for the positioning. In particular, the circuit model underpredicts the current to the tank bottom and overpredicts the current to the dome compared to FEA for the baseline geometry. The FEA models omitted the electrically isolated rebar in the bottom concrete slab. However, a circuit based stray current model estimated that only 2.1% of the total current through the slab would stray into the rebar, corresponding to ~0.21 A for a target current density of 2 mA/ft2 to the tank bottom. The estimated corrosion driven by this amount of stray current is predicted to yield a lifetime of >400 years for the minimum rebar diameter, assuming an acceptable cross-section area loss of 10%.

d'Entremont, Anna [Savannah River National Laborat↗
DOE OSTI2024

Impact of Color Space and Color Resolution on Vehicle Recognition Models

In this study, we analyze both linear and nonlinear color mappings by training on versions of a curated dataset collected in a controlled campus environment. We experiment with color space and color resolution to assess model performance in vehicle recognition tasks. Color encodings can be designed in principle to highlight certain vehicle characteristics or compensate for lighting differences when assessing potential matches to previously encountered objects. The dataset used in this work includes imagery gathered under diverse environmental conditions, including daytime and nighttime lighting. Experimental results inform expectations for possible improvements with automatic color space selection through feature learning. Moreover, we find there is only a gradual decrease in model performance with degraded color resolution, which suggests the need for simplified data collection and processing. By focusing on the most critical features, we could see improved model generalization and robustness, as the model becomes less prone to overfitting to noise or irrelevant details in the data. Such a reduction in resolution will lower computational complexity, leading to quicker training and inference times.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients

In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.

convection–diffusion–reaction equation↗
DOE OSTI2024

Optimization of Solid Oxide Electrolysis Cell Systems Accounting for Long-Term Performance and Health Degradation

This study focuses on optimizing solid oxide electrolysis cell (SOEC) systems for efficient and durable long-term hydrogen (H2) production. While the elevated operating temperatures of SOECs offer advantages in terms of efficiency, they also lead to chemical degradation, which shortens cell lifespan. To address this challenge, dynamic degradation models are coupled with a steady-state, two-dimensional, non-isothermal SOEC model and steady-state auxiliary balance of plant equipment models, within the IDAES modeling and optimization framework. A quasi-steady state approach is presented to reduce model size and computational complexity. Long-term dynamic simulations at constant H2 production rate illustrate the thermal effects of chemical degradation. Dynamic optimization is used to minimize the lifetime cost of H2 production, accounting for SOEC replacement, operating, and energy expenses. Several optimized operating profiles are compared by calculating the Levelized Cost of Hydrogen (LCOH).

Giridhar, Nishant↗
DOE OSTI2025

A Fast Dynamic Internal Predictive Power Scheduling Approach for Power Management in Microgrids: Preprint

This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusing on external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programming (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILPPS) optimization through McCormick's relaxation to reduce computational complexity. A predictive window window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrating the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources while shifting the external power transfers to specified time durations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Sub-microsecond Transformers for Jet Tagging on FPGAs

We present the first sub-microsecond transformer implementation on an FPGA achieving competitive performance for state-of-the-art high-energy physics benchmarks. Transformers have shown exceptional performance on multiple tasks in modern machine learning applications, including jet tagging at the CERN Large Hadron Collider (LHC). However, their computational complexity prohibits use in real-time applications, such as the hardware trigger system of the collider experiments up until now. In this work, we demonstrate the first application of transformers for jet tagging on FPGAs, achieving $\mathcal{O}(100)$ nanosecond latency with superior performance compared to alternative baseline models. We leverage high-granularity quantization and distributed arithmetic optimization to fit the entire transformer model on a single FPGA, achieving the required throughput and latency. Furthermore, we add multi-head attention and linear attention support to hls4ml, making our work accessible to the broader fast machine learning community. This work advances the next-generation trigger systems for the High Luminosity LHC, enabling the use of transformers for real-time applications in high-energy physics and beyond.

Laatu, Lauri [Imperial Coll., London]↗
DOE OSTI2024

GDSA framework, a computational framework for complex modeling problems in radioactive waste management

This paper details a computational framework to produce automated, graphical workflows, and how this framework can be deployed to support complex modeling problems like those in nuclear engineering. Key benefits of the framework include: automating previously manual workflows; intuitive construction and communication of workflows through a graphical interface; and automated file transfer and handling for workflows deployed across heterogeneous computing resources. This paper demonstrates the framework's application to probabilistic post-closure performance assessment of systems for deep geologic disposal of nuclear waste. However, the framework is a general capability that can help users running a variety of computational studies.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Supporting Data: A Four‐Coordinate Pr 4+ Imidophosphorane Complex

Supporting computational data for the publication titled: A. C. Boggiano, S. Roy Chowdhury, M. D. Roy, M. G. Bernbeck, S. M. Greer, B. Vlaisavljevich,* and H. S. La Pierre* “A Four-Coordinate Pr4+ Imidophosphorane Complex" Angew. Chem. Int. Ed., 2024, e202409789. DOI: 10.1002/anie.202409789

Boggiano, Andrew C.↗
DOE OSTI2025

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Synthesis and Computational Analysis of Uranium(III)-Pnictogen Bonds

In this report, we describe the synthesis and characterization of two novel complexes that contain uranium(III)-pnictogen (P: 1-PMes 2 ; As: 1-AsMes 2 ) bonds to elucidate the degrees of covalency among these bonds. To our knowledge, this is the first reported uranium(III)-arsenic complex to be synthesized and characterized. Analysis of the phosphorus and arsenic bonds reveals a similar electronic environment, assessed by UV–vis NIR, that is comparable to other previously reported uranium(III) complexes. A computational analysis of these compounds and their congeners, N, Sb, and Bi, was performed to identify trends in the overall bonding character of the complexes. This analysis shows that bond covalency decreases as the pnictogen becomes heavier and that overall the interaction energy and its components decrease down the group. Here, this study provides an in-depth analysis and understanding of the nature of bonding between hard actinide and soft pnictogen centers.

Actinides↗
DOE OSTI2024

Modeling performance of data collection systems for high-energy physics

Exponential increases in scientific experimental data are outpacing silicon technology progress, necessitating heterogeneous computing systems—particularly those utilizing machine learning (ML)—to meet future scientific computing demands. The growing importance and complexity of heterogeneous computing systems require systematic modeling to understand and predict the effective roles for ML. We present a model that addresses this need by framing the key aspects of data collection pipelines and constraints and combining them with the important vectors of technology that shape alternatives, computing metrics that allow complex alternatives to be compared. For instance, a data collection pipeline may be characterized by parameters such as sensor sampling rates and the overall relevancy of retrieved samples. Alternatives to this pipeline are enabled by development vectors including ML, parallelization, advancing CMOS, and neuromorphic computing. By calculating metrics for each alternative such as overall F1 score, power, hardware cost, and energy expended per relevant sample, our model allows alternative data collection systems to be rigorously compared. We apply this model to the Compact Muon Solenoid experiment and its planned high luminosity-large hadron collider upgrade, evaluating novel technologies for the data acquisition system (DAQ), including ML-based filtering and parallelized software. The results demonstrate that improvements to early DAQ stages significantly reduce resources required later, with a power reduction of 60% and increased relevant data retrieval per unit power (from 0.065 to 0.31 samples/kJ). However, we predict that further advances will be required in order to meet overall power and cost constraints for the DAQ.

Olin-Ammentorp, Wilkie (ORCID:0000000224729862)↗
DOE OSTI2025

PQML: Enabling the Predictive Reproducibility on NISQ Machines for Quantum ML Applications

Quantum computing represents a groundbreaking approach to high-performance computing. In recent years, quantum computers have progressed from single-qubit processors to systems boasting over 400 qubits. The presence of such a large number of qubits offers significant advantages, including enhanced computational speed—a capability beyond classical computing methods. However, the current stage of quantum computing is referred to as the noisy intermediate-scale quantum (NISQ) era. The existence of noise in this era presents challenges in testing quantum computing applications, leading to considerable variance in application results. Furthermore, the diverse noise characteristics observed across different machines exacerbate this issue, complicating the selection of the appropriate machine for application execution. In response to these challenges, we introduce our Predictive Quantum Machine Learning (PQML) tool. This tool is designed to predict outcomes when executing identical quantum machine learning applications—specifically, a critical suite of variational quantum algorithms—across various quantum computers during the NISQ era. This effort relies on data collected over a 12-month period. To the best of our knowledge, this study represents the first attempt to ensure reproducibility across quantum computers for complex circuits. Additionally, we have developed a model capable of forecasting the accuracy of quantum computers for variational quantum algorithms, with a particular emphasis on quantum machine learning as a case study.

Senapati, Priyabrata [Kent State University]↗