Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm complexity analysis”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers

We introduce a multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) method to simultaneously estimate multiple eigenvalues of a quantum Hamiltonian on early fault-tolerant quantum computers. Our theoretical analysis demonstrates that the algorithm exhibits Heisenberg-limited scaling in terms of circuit depth and total cost. Notably, the proposed quantum circuit utilizes just one ancilla qubit, and with appropriate initial state conditions, it achieves significantly shorter circuit depths compared to circuits based on quantum phase estimation (QPE). Numerical results suggest that compared to QPE, the circuit depth can be reduced by around two orders of magnitude under several settings for estimating ground-state and excited-state energies of certain quantum systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Sparse optimization of two-dimensional terahertz spectroscopy

Two-dimensional terahertz spectroscopy (2DTS) is a low-frequency analog of two-dimensional optical spectroscopy that is rapidly maturing as a probe of a wide variety of condensed matter systems. However, a persistent problem with 2DTS is the long experimental acquisition times, which prevent its broader adoption. A potential solution, requiring no increase in experimental complexity, is signal reconstruction via compressive sensing. In this work, we apply the sparse exponential mode analysis (SEMA) technique to 2DTS of a cuprate superconductor. We benchmark the performance of the algorithm in reconstructing terahertz nonlinearities and find that SEMA reproduces the asymmetric photon echo line shapes at sampling rates as low as 10%, reaching the reconstruction noise floor at sampling rates beyond 20%–30%. The success of SEMA in reproducing such subtle, asymmetric line shapes confirms compressive sensing as a general method to accelerate 2DTS and multidimensional spectroscopies more broadly.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Memory-Aware External Facelist Calculation: A Data-Parallel Atomic Hash Counting Approach

Unstructured volumetric meshes serve as fundamental data representations in various scientific simulations and analyses. They play a crucial role in representing complex computational domains and are essential for important numerical techniques, such as finite element analysis. Whenever such a mesh is read from a file, streamed in-situ, or generated by algorithms, scientific visualization libraries rely on calculating the external surface of a geometry, named “external facelist”, to produce a polygonal mesh for rendering. Consequently, external facelist calculation has become one of the most widely used algorithms in the scientific visualization domain, necessitating optimal performance. In this paper, we explore relevant work on external facelist calculation algorithms in two common visualization libraries, VTK and Viskores, assess their performance and memory constraints, and introduce a novel memory-aware external facelist calculation algorithm employing an atomic hash counting approach. This algorithm fully leverages Viskores' data-parallel primitive operations, facilitating its execution across diverse many-core architectures. Our algorithm features the lowest memory footprint on the GPU and the second-lowest on the CPU among all evaluated methods, and it also delivers the fastest performance on both CPU and GPU. It has been made available under an open-source license in the VTK and Viskores visualization systems.

Tsalikis, Spiros [Kitware] (ORCID:0000000151137195↗
DOE OSTI2021

DAKOTA (Design Analysis Kit for Optimization and Terascale) v.6.14

Sandia's Dakota software supports science and engineering transformation through advanced exploration of simulations. Specifically, Dakota manages and analyzes ensembles of simulations to provide broader and deeper perspective for analysts and decision makers. This enables them to: (1) enhance understanding of risk, (2) improve products, and (3) assess simulation credibility. In its simplest mode, Dakota can automate typical parameter variation studies through a generic interface to a computational model. Dakota also delivers advanced parametric analysis techniques enabling design exploration, optimization, model calibration, risk analysis, and quantification of margins and uncertainty with such models. It directly supports verification and validation activities. The algorithms implemented in Dakota aim to address challenges in performing these analyses with complex science and engineering models from desktop to high performance computers. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525 SAND2021-10468 O

Adams, BrianM.↗
DOE OSTI2021

DAKOTA (Design Analysis Kit for Optimization and Terascale) v.6.16

Sandia's Dakota software supports science and engineering transformation through advanced exploration of simulations. Specifically, Dakota manages and analyzes ensembles of simulations to provide broader and deeper perspective for analysts and decision makers. This enables them to: (1) enhance understanding of risk, (2) improve products, and (3) assess simulation credibility. In its simplest mode, Dakota can automate typical parameter variation studies through a generic interface to a computational model. Dakota also delivers advanced parametric analysis techniques enabling design exploration, optimization, model calibration, risk analysis, and quantification of margins and uncertainty with such models. It directly supports verification and validation activities. The algorithms implemented in Dakota aim to address challenges in performing these analyses with complex science and engineering models from desktop to high performance computers. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525 SAND2021-10468 O

Adams, BrianM.↗
DOE OSTI2024

A Generative Model for Realistic Galaxy Cluster X-Ray Morphologies

Abstract The X-ray morphologies of clusters of galaxies display significant variations, reflecting their dynamical histories and the nonlinear dependence of X-ray emissivity on the density of the intracluster gas. Qualitative and quantitative assessments of X-ray morphology have long been considered a proxy for determining whether clusters are dynamically active or “relaxed.” Conversely, the use of circularly or elliptically symmetric models for cluster emission can be complicated by the variety of complex features realized in nature, spanning scales from megaparsecs down to the resolution limit of current X-ray observatories. In this work, we use mock X-ray images from simulated clusters from The Three Hundred project to define a basis set of cluster image features. We take advantage of the clusters’ approximate self-similarity to minimize the differences between images before encoding the remaining diversity through a distribution of high-order polynomial coefficients. Principal component analysis then provides an orthogonal basis for this distribution, corresponding to natural perturbations from an average model. This representation allows novel, realistically complex X-ray cluster images to be easily generated, and we provide code to do so. The approach provides a simple way to generate training data for cluster image analysis algorithms and could be straightforwardly adapted to generate clusters displaying specific types of features or selected by physical characteristics available in the original simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Self-Taught Waveform Synthesis and Analysis in the Amplify-and-Forward Relay Channel

Wireless communications plays a pivotal role in multiple complex domains such as tactical networks or space communications. Traditional physical (PHY) layer protocols for digital communications contain chains of signal processing blocks that have been mathematically optimized to transmit information bits efficiently over noisy channels. Unfortunately, the ongoing advancement of hardware and software design, and algorithm development, makes it difficult for some domains to keep up with the constant change in modern communication systems. It has been shown previously that combining deep learning with digital modulation (deepmod) allows a system to learn communications on its own rather than requiring human-invented protocols. This is particularly attractive to space communications where updating PHY layer technologies may be prohibitively complex or expensive. A link using deepmod is able to learn both waveform synthesis (transmit) and analysis (receive) that is self-taught. When deepmod is first initiated it has no knowledge of the channel medium but quickly learns to communicate by synthesizing waveforms that can be successfully decoded at the other end of the link. This is accomplished by a custom deep neural network especially suited for this particular task of learning. In this current work, we show that deepmod learns in both traditional point-to-point channels as well as the more abstract multi-hop amplify-and-forward relay channel. In the experimental results, even though no direct link between transmitter and receiver exists, deepmod-enabled nodes still create latent information bearing waveforms that can be used for communications.

Anderson, Adam L.↗
DOE OSTI2023

MATBOX, an Open-Source Microstructure Analysis Toolbox for Meshing, Generation, Segmentation, and Characterization of 3D Heterogenous Volumes

Battery performance is strongly correlated with electrode microstructural properties. To account for its impact, lithium-ion battery (LIB) models either abstract the microstructural heterogeneity of composite electrodes using effective macroscopic properties (macro- or meso- scale models) or directly solve the system of equations on the microstructure geometry or mesh (microstructure-scale models). Therefore, to be adequate, both families of models require information from the microstructure geometry, which can be provided by the numerical tool presented in this work. MATBOX is a MATLAB open-source application [1] developed by NREL for performing various microstructure-related tasks including microstructure numerical generation, image filtering and microstructure segmentation, microstructure characterization and correlation, visualization, and microstructure meshing. MATBOX was originally developed for the analysis of LIB electrode microstructures; however, the algorithms provided by the toolbox are widely applicable to other heterogeneous materials. The toolbox provides a user-friendly experience thanks to a Graphical-User Interface, requires no coding by the user, and is well documented. This presentation will illustrate various MATBOX features for the characterization of a LIB electrode, including a fully automated Representative Volume Element (RVE) analysis, the numerical generation of complex 'virtual' microstructure, including dual-layer electrodes and carbon-binder additive phase, and the meshing of a complex NMC/graphite full cell microstructure suitable for 3D finite-element modeling. Other modules (segmentation, visualization, and correlation) will be briefly presented. Thanks to its modular, open-source approach, MATBOX can easily incorporate third-party algorithms to eventually build a standard in the field that will benefit the whole scientific community. Effective diffusion coefficient [2], additive phase numerical generation [3], and meshing [4] third-party algorithms have been already integrated in the toolbox with more to come.

DIRECT ENERGY CONVERSION,MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Analytical Modeling of Exoplanet Transit Spectroscopy with Dimensional Analysis and Symbolic Regression

Abstract The physical characteristics and atmospheric chemical composition of newly discovered exoplanets are often inferred from their transit spectra, which are obtained from complex numerical models of radiative transfer. Alternatively, simple analytical expressions provide insightful physical intuition into the relevant atmospheric processes. The deep-learning revolution has opened the door for deriving such analytical results directly with a computer algorithm fitting to the data. As a proof of concept, we successfully demonstrate the use of symbolic regression on synthetic data for the transit radii of generic hot-Jupiter exoplanets to derive a corresponding analytical formula. As a preprocessing step, we use dimensional analysis to identify the relevant dimensionless combinations of variables and reduce the number of independent inputs, which improves the performance of the symbolic regression. The dimensional analysis also allowed us to mathematically derive and properly parameterize the most general family of degeneracies among the input atmospheric parameters that affect the characterization of an exoplanet atmosphere through transit spectroscopy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Parallel Algorithms for Computing the Tensor-Train Decomposition

The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a d-dimension tensor in $\mathbb{R}$ $n\times∙∙∙$$\times$$n$ a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of $O(n^{[d/2]})$, improving upon $O(n^{d—1})$ from previous algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Process Image Analysis using Big Data, Machine Learning, and Computer Vision

Within the DOE complex, 3013 canisters are used to store Pu-bearing waste. Wall penetration due to corrosion, specifically stress corrosion cracking, is considered to be the most likely cause of failure over the 50-year lifetime of the canisters. This project has 2 objectives: The first is the development of machine learning algorithms to identify the presence of corrosion from a very large set of images generated by laser confocal microscope scanning of 3013 canister used to store Pu oxides. This portion of the LDRD constitutes image analysis of a metal surface for the presence of corrosion. The image processing algorithms developed for this project will provide a suitable basis for analysis of other types of corrosion data, which can be produced in vast quantities using modern devices. The second component of the LDRD consists of the development of machine learning algorithms that obtain molecular mechanics force-fields from ab-initio Density Functional Theory (DFT) calculations for corrosive attack by chlorides on 304L or 316L stainless steel. The goal of this latter component is to determine means for mitigating corrosion on a fundamental level, including coatings, welding methods, metal composition, etc. Force-field modeling is necessary for this endeavor because the incipience and progression of corrosion is the governed by molecular structures, grain boundaries, dislocations and surface structures represented by large numbers of atoms. Although DFT calculations are extremely adept at describing molecular scale processes, they are computationally expensive making them ill-suited for calculations of more than several hundred atoms, especially for the repeated applications inherent in material design. Fortunately, force-field methods provide an avenue for viable molecular-scale calculations involving the numbers of atoms involved in corrosion processes. The accuracy of the force-field calculations depends strongly on the accuracy of the force-field model, which is extremely difficult and time-consuming to derive from either data or ab-initio calculations. The use of machine learning algorithms has the potential to make the calculation of force-fields much more efficient but has not been explored significantly for corrosion processes. If shown to be viable, the technique would have wide -ranging impact on design of corrosion resistant materials and on the mitigation of corrosion in existing process systems.

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

Towards robust autonomous impedance spectroscopy analysis: A calibrated hierarchical Bayesian approach for electrochemical impedance spectroscopy (EIS) inversion

Distribution-based analyses, such as the distribution of relaxation times (DRT) and the distribution of diffusion times (DDT), present model-free alternatives to equivalent circuit modeling for analysis of electrochemical impedance spectroscopy (EIS) data. However, reconstructing such distributions from noisy impedance data is an ill-posed problem that must be solved with specialized inversion algorithms, requiring careful control and tuning. Furthermore, most inversion algorithms developed to date can only solve problems of limited complexity. Herein, we present a new hierarchical Bayesian method for EIS inversion, leveraging efficient algorithms for optimization and Hamiltonian Monte Carlo (HMC) sampling to solve models of arbitrary complexity. We overcome the challenge of ad-hoc parameter tuning by encoding intrinsic characteristics of the DRT and DDT into flexible prior distributions and “pre-calibrating” the model to simulated data. This approach is versatile, highly robust to noise, and provides quantitative estimates of both the error structure of the data and the uncertainty in the recovered distributions. The model is validated with simulated data to demonstrate accurate recovery of the DRT and the DDT. The method also shows promise for simultaneous recovery of multiple distributions, raising the intriguing possibility of semi-autonomous EIS analysis and ad-hoc model construction. Finally, the practical utility of the method is illustrated with experimental data. Throughout, we draw comparisons to several recently published EIS inversion methodologies.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Quantum Spectral Methods for Differential Equations

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ϵ with complexity poly(log(1/ϵ)), no such algorithm was previously known for differential equations with time-dependent coefficients. In this work, we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd, log(1/ϵ)).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗
DOE OSTI2019

Adaptive multi-index collocation for uncertainty quantification and sensitivity analysis

In this paper, we present an adaptive algorithm to construct response surface approximations of high-fidelity models using a hierarchy of lower fidelity models. Our algorithm is based on multiindex stochastic collocation and automatically balances physical discretization error and response surface error to construct an approximation of model outputs. This surrogate can be used for uncertainty quantification (UQ) and sensitivity analysis (SA) at a fraction of the cost of a purely high-fidelity approach. We demonstrate the effectiveness of our algorithm on a canonical test problem from the UQ literature and a complex multi-physics model that simulates the performance of an integrated nozzle for an unmanned aerospace vehicle. We find that when the input-output response is sufficiently smooth our algorithm produces approximations that can be up to orders of magnitude more accurate than single fidelity approximations for a fixed computational budget.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

DES science portal: Computing photometric redshifts

We present the Dark Energy Survey (DES) Science Portal, an integratedweb-based data interface designed to facilitate scientific analysis. Wedemonstrate how the Portal can provide a reliable environment to accesscomplete data sets, provide validation algorithms and metrics in the case ofmultiple methods and training configurations, and maintain the provenancebetween the different steps of a complex calculation, while ensuringreproducibility of the results. We use the estimation of DES photometricredshifts (photo-$z$s) as an example. A significant challenge facingphotometric surveys for cosmological purposes, such as DES, is the need toproduce reliable redshift estimates. The choice between competing algorithmsand configurations and the maintenance of an up-to-date spectroscopic databaseto build training sets, for example, are complex tasks when dealing with largeamounts of data that are regularly updated and constantly growing. We show howthe DES Science Portal can be used to train and validate several photo-$z$algorithms using the DES first year (Y1A1) data. The photo-$z$s estimated inthe Portal are used to feed the creation of catalogs for scientific workflows.While the DES collaboration is still developing techniques to obtain precisephoto-$z$s, having a structured framework like the one presented here iscritical for the systematic vetting of DES algorithmic improvements and theconsistent production of photo-$z$s in future DES releases.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Impact of genotype‐calling methodologies on genome‐wide association and genomic prediction in polyploids

Abstract Discovery and analysis of genetic variants underlying agriculturally important traits are key to molecular breeding of crops. Reduced representation approaches have provided cost‐efficient genotyping using next‐generation sequencing. However, accurate genotype calling from next‐generation sequencing data is challenging, particularly in polyploid species due to their genome complexity. Recently developed Bayesian statistical methods implemented in available software packages, polyRAD, EBG, and updog, incorporate error rates and population parameters to accurately estimate allelic dosage across any ploidy. We used empirical and simulated data to evaluate the three Bayesian algorithms and demonstrated their impact on the power of genome‐wide association study (GWAS) analysis and the accuracy of genomic prediction. We further incorporated uncertainty in allelic dosage estimation by testing continuous genotype calls and comparing their performance to discrete genotypes in GWAS and genomic prediction. We tested the genotype‐calling methods using data from two autotetraploid species, Miscanthus sacchariflorus and Vaccinium corymbosum , and performed GWAS and genomic prediction. In the empirical study, the tested Bayesian genotype‐calling algorithms differed in their downstream effects on GWAS and genomic prediction, with some showing advantages over others. Through subsequent simulation studies, we observed that at low read depth, polyRAD was advantageous in its effect on GWAS power and limit of false positives. Additionally, we found that continuous genotypes increased the accuracy of genomic prediction, by reducing genotyping error, particularly at low sequencing depth. Our results indicate that by using the Bayesian algorithm implemented in polyRAD and continuous genotypes, we can accurately and cost‐efficiently implement GWAS and genomic prediction in polyploid crops.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

Wind Forecasting Improvement Project In Complex Terrain Near the Columbia River Gorge

In 2014 a multi-institution team led by Vaisala, Inc. was selected by the Department of Energy (DOE) to partner with multiple DOE and National Oceanic and Atmospheric Administration (NOAA) laboratories on a project designed to improve the quality of wind power forecasts in areas of complex terrain. This was the second Wind Forecast Improvement Project (WFIP2) funded by DOE and it extended from late 2014 through the middle of 2018. It encompassed an 18-month observational field campaign, numerical weather prediction (NWP) model development, extensive analysis of data and NWP output, and the creation of decision support tool algorithms to convey forecast information to end users in the wind industry. WFIP2 focused on improvements to the representation of near-surface and boundary-layer physics in NOAA’s High-Resolution Rapid Refresh (HRRR) model. Improvements to HRRR, which is run operationally over the continental United States, benefit the wind industry in multiple ways. Forecasts from the operational HRRR are used directly by wind power forecast vendors and the operators of wind plants. In addition, because HRRR is built using the widely-used Weather Research and Forecasting (WRF) model, improvements to its parameterizations become available to commercial and research institutions using WRF for a myriad of purposes. The geographic area studied by WFIP2 was a region of the Columbia River basin located to the east of the Cascade Mountains between Oregon and Washington. Home to over 6 GW of installed capacity for wind energy production, this area also hosts a variety of atmospheric phenomena either unique to or augmented by complex topography. This makes it an attractive test-bed for the analysis of wind forecast in complex terrain, though results found are should be applicable in any area of topographic complexity. WFIP2 succeeded as a collaborative effort, and while this report focuses on the activities of the team led by Vaisala, the work described here is part of a larger whole. The Vaisala team accomplished a number of specific tasks as described in this report, while also contributing to this larger effort.

17 WIND ENERGY↗