Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decomposition algorithm”

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 883 records · Page 49

International Collaboration Framework for the Calculation of Performance Loss Rates: Data Quality, Benchmarks, and Trends

Within the IEA PVPS Task 13, a group of experts representing several leading R&D centres, universities and industry companies, is developing a framework for the calculation of Performance Loss Rates (PLR) on a large number of commercial and research PV power plants and related weather data coming from various climatic zones. Various methodologies are applied for the calculation of PLR which are benchmarked in terms of uncertainties and 'true' values. The aim of the international collaboration is to show how to calculate the PLR on high quality (high time resolution, reliable data, irradiance, yield, etc.) and on low quality data (low time resolution, only energy data available). Various algorithms and models, along with different time averaging and filtering criteria, can be applied for the calculation of PLR each of which can have an impact on the results. The approach considers three pathways to ensure broad collaboration and increase the statistical relevance of the study: i) use of shared methodologies on shared time series, ii) use of confidential methodologies on shared time series, iii) use of shared methodologies on confidential time series. The data is used for benchmarking activities and to define which methodologies clusters around a 'true value' of PLR. The combination of metrics (PR or power based) and methodologies are benchmarked in terms of deviation from the average value and in terms of standard deviation. The combination of temperature corrected PR with the use of Year on Year (YOY) or Seasonal Trend decomposition using Loess (STL) performs well for all systems; other methodologies seems to be more depending on the filtering applied. Another set of data is represented by the IEA PVPS Task 13 'PV performance database' which includes more than 120 PV plants from different climates. The applied methodologies were STL and the YoY approach. STL results in an averaged PLR over all systems of -0.78%/a while YoY yields -0.63%/a. STL is better suited if the time series data are of higher resolution and high-quality weather data are available. One important outcome of this study is the setting of a framework for the contribution to a clear and structured quality classification for PV time series data and a guideline for PLR calculations in dependency of the data categorization.

14 SOLAR ENERGY↗

Parallel Latent Semantic Analysis using a Graphics Processing Unit

Latent Semantic Analysis (LSA) can be used to reduce the dimensions of large Term-Document datasets using Singular Value Decomposition. However, with the ever expanding size of data sets, current implementations are not fast enough to quickly and easily compute the results on a standard PC. The Graphics Processing Unit (GPU) can solve some highly parallel problems much faster than the traditional sequential processor (CPU). Thus, a deployable system using a GPU to speedup large-scale LSA processes would be a much more effective choice (in terms of cost/performance ratio) than using a computer cluster. In this paper, we presented a parallel LSA implementation on the GPU, using NVIDIA Compute Unified Device Architecture (CUDA) and Compute Unified Basic Linear Algebra Subprograms (CUBLAS). The performance of this implementation is compared to traditional LSA implementation on CPU using an optimized Basic Linear Algebra Subprograms library. For large matrices that have dimensions divisible by 16, the GPU algorithm ran five to six times faster than the CPU version.

59 BASIC BIOLOGICAL SCIENCES↗

Synchronous and asynchronous optimized Schwarz methods for one-way subdivision of bounded domains

Convergence of both synchronous and asynchronous optimized Schwarz algorithms for the shifted Laplacian operator on a bounded rectangular domain, in a one-way subdivision of the computational domain, with overlap, is shown. Convergence results are obtained under very mild conditions on the size of the subdomains and on the amount of overlap. A couple of results are also given, relating the convergence rate of the asynchronous method to changes in the size of the domain. Numerical experiments illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

OBTAINING POTENTIAL FIELD SOLUTIONS WITH SPHERICAL HARMONICS AND FINITE DIFFERENCES

Potential magnetic field solutions can be obtained based on the synoptic magnetograms of the Sun. Traditionally, a spherical harmonics decomposition of the magnetogram is used to construct the current- and divergence-free magnetic field solution. This method works reasonably well when the order of spherical harmonics is limited to be small relative to the resolution of the magnetogram, although some artifacts, such as ringing, can arise around sharp features. When the number of spherical harmonics is increased, however, using the raw magnetogram data given on a grid that is uniform in the sine of the latitude coordinate can result in inaccurate and unreliable results, especially in the polar regions close to the Sun. We discuss here two approaches that can mitigate or completely avoid these problems: (1) remeshing the magnetogram onto a grid with uniform resolution in latitude and limiting the highest order of the spherical harmonics to the anti-alias limit; (2) using an iterative finite difference algorithm to solve for the potential field. The naive and the improved numerical solutions are compared for actual magnetograms and the differences are found to be rather dramatic. We made our new Finite Difference Iterative Potential-field Solver (FDIPS) a publicly available code so that other researchers can also use it as an alternative to the spherical harmonics approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Identification of Solid-Electrolyte Interphase Species by Joint Characterization of Li-Ion Battery Chemistry by Mass Spectrometry and Electrochemical Reaction Networks

The formation and stability of the solid-electrolyte interphase (SEI) play central roles in determining the long-term performance and safety of modern electrochemical energy storage systems. Despite decades of research, the SEI’s heterogeneous, dynamic, and multiphase nature has defied comprehensive molecular-level characterization, creating a critical knowledge gap that limits rational battery design. In this work, we introduce a computational−experimental framework that integrates high-throughput quantum chemistry calculations, data-driven electrochemical reaction networks (eCRNs), stochastic algorithms, and laser desorption/ionization Fourier transform ion cyclotron resonance mass spectrometry (LDI-FTICR-MS) to unravel SEI formation in carbonatebased electrolytes without imposing predefined mechanisms. We constructed the most comprehensive eCRN to date, spanning over 10,000 species and 209 million reactions. Through stochastic network analysis, we successfully recovered 27 species that were previously reported in the literature and predicted 28 novel SEI species nearly doubling our scientific knowledge in this area. Each new species was rigorously confirmed through advanced mass spectral analysis of its distinct molecular and isotopic signatures. We kinetically refined the formation pathways for a select set of both previously reported and novel SEI products, revealing kinetically feasible elementary reaction mechanisms with activation barriers below 1 eV. This computational−experimental approach deepens our molecular-level understanding of SEI chemistry by resolving which species form and through which decomposition mechanisms they emerge. Such knowledge provides the foundation necessary to connect electrolyte composition to the resulting SEI components, a critical step toward a more informed electrolyte development in next-generation lithium-based batteries.

25 ENERGY STORAGE↗

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Algorithms and analyses for stochastic optimization for turbofan noise reduction using parallel reduced-order modeling

Simulation-based optimization of acoustic liner design in a turbofan engine nacelle for noise reduction purposes can dramatically reduce the cost and time needed for experimental designs. Because uncertainties are inevitable in the design process, a stochastic optimization algorithm is posed based on the conditional value-at-risk measure so that an ideal acoustic liner impedance is determined that is robust in the presence of uncertainties. A parallel reduced-order modeling framework is developed that dramatically improves the computational efficiency of the stochastic optimization solver for a realistic nacelle geometry. The reduced stochastic optimization solver takes less than 500 s to execute. Additionally, well-posedness and finite element error analyses of the state system and optimization problem are provided.

97 MATHEMATICS AND COMPUTING↗

Massively Parallel Latent Semantic Analyzes using a Graphics Processing Unit

Latent Semantic Indexing (LSA) aims to reduce the dimensions of large Term-Document datasets using Singular Value Decomposition. However, with the ever expanding size of data sets, current implementations are not fast enough to quickly and easily compute the results on a standard PC. The Graphics Processing Unit (GPU) can solve some highly parallel problems much faster than the traditional sequential processor (CPU). Thus, a deployable system using a GPU to speedup large-scale LSA processes would be a much more effective choice (in terms of cost/performance ratio) than using a computer cluster. Due to the GPU s application-specific architecture, harnessing the GPU s computational prowess for LSA is a great challenge. We present a parallel LSA implementation on the GPU, using NVIDIA Compute Unified Device Architecture and Compute Unified Basic Linear Algebra Subprograms. The performance of this implementation is compared to traditional LSA implementation on CPU using an optimized Basic Linear Algebra Subprograms library. After implementation, we discovered that the GPU version of the algorithm was twice as fast for large matrices (1000x1000 and above) that had dimensions not divisible by 16. For large matrices that did have dimensions divisible by 16, the GPU algorithm ran five to six times faster than the CPU version. The large variation is due to architectural benefits the GPU has for matrices divisible by 16. It should be noted that the overall speeds for the CPU version did not vary from relative normal when the matrix dimensions were divisible by 16. Further research is needed in order to produce a fully implementable version of LSA. With that in mind, the research we presented shows that the GPU is a viable option for increasing the speed of LSA, in terms of cost/performance ratio.

99 GENERAL AND MISCELLANEOUS↗

High-order discretization of a gyrokinetic Vlasov model in edge plasma geometry

We describe a new spatial discretization of a continuum gyrokinetic Vlasov model in axisymmetric tokamak edge plasma geometries. The geometries are represented using a multiblock decomposition in which logically distinct blocks are smoothly mapped from rectangular computational domains and are aligned with magnetic flux surfaces to accommodate strong anisotropy induced by the magnetic field. We employ a fourth-order, finite-volume discretization in mapped coordinates to mitigate the computational expense associated with discretization on 4D phase space grids. Applied to a conservative formulation of the gyrokinetic system, a finite-volume approach expresses local conservation discretely in a natural manner involving the calculation of normal fluxes at cell faces. In the approach presented here, the normal fluxes are computed in terms of face-averaged velocity normals in such a way that (i) the divergence-free property of the gyrokinetic velocity is preserved discretely to machine precision, (ii) the configuration space normal velocities are independent of mapping metrics, and (iii) the configuration space normal velocities are computed from exact pointwise evaluation of magnetic field data except for one term. The algorithms described in this paper form the foundation of a continuum gyrokinetic edge code named COGENT, which is used here to perform a convergence study verifying the accuracy of the spatial discretization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗

Metagenome-assembled genomes from soil samples in control and warming plots in Blodgett Forest, CA (2014-2021)

The pathways of carbon transport and loss through and from soils—soil organic matter (SOM) depolymerization to dissolved organic carbon and mineralization to carbon dioxide (CO2)—are fundamentally driven by microbial activity, which is strongly regulated by environmental conditions. As part of LBNL (Lawrence Berkeley National Laboratory) TES (Terrestrial Ecosystem Science) Belowground Biogeochemistry Science Focus Area (SFA), we have established a novel whole-soil long-term warming experiment at the University of California (UC) Blodgett Forest Research Station (Sierra Nevada) in 2014, where we study the role of biogeochemical, microbial and geochemical process interactions in SOM decomposition and stabilization.Here, we present metagenome-assembled genomes (MAGs) for the bacterial and archaeal community from soil depth profiles collected from 2014 to 2021 from three paired control and warming plots. We collected soil samples across a range of depth profiles (spanning surface to 90 cm deep) from three paired control and warming plots from a temperate mixed forest in Northern California. Each paired plot had been subjected to experimental warming since June 2014 to simulate a predicted climate change scenario for northern California. 101 soil metagenomes were sequenced at JGI (Joint Genome Institute) and UCSF (University of California San Francisco) Center for Advanced Technology and can be found under the JGI (Joint Genome Institute) GOLD (Genomes Online Database) Sequencing project Gs0151586 and NCBI (National Center for Biotechnology Information) Projects PRJNA1225762 and PRJEB39497. Metagenomes were assembled using JGI (Joint Genome Institute) Metagenome Workflow (10.1128/mSystems.00804-20). For each metagenome, the assembled contigs were binned into genomes using 3 binning algorithms (cocacola, metabat, and maxbin) and the resulting bins were consolidated using dastool. The consolidated bins from all metagenomes were pooled, filtered by completeness (>50%) and contamination (<25%), and dereplicated at 99% ANI (average nucleotide identity) using dRep (https://github.com/MrOlm/drep).The dataset includes a zip file of 2321 MAG (Metagenome Assembled Genome) fasta files, the accession numbers for the underlying metagenomes, and a csv file with MAG (Metagenome Assembled Genome) quality metrics and taxonomic classification (GTDB -Genome Taxonomy Database-RS220). This dataset also includes a file-level metadata (flmd.csv) file that lists each file contained in the dataset with associated metadata and a data dictionary (dd.csv) file that contains column/row headers used throughout the files along with a definition, units, and data type. A sample metadata file (samples.csv) that contains site information has also been included.

54 ENVIRONMENTAL SCIENCES↗

MASSIVELY PARALLEL LATENT SEMANTIC ANALYSES USING A GRAPHICS PROCESSING UNIT

Latent Semantic Analysis (LSA) aims to reduce the dimensions of large term-document datasets using Singular Value Decomposition. However, with the ever-expanding size of datasets, current implementations are not fast enough to quickly and easily compute the results on a standard PC. A graphics processing unit (GPU) can solve some highly parallel problems much faster than a traditional sequential processor or central processing unit (CPU). Thus, a deployable system using a GPU to speed up large-scale LSA processes would be a much more effective choice (in terms of cost/performance ratio) than using a PC cluster. Due to the GPU’s application-specifi c architecture, harnessing the GPU’s computational prowess for LSA is a great challenge. We presented a parallel LSA implementation on the GPU, using NVIDIA® Compute Unifi ed Device Architecture and Compute Unifi ed Basic Linear Algebra Subprograms software. The performance of this implementation is compared to traditional LSA implementation on a CPU using an optimized Basic Linear Algebra Subprograms library. After implementation, we discovered that the GPU version of the algorithm was twice as fast for large matrices (1 000x1 000 and above) that had dimensions not divisible by 16. For large matrices that did have dimensions divisible by 16, the GPU algorithm ran fi ve to six times faster than the CPU version. The large variation is due to architectural benefi ts of the GPU for matrices divisible by 16. It should be noted that the overall speeds for the CPU version did not vary from relative normal when the matrix dimensions were divisible by 16. Further research is needed in order to produce a fully implementable version of LSA. With that in mind, the research we presented shows that the GPU is a viable option for increasing the speed of LSA, in terms of cost/performance ratio.

Cavanagh, J↗

Enhancing SRF cavity stability and minimizing detuning with data-driven resonance control based on dynamic mode decomposition

Effective resonance control of superconducting radio frequency (SRF) cavities is critical for large machines like LCLS-II, as failure to achieve proper control can result in increased RF power consumption, higher cryogenic heat loads, and increased costs. To address this challenge, we have developed a machine learning (ML) model based on the dynamic mode decomposition method to represent the forced cavity dynamics. Using this model, we designed a model predictive controller (MPC) and demonstrated through simulation that the MPC can effectively stabilize the amplitude and phase of SRF cavities using only a frequency actuator, even in the presence of multiple mechanical modes. The lightweight and explicit ML model makes the controller suitable for direct implementation on field-programmable gate arrays, unlocking the full potential of SRF linacs like LCLS-II, enabling higher beam power and energy, and also serving as an advanced motion controller for various applications, such as photon beamlines and storage rings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Disjunctive optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems

This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A variance-based decomposition and global sensitivity index method for uncertainty quantification: Application to retrieved ice cloud properties

This study develops a novel uncertainty quantification (UQ) method for cloud microphysical property retrievals using variance-based decomposition and global sensitivity index. In this UQ framework, empirical orthogonal function (EOF) analysis is applied to the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) ground-based observations, which are the inputs for the cloud retrieval studied here. The principal components (PCs) in the EOF expansion are parameterized as random input variables, and hence, the input dimension is greatly reduced (up to a factor of 50), allowing large ensemble of random samplings. The EOF expansion improves the accuracy of the uncertainty estimation by taking into account the cross correlations in the input data profiles. Here, this method enables a probabilistic representation of a retrieval process by adding normally distributed perturbations into PCs of sample means of input data profiles within a time window. Therefore, it effectively facilitates objective validation of climate models against cloud retrievals under a probabilistic framework for rigorous statistical inferences. Moreover, the variance-based global sensitivity index analysis, part of this method, attributes the output uncertainties to each individual source, thus providing directions for improving retrieval algorithms and observation strategies. For demonstration, we apply this method to quantify the uncertainties of the ARM program's baseline cloud retrieval algorithm for an ice cloud case observed at the Southern Great Plains site on 9 March 2000.

54 ENVIRONMENTAL SCIENCES↗

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

Analysis of a New Implicit Solver for a Semiconductor Model

Here, we present and analyze a new iterative solver for implicit discretizations of a simplified Boltzmann--Poisson system. The algorithm builds on recent work that incorporated a sweeping algorithm for the Vlasov--Poisson equations as part of nested inner-outer iterative solvers for the Boltzmann--Poisson equations. The new method eliminates the need for nesting and requires only one transport sweep per iteration. It arises as a new fixed-point formulation of the discretized system which we prove to be contractive for a given electric potential. We also derive an accelerator to improve the convergence rate for systems in the drift-diffusion regime. We numerically compare the efficiency of the new solver, with and without acceleration, against a recently developed nested iterative solver.

97 MATHEMATICS AND COMPUTING↗