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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗
DOE OSTI2024

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

LA17-V-InverseRadTransportProblem-PD2Kb. Final Project Report

In the inverse radiation transport problem, a radiation signal emanating from an unknown object is used to reconstruct geometric and material parameters of the object , e.g., the mass of special nuclear material (SNM), the isotopic composition of the SNM (e.g., the enrichment of 235U), the thickness of shielding, etc. The inverse radiation transport problem is one of the most fundamental and important in the emergency response mission, and has been addressed in previous NA-22 and NA-42/84 investments by using derivative-free optimization methods. Our project was aimed at (i) consolidating previous work by applying polynomial chaos expansion (PCE) for reducing significantly the number of forward model simulations required by derivative-free optimization methods; (ii) developing a general-purpose framework and stand-alone software for solving the inverse radiation transport problem by applying a new “predictive modeling” methodology (predictive modeling of coupled multi-physics systems, PM_CMPS) which enables the fusing of experimental and computational information; and (iii) developing several benchmarks (for unscattered gamma rays) for demonstrating the quantification of non-Gaussian features (e.g., skewness and kurtosis, which characterize asymmetries and long tails) of response distributions by deterministically and efficiently propagating parameter uncertainties (covariances and higher-order moments, where available) using high-order sensitivities computed by the recently developed comprehensive adjoint sensitivity analysis methodology (C-ASAM). With regard to (i), application of PCE, the most significant accomplishment of this project was an implementation of PCE into INVERSE that significantly reduced computation time for the DiffeRential Evolution Adaptive Metropolis (DREAM) and Differential Evolution (DE) methods. For inverse transport problems with measurements of neutron leakage, neutron multiplication, and neutron-induced gamma-rays, the solution times for the DREAM and DE methods were reduced by factors of 30-300, reducing run times from hours to minutes while maintaining the same accuracy as the standard (non-PCE) DREAM and DE. Speedups were further improved by exploring sparse grid quadrature sets using the Toolkit for Adaptive Stochastic Modeling and Non-Intrusive ApproximatioN (Tasmanian) toolset. An initial exploration of sparse grids indicated that further speedups factors of 5-10 are obtainable. The implementation of PCE in INVERSE is not in a form that users can easily access. With regard to (ii), solving the inverse problem using a predictive modeling paradigm, the most significant accomplishment of this project were the derivation and implementation of adjoint-based second derivatives in neutron and photon transport theory. There are two codes that compute these derivatives. SENSPG computes them for uncollided gamma rays and SENSMG computes them for neutron leakage. SENSMG is open-source code available on github. Other significant accomplishments included a stand-alone code, MULTI-PRED, that implements the predictive modeling paradigm, along with a detailed manual. The code was implemented in the existing INVERSE code for inverse problems, but a head-to-head comparison of inverse methods was not achieved. We also derived and implemented the capability to compute sensitivities for multiplicity measurements into the SENSMG code, and this capability was used in a data assimilation application, but it was not used for solving inverse problems. With regard to (iii), developing benchmarks to demonstrate the importance of high-order sensitivity and uncertainty analysis, the most significant accomplishment of this project were two test problems that showed how important second-order sensitivities are.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Incomplete Sparse Approximate Inverses for Parallel Preconditioning

In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Combining landscape suitability and habitat connectivity to conserve the last surviving population of cheetah in Asia

Abstract Aim The Asiatic cheetah, Acinonyx jubatus venaticus , a critically endangered large felid, has disappeared from vast tracks of its historical range across south‐western Asia. It is currently confined to the arid ecosystems of central Iran for which little is known about its distribution and habitat linkages. We proposed the first evaluation of Asiatic cheetah's distribution and developed models of landscape suitability and connectivity to inform future conservation planning. Location Central Iran. Methods We analysed presence data of a 14‐year‐long cheetah monitoring programme according to environmental and anthropogenic factors, and generated an ensemble model of habitat suitability based on seven species distribution models ( SDM s). We then used the concept of circuit theory and landscape connectivity prioritization ( LCP ) on resultant core habitats and landscape suitability to evaluate potential linkages between core areas. Results Core habitats, that is, the areas hosting the largest continuous suitable habitats for Asiatic cheetahs, covered approximately 49,144 km 2 ( c . 6.3% of the study area). Availability of prey species, avoidance of human‐dominated areas and their infrastructures, and rough landscapes covered with sparse vegetation were the most predictive factors of the core habitats for the last cheetah population in Asia. Although relatively vast, the area of potential core habitats available to cheetahs appeared to be fragmented with limited connectivity between the northern and southern parts of this distribution. Main conclusions Our approach highlights the importance of distribution models to recognize, at a coarse‐scale level, a spatial population structure and habitat suitability characteristics for a large carnivore surviving at very low density. We have identified specific areas of suitable habitat where developing new landscape protection and adaptive conservation management; and improving the safety of important linkages between core habitats are likely to promote the conservation of the last surviving population of cheetah in Asia.

Ahmadi, Mohsen↗
DOE OSTI2016

Bacteria increase arid-land soil surface temperature through the production of sunscreens

Soil surface temperature, an important driver of terrestrial biogeochemical processes, depends strongly on soil albedo, which can be significantly modified by factors such as plant cover. In sparsely vegetated lands, the soil surface can be colonized by photosynthetic microbes that build biocrust communities. Here we use concurrent physical, biochemical and microbiological analyses to show that mature biocrusts can increase surface soil temperature by as much as 10 °C through the accumulation of large quantities of a secondary metabolite, the microbial sunscreen scytonemin, produced by a group of late-successional cyanobacteria. Scytonemin accumulation decreases soil albedo significantly. Such localized warming has apparent and immediate consequences for the soil microbiome, inducing the replacement of thermosensitive bacterial species with more thermotolerant forms. In conclusion, these results reveal that not only vegetation but also microorganisms are a factor in modifying terrestrial albedo, potentially impacting biosphere feedbacks on past and future climate, and call for a direct assessment of such effects at larger scales.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Development of a Framework and Methodology for an Advanced Reactor Materials Environmental Effects Design Guide

Advanced non-light-water reactor components may operate at elevated temperature while experiencing cyclic loading, significant neutron irradiation, and exposure to reactor coolant. ASME Boiler and Pressure Vessel Code, Section III, Division 5, provides design rules for elevated-temperature service but does not include specific procedures to account for environmental effects on material properties. This report develops an initial framework and methodology for an Environmental Effects Design Guide (EEDG) focused on neutron irradiation; coolant-environment effects are reserved for future work. The proposed approach treats irradiation as a property-based overlay on the existing Division 5 design process, with two routes: a sparse-data route applying two reduction factors — FCR on creep-rupture strength and FF on fatigue life — for the creep-fatigue evaluations that typically control the design of advanced high-temperature reactor components, and a fuller framework developing the property-to-rule chain across the four Division 5 checks (primary load, strain limits and ratcheting, creep-fatigue, and buckling), together with swelling and weldments as scope items. Both routes are scoped by an in-pile qualification that restricts the use of post-irradiation-examination-derived properties in regimes where an in-pile mechanism could control the design outcome. Illustrative outputs derived on a compiled annealed Type 316 database — FCR ≈ 0.78–0.86 and FF ≈ 0.4 — demonstrate the calculation method within that specific dataset. The framework is an initial, testable design-rule concept; it identifies a practical path for preliminary design evaluations under sparse data and the material data and testing needed to develop the framework further.

Barua, Bipul (ORCID:0000000247184113)↗
DOE OSTI2017

Non-Intrusive Energy Disaggregation Using Non-Negative Matrix Factorization With Sum-to-k Constraint

Energy disaggregation or non-intrusive load monitoring addresses the issue of extracting device-level energy consumption information by monitoring the aggregated signal at one single measurement point without installing meters on each individual device. Energy disaggregation can be formulated as a source separation problem, where the aggregated signal is expressed as linear combination of basis vectors in a matrix factorization framework. In this paper, an approach based on Sum-to-k constrained non-negative matrix factorization (S2K-NMF) is proposed. By imposing the sum-to-k constraint and the non-negative constraint, S2K-NMF is able to effectively extract perceptually meaningful sources from complex mixtures. The strength of the proposed algorithm is demonstrated through two sets of experiments: Energy disaggregation in a residential smart home; and heating, ventilating, and air conditioning components energy monitoring in an industrial building testbed maintained at the Oak Ridge National Laboratory. Furthermore, extensive experimental results demonstrate the superior performance of S2K-NMF as compared to state-of-the-art decomposition-based disaggregation algorithms.

42 ENGINEERING↗
DOE OSTI2016

Reducing Computation and Communication in Scientific Computing: Connecting Theory to Practice.

This report summarizes the work produced as part of a Truman Fellowship appointment and its associated LDRD project. The overall goal of the project was to develop better algorithms and implementations for key computational kernels within the field of scientific computing by designing them to be communication efficient, moving as little data as possible. The primary problem of interest was dense matrix multiplication; other computations that were addressed include sparse matrix-matrix multiplication, QR factorization, solving symmetric linear systems, and the symmetric eigendecomposition. The project also involved the study of computations at the intersection of scientific computing and data analysis, including nonnegative matrix factorization for discovering latent factors, Tucker tensor decomposition for data compression, and sampling methods for similarity search.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Abstract There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Out With the Old: Empirical Trends in U.S. Land‐Based Wind Turbine Decommissioning and Repowering

A growing number of wind turbines (WTs) across the globe are now reaching or exceeding their expected service lifetime; WT decommissioning is on the rise. Accordingly, questions pertaining to WT end-of-life have risen in importance in policy and practice. Yet, research on the various factors relating to WT decommissioning is relatively sparse. Moreover, the key assumptions underpinning that prior research (e.g., the lifespan of WTs, characteristics of WTs being decommissioned, and whether the site is repowered with new WTs) have never been empirically tested across a large set of decommissioned WTs. Leveraging a uniquely comprehensive and spatially explicit dataset of decommissioned WTs in the United States, this research analyzes spatial, technological, and temporal trends in WT decommissioning and develops a novel predictive model for WT decommissioning. Our analysis pinpoints more than 12,400 WTs that have been fully decommissioned in the United States., the majority of which have been relatively old (> 30 years) and small (< 200 kW). While a WT's age alone is a good predictor of the likelihood of decommissioning, other factors such as the size of the WT and recent performance are also important and significant predictors. Most sites where decommissioning has occurred have seen subsequent repowering, with repowered plants featuring substantially fewer WTs (−86 on average) and higher rated plant capacity (+62 MW on average). Many existing WTs in the U.S. are approaching the end of their expected life with roughly 7500 being 20 or more years old. Findings can help policymakers and stakeholders begin preparing for this potential wave of future decommissioning and repowering.

Decommissioning / End-of-life↗
DOE OSTI2018

A New Directional Canopy Emissivity Model Based on Spectral Invariants

A new directional canopy emissivity model (CE-P) based on spectral invariants is proposed in this study. First, we prove the existence of the spectral invariant properties in the thermal infrared (TIR) band using a Monte Carlo model. Based on it, the equation of the new model is derived from the perspective of absorption. In this expression, single-scattering and multiscattering effects are separated analytically in the TIR band. We find that the overall contribution of multiple scatterings is less than 0.005 when the component emissivities are over 0.90, and the overall contribution decreases with increasing leaf or soil emissivity. Furthermore, the new model can avoid the logical difficulty encountered when using the traditional cavity effect factor to simulate the emissivity of a sparse vegetation canopy. The results of 4SAIL and Discrete Anisotropic Radiative Transfer (DART) are selected to do cross validation. The CE-P can achieve a high accuracy compared with 4SAIL and DART, with an absolute bias less than 0.002 when the leaf (soil) emissivity is equal to 0.98 (0.94). Four widely used analytical models are selected for comparison. The resulting accuracies of these models are ordered from CE-P to REN15, FR97, FR02, and VALOR96 with the most serious error up to 0.002, 0.002, 0.007, 0.013, and 0.014, respectively. Finally, three main conclusions are obtained through the sensitivity analysis: the multiscattering between vegetation and the background can be ignored when the leaf (soil) emissivity is no less than 0.94 (0.90), the second and higher order scattering within the vegetation can also be ignored when the leaf (soil) emissivity is no less than 0.94 (0.90), and the single-scattering effect within the canopy should be considered which can be calculated using three view factors.

58 GEOSCIENCES↗
DOE OSTI2016

Implementing an Accurate and Rapid Sparse Sampling Approach for Low-Dose Atomic Resolution STEM Imaging

Aberration correction for scanning transmission electron microscopes (STEM) has dramatically increased spatial image resolution for beam-stable materials, but it is the sample stability rather than the microscope that often limits the practical resolution of STEM images. To extract physical information from images of beam sensitive materials it is becoming clear that there is a critical dose/dose-rate below which the images can be interpreted as representative of the pristine material, while above it the observation is dominated by beam effects. Here we describe an experimental approach for sparse sampling in the STEM and in-painting image reconstruction in order to reduce the electron dose/dose-rate to the sample during imaging. By characterizing the induction limited rise-time and hysteresis in scan coils, we show that sparse line-hopping approach to scan randomization can be implemented that optimizes both the speed of the scan and the amount of the sample that needs to be illuminated by the beam. The dose and acquisition time for the sparse sampling is shown to be effectively decreased by factor of 5x relative to conventional acquisition, permitting imaging of beam sensitive materials to be obtained without changing the microscope operating parameters. As a result, the use of sparse line-hopping scan to acquire STEM images is demonstrated with atomic resolution aberration corrected Z-contrast images of CaCO 3 , a material that is traditionally difficult to image by TEM/STEM because of dose issues.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Quantum simulation of second-quantized Hamiltonians in compact encoding

We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. Here, we show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations for the required oracles, and analyze the methods. We also describe several example applications including the free boson and fermion theories, the φ 4 -theory, and the massive Yukawa model, all in both equal-time and light-front quantization. Our methods provide a general-purpose tool for simulating second-quantized Hamiltonians, with optimal or near-optimal scaling with error and model parameters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

14-3-3 protein mediates plant seed oil biosynthesis through interaction with AtWRI1

Plant 14-3-3 proteins are phosphopeptide-binding proteins, belonging to a large family of proteins involved in numerous physiological processes including primary metabolism, although knowledge about the function of 14-3-3s in plant lipid metabolism is sparse. WRINKLED1 (WRI1) is a key transcription factor that governs plant oil biosynthesis. At present, AtWRI1-interacting partners remain largely unknown. Here in this work, we show that 14-3-3 proteins are able to interact with AtWRI1, both in yeast and plant cells. Transient co-expression of 14-3-3- and AtWRI1-encoding cDNAs led to increased oil biosynthesis in Nicotiana benthamiana leaves. Stable transgenic plants overproducing a 14-3-3 protein also displayed increased seed oil content. Co-production of a 14-3-3 protein with AtWRI1 enhanced the transcriptional activity of AtWRI1. The 14-3-3 protein was found to increase the stability of AtWRI1. A possible 14-3-3 binding motif was identified in one of the two AP2 domains of AtWRI1, which was also found to be critical for the interaction of AtWRI1 with an E3 ligase linker protein. Thus, we hypothesize a regulatory mechanism by which the binding of 14-3-3 to AtWRI1 interferes with the interaction of AtWRI1 and the E3 ligase, thereby protecting AtWRI1 from degradation. In conclusion, our studies identified AtWRI1 as a client of 14-3-3 proteins and provide insights into a role of 14-3-3 in mediating plant oil biosynthesis.

14-3-3↗
DOE OSTI2016

Optimal test selection for prediction uncertainty reduction

Economic factors and experimental limitations often lead to sparse and/or imprecise data used for the calibration and validation of computational models. This paper addresses resource allocation for calibration and validation experiments, in order to maximize their effectiveness within given resource constraints. When observation data are used for model calibration, the quality of the inferred parameter descriptions is directly affected by the quality and quantity of the data. This paper characterizes parameter uncertainty within a probabilistic framework, which enables the uncertainty to be systematically reduced with additional data. The validation assessment is also uncertain in the presence of sparse and imprecise data; therefore, this paper proposes an approach for quantifying the resulting validation uncertainty. Since calibration and validation uncertainty affect the prediction of interest, the proposed framework explores the decision of cost versus importance of data in terms of the impact on the prediction uncertainty. Often, calibration and validation tests may be performed for different input scenarios, and this paper shows how the calibration and validation results from different conditions may be integrated into the prediction. Then, a constrained discrete optimization formulation that selects the number of tests of each type (calibration or validation at given input conditions) is proposed. Furthermore, the proposed test selection methodology is demonstrated on a microelectromechanical system (MEMS) example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Summer Proceedings 2016: The Center for Computing Research at Sandia National Laboratories

Solving sparse linear systems from the discretization of elliptic partial differential equations (PDEs) is an important building block in many engineering applications. Sparse direct solvers can solve general linear systems, but are usually slower and use much more memory than effective iterative solvers. To overcome these two disadvantages, a hierarchical solver (LoRaSp) based on H2-matrices was introduced in [22]. Here, we have developed a parallel version of the algorithm in LoRaSp to solve large sparse matrices on distributed memory machines. On a single processor, the factorization time of our parallel solver scales almost linearly with the problem size for three-dimensional problems, as opposed to the quadratic scalability of many existing sparse direct solvers. Moreover, our solver leads to almost constant numbers of iterations, when used as a preconditioner for Poisson problems. On more than one processor, our algorithm has significant speedups compared to sequential runs. With this parallel algorithm, we are able to solve large problems much faster than many existing packages as demonstrated by the numerical experiments.

97 MATHEMATICS AND COMPUTING↗