Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse factorization”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Chemomechanical origin of morphological disparity in lithium metal electrodeposition

The morphology of electrochemically deposited lithium (Li) critically governs the cycling stability and safety of Li metal batteries, yet the underlying controlling factors remain poorly understood. Even within the same coin cell, Li deposits can exhibit strikingly different morphologies, for example, sparse whiskers coexisting with particle-like deposits, indicting strong local variations in growth conditions. By combining cryogenic transmission electron microscopy with phase-field modeling, we here identify the root cause of this disparity. We reveal that the morphological divergence originates from the variations in structure and chemical composition of the initial SEI layer formed on the copper (Cu) substrate. These variations arise from substrate defects that induce localized electrochemical fields, driving selective dissociation of either solvent or salt, producing SEI layers with distinct chemomechanical properties. Solvent-derived organic SEI favors whisker growth, whereas salt-derived SEI promotes particle formation. This study establishes a direct mechanistic link between SEI chemomechanical properties and Li morphology, providing design principles for tailoring SEI layers to control Li deposition

energy storage↗
DOE OSTI2020

A matrix-free approach for finite-strain hyperelastic problems using geometric multigrid

This paper investigates matrix-free algorithms for problems in quasi-static finite-strain hyperelasticity. Iterative solvers with matrix-free operator evaluation have emerged as an attractive alternative to sparse matrices in the fluid dynamics and wave propagation communities because they significantly reduce the memory traffic, the limiting factor in classical finite element solvers. Specifically, we study different matrix-free realizations of the finite element tangent operator and determine whether generalized methods of incorporating complex constitutive behavior might be feasible. Furthermore, in order to improve the convergence behavior of iterative solvers, we also propose a method by which to construct level tangent operators and employ them to define a geometric multigrid preconditioner. Additionally, the performance of the matrix-free operator and the geometric multigrid preconditioner is compared to the matrix-based implementation with an algebraic multigrid (AMG) preconditioner on a single node for a representative numerical example of a heterogeneous hyperelastic material in two and three dimensions. We find that matrix-free methods for finite-strain solid mechanics are very promising, outperforming linear matrix-based schemes by two to five times, and that it is possible to develop numerically efficient implementations that are independent of the hyperelastic constitutive law.

42 ENGINEERING↗
DOE OSTI2017

Tensor Toolbox for MATLAB v. 3.0

Tensors (also known as multidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to network analysis. The Tensor Toolbox provides classes for manipulating dense, sparse, and structured tensors using MATLAB's object-oriented features. It also provides algorithms for tensor decomposition and factorization, algorithms for computing tensor eigenvalues, and methods for visualization of results.

Kolda, Tamara↗
DOE OSTI2019

Machine learning framework for assessment of microbial factory performance

Metabolic models can estimate intrinsic product yields for microbial factories, but such frameworks struggle to predict cell performance (including product titer or rate) under suboptimal metabolism and complex bioprocess conditions. On the other hand, machine learning, complementary to metabolic modeling necessitates large amounts of data. Building such a database for metabolic engineering designs requires significant manpower and is prone to human errors and bias. We propose an approach to integrate data-driven methods with genome scale metabolic model for assessment of microbial bio-production (yield, titer and rate). Using engineered E. coli as an example, we manually extracted and curated a data set comprising about 1200 experimentally realized cell factories from ~100 papers. We furthermore augmented the key design features (e.g., genetic modifications and bioprocess variables) extracted from literature with additional features derived from running the genome-scale metabolic model iML1515 simulations with constraints that match the experimental data. Then, data augmentation and ensemble learning (e.g., support vector machines, gradient boosted trees, and neural networks in a stacked regressor model) are employed to alleviate the challenges of sparse, non-standardized, and incomplete data sets, while multiple correspondence analysis/principal component analysis are used to rank influential factors on bio-production. The hybrid framework demonstrates a reasonably high cross-validation accuracy for prediction of E.coli factory performance metrics under presumed bioprocess and pathway conditions (Pearson correlation coefficients between 0.8 and 0.93 on new data not seen by the model).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Network Scale Ubiquitous Volume Estimation Using Tree-Based Ensemble Learning Methods

Currently real-time, ubiquitous volume data for roadway networks remains the key missing dimension in traffic operations. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper explores the use of state-of-art machine learning techniques to estimate accurate real-time volume measures that span the highway network providing ubiquitous coverage in space, and point-in-time measures for a specific date and time. Three tree-based ensemble learning models, random forest (RF), gradient boost machine (GBM), and extreme gradient boost (XGBoost), were tested for volume estimation by learning from combined dataset of commercial probe data provided by TomTom, the FHWA's Travel Monitoring Analysis System (TMAS) data, and other infrastructure attributes such as number of lanes, speed limit, and weather. The methods were tested on major corridors and freeways in the metropolitan area of Denver. All three machine learning methods were able to provide hourly volume estimates 24 hours a day, 7 days a week, and 365 days a year with around 18% mean absolute error to true volume and about 5% of error with respect to roadway capacity. The low error measures allow the potential application by transportation agencies.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Network-Scale Ubiquitous Volume Estimation Using Tree-Based Ensemble Learning Methods

Currently ubiquitous volume data for roadway networks remains the key missing dimension in traffic operations. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper/poster explores the use of state-of-art machine learning techniques to estimate accurate volume measures that span the highway network providing ubiquitous coverage in space, and point-in-time measures for a specific date and time. Three tree-based ensemble learning models, random forest (RF), gradient boost machine (GBM), and extreme gradient boost (XGBoost), were tested for volume estimation by learning from combined dataset of commercial probe data provided by TomTom, the FHWA's Travel Monitoring Analysis System (TMAS) data, and other infrastructure attributes such as number of lanes, speed limit, and weather. The methods were tested on major corridors and freeways in the metropolitan area of Denver. All three machine learning methods were able to provide hourly volume estimates 24 hours a day, 7 days a week, and 365 days a year with around 18% mean absolute error to true volume and about 5% of error with respect to roadway capacity. The low error measures allow the potential application by transportation agencies.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2015

Towards Characterizing the Variability in the Loading Demands of an Unmanned Aerial Vehicle

This paper presents a computational methodology to characterize and quantify the variability in the power demands during the take-off of an unmanned aerial vehicle (UAV). A lithium-ion battery-based power system is used to power the unmanned aerial vehicle, and the capabilities of the unmanned aerial vehicle are driven by the amount of charge in this battery. In order to design the power system, it is necessary to analyze the power and charge requirements of the UAV. This paper focuses on the take-off segment, and aims to quantify the amount of charge that is required for this particular segment. Sparse data is available through different flight tests and this data is used to analyze the flight profile and the charge requirement during take-off. The amount of charge required for take-off depends on several factors that are not only variable but cannot be controlled in reality, and hence, the entire flight profile and the corresponding charge requirement are variable in nature. The information available through flight tests is converted into multi-dimensional sparse data and a new method is developed in this paper for variability characterization using multi-dimensional sparse data. This analysis is useful for prognostics and health management where it is necessary to anticipate future charge requirements in order to compute the end-of-discharge of the battery, and hence, the remaining useful life of the power system.

unmanned aerial vehicle↗
DOE OSTI2016

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2024

Towards a self-consistent model of the convective core boundary in upper main sequence stars: I. 2.5D and 3D simulations

There is strong observational evidence that the convective cores of intermediate-mass and massive main sequence stars are substantially larger than those predicted by standard stellar-evolution models. However, it is unclear what physical processes cause this phenomenon or how to predict the extent and stratification of stellar convective boundary layers. Convective penetration is a thermal-timescale process that is likely to be particularly relevant during the slow evolution on the main sequence. We use our low-Mach-number S EVEN -L EAGUE H YDRO code to study this process in 2.5D and 3D geometries. Starting with a chemically homogeneous model of a 15 M ⊙ zero-age main sequence star, we construct a series of simulations with the luminosity increased and opacity decreased by the same factor, ranging from 10 3 to 10 6 . After reaching thermal equilibrium, all of our models show a clear penetration layer; its thickness becomes statistically constant in time and it is shown to converge upon grid refinement. The penetration layer becomes nearly adiabatic with a steep transition to a radiative stratification in simulations at the lower end of our luminosity range. This structure corresponds to the adiabatic ‘step overshoot’ model often employed in stellar-evolution calculations. The simulations with the highest and lowest luminosity differ by less than a factor of two in the penetration distance. The high computational cost of 3D simulations makes our current 3D data set rather sparse. Depending on how we extrapolate the 3D data to the actual luminosity of the initial stellar model, we obtain penetration distances ranging from 0.09 to 0.44 pressure scale heights, which is broadly compatible with observations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

The ITensor Software Library for Tensor Network Calculations

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗
DOE OSTI2022

Codebase release 0.3 for ITensor

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗
NASA NTRS2016

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗
DOE OSTI2016

ALMACAL I: FIRST DUAL-BAND NUMBER COUNTS FROM A DEEP AND WIDE ALMA SUBMILLIMETER SURVEY, FREE FROM COSMIC VARIANCE

We have exploited ALMA calibration observations to carry out a novel, wide, and deep submillimeter (submm) survey, almacal. These calibration data comprise a large number of observations of calibrator fields in a variety of frequency bands and array configurations. By gathering together data acquired during multiple visits to many ALMA calibrators, it is possible to reach noise levels which allow the detection of faint, dusty, star-forming galaxies (DSFGs) over a significant area. In this paper, we outline our survey strategy and report the first results. We have analyzed data for 69 calibrators, reaching depths of ∼25 μ Jy beam{sup −1} at sub-arcsec resolution. Adopting a conservative approach based on ≥5 σ detections, we have found 8 and 11 DSFGs in ALMA bands 6 and 7, respectively, with flux densities S {sub 1.2} m {sub m} ≥ 0.2 mJy. The faintest galaxies would have been missed by even the deepest Herschel surveys. Our cumulative number counts have been determined independently at 870 μ m and 1.2 mm from a sparse sampling of the astronomical sky, and are thus relatively free of cosmic variance. The counts are lower than reported previously by a factor of at least 2×. Future analyses will yield large, secure samples of DSFGs with redshifts determined via the detection of submm spectral lines. Uniquely, our strategy then allows for morphological studies of very faint DSFGs—representative of more normal star-forming galaxies than conventional submm galaxies—in fields where self-calibration is feasible, yielding milliarcsecond spatial resolution.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Monaural Music Source Separation using Convolutional Sparse Coding

We present a comprehensive performance study of a new time-domain approach for estimating the components of an observed monaural audio mixture. Unlike existing time-frequency approaches that use the product of a set of spectral templates and their corresponding activation patterns to approximate the spectrogram of the mixture, the proposed approach uses the sum of a set of convolutions of estimated activations with prelearned dictionary filters to approximate the audio mixture directly in the time domain. The approximation problem can be solved by an efficient convolutional sparse coding algorithm. The effectiveness of this approach for source separation of musical audio has been demonstrated in our prior work, but under rather restricted and controlled conditions, requiring the musical score of the mixture being informed a priori and little mismatch between the dictionary filters and the source signals. In this paper, we report an evaluation that considers wider, and more practical, experimental settings. This includes the use of an audio-based multipitch estimation algorithm to replace the musical score, and an external dataset of audio single notes to construct the dictionary filters. Here, our result shows that the proposed approach remains effective with a larger dictionary, and compares favorably with the state-of-the-art nonnegative matrix factorization approach. However, in the absence of the score and in the case of a small dictionary, our approach may not be better.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The effect of heat treatment on the defect evolution in LPBF 316H stainless steel

This work investigates the effect of processing and heat treatment on defect evolution and irradiation response of laser powder bed fusion (LPBF) 316H stainless steel, with comparisons to LPBF 316L and wrought 316L/316H. Using in-situ and ex-situ ion irradiations across a wide parameter space—temperature (300–675 °C), dose (0.2–25 dpa), dose rate (10 -3 –10 -5 dpa/s), and helium co-implantation (20–2500 appm)—we correlated void swelling, dislocation loop evolution, and segregation behavior with pre-irradiation microstructures (as-built, stress-relieved, solution-annealed, and cold-worked). Results show that swelling is strongly controlled by dislocation density: intermediate densities maximize swelling, while solution annealing or cold working reduce susceptibility to levels comparable to wrought alloys. Low dose rates and helium both promote cavity nucleation and lower the incubation barrier, with helium suppressing the role of dislocation density and driving swelling behavior toward wrought-like response. Loop evolution in SA LPBF 316H resembles wrought 316L but shows localized denuded zones near low-angle grain boundaries. STEM-EDS mapping further revealed Ni segregation at voids and sparse Al-rich oxides, without evidence of Ni–Si precipitates. Collectively, these findings identify dislocation density, helium content, and dose rate as the factors governing swelling in LPBF 316H and provide mechanistic datasets for model validation, supporting LAIN and the qualification of AM austenitic steels for nuclear service.

316 stainless steel↗
NASA NTRS1992

Monitoring Global Temperatures From Satellites

Report provides evidence that passive microwave radiometry from satellites provides more-precise information on atmospheric temperatures than sparse distribution of thermometers. Accurate temperatures needed for detection of "greenhouse" warming, evaluation of computer models of change in climate, and for understanding important factors in climate system.

Spencer, Roy W.↗
DOE OSTI2022

Integrated Modeling of U.S. Agricultural Soil Emissions of Reactive Nitrogen and Associated Impacts on Air Pollution, Health, and Climate

Agricultural soils are leading sources of reactive nitrogen (Nr) species including nitrogen oxides (NO x ), ammonia (NH 3 ), and nitrous oxide (N 2 O). Here, the propensity of NO x and NH 3 to generate ozone and fine particulate matter (PM) and associated impacts on health are highly variable, whereas the climate impacts of long-lived N 2 O are independent of emission timing and location. However, these impacts have rarely been compared on a spatially-resolved, monetized basis. In this study, we update the nitrogen scheme in an agroecosystem model to simulate the agricultural emissions of Nr from across the United States. We then apply a reduced-form air pollution health effects model to assess air quality impacts from NO x and NH 3 and a social cost of N 2 O to assess the climate impacts. Assuming an $\$$8.2 million Value of a Statistical Life (VSL) and a $\$$13,100/ton social cost of N 2 O, the air quality impacts are a factor of ~7 to 15 times as large as the climate impacts in heavily populated coastal regions, whereas the ratios are closer to 2.5 in sparsely populated regions. Our results show that air pollution, health, and climate should be considered jointly in future assessments of how farming practices affect Nr emissions.

54 ENVIRONMENTAL SCIENCES↗