Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse decomposition”

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
NASA NTRS2009

Monitoring Phenology as Indicator for Timing of Nutrient Inputs in Northern Gulf Watersheds

Nutrient over-enrichment defined by the U.S. Environmental Protection Agency as the anthropogenic addition of nutrients, in addition to any natural processes, causing adverse effects or impairments to the beneficial uses of a water body has been identified as one of the most significant environmental problems facing sensitive estuaries and coastal waters. Understanding the timing of nutrient inputs into those waters through remote sensing observables helps define monitoring and mitigation strategies. Remotely sensed data products can trace both forcings and effects of the nutrient system from landscape to estuary. This project is focused on extracting nutrient information from the landscape. The timing of nutrients entering coastal waters from the land boundary is greatly influenced by hydrologic processes, but can also be affected by the timing of nutrient additions across the landscape through natural or anthropogenic means. Non-point source nutrient additions to watersheds are often associated with specific seasonal cycles, such as decomposition of organic materials in fall and winter or addition of fertilizers to crop lands in the spring. These seasonal cycles or phenology may in turn be observed through the use of satellite sensors. Characterization of the phenology of various land cover types may be of particular interest in Gulf of Mexico estuarine systems with relatively short pathways between intensively managed systems and the land/estuarine boundary. The objective of this study is to demonstrate the capability of monitoring phenology of specific classes of land, such as agriculture and managed timberlands, at a refined watershed level. The extraction of phenological information from the Moderate Resolution Imaging Spectroradiometer (MODIS) data record is accomplished using analytical tools developed for NASA at Stennis Space Center: the Time Series Product Tool and the Phenological Parameters Estimation Tool. MODIS reflectance data (product MOD09) were used to compute the Normalized Difference Vegetation Index, which is sensitive to changes in vegetation canopies. The project team is working directly with the Mississippi Department of Environmental Quality to understand end-user requirements for this type of information product. Initial focus areas are identification of time frames for pre-plant fertilizer applications (prior to start of season), side-dress fertilizer applications (during rapid green-up), and periods of plant decomposition (during and after senescence). Prototypical maps of phenological stages related to these time frames have been generated for watersheds in the northern Gulf of Mexico. Where feasible, these maps have been compared to existing in situ nutrient monitoring data, but the in situ data is temporally sparse (monthly frequency or less), which makes interpretation challenging. Future work will include integrating effects of rainfall and seeking couplings with estuarine remote sensing.

Ross, Kenton W.↗
DOE OSTI2023

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗
DOE OSTI2021

Performance of Compact Pulsed Thermal Imaging System for In-Service Applications. Pulsed thermal tomography nondestructive examination of additively manufactured reactor materials and components

Additive manufacturing (AM) is an emerging method for cost-efficient fabrication of complex topology nuclear reactor parts from high-strength corrosion resistance alloys, such as stainless steel and Inconel. AM of metallic structures for nuclear energy applications is currently based on laser powder bed fusion (LPBF) process, which has the capability of melting metallic powder and net shaping the structures with relatively high precision. Some of the challenges with using LPBF method for nuclear manufacturing include the possibility of introducing pores into metallic structures. Integrity of AM structures needs to be evaluated nondestructively because material flaws could lead to premature failures due to creep in high temperature nuclear reactor environment. Currently, there exist limited capabilities to evaluate actual AM structures nondestructively. Pulsed Thermography (PT) imaging provides a capability for non-destructive evaluation (NDE) of sub-surface defects in arbitrary size structures. The PT method is based on recording material surface temperature transients with infrared (IR) camera following thermal pulse delivered on material surface with flash light. The PT method has advantages for NDE of actual AM structures because the method involves one-sided non-contact measurements and fast processing of large sample areas captured in one image. The data cube of PT measurements consists of surface temperature taken at sequential time intervals T(x,y,t). Material defects can be detected either by analyzing the thermograms T(x,y,t) data cube, or by using thermal tomography (TT) algorithm to obtain 3D spatial reconstruction of thermal effusivity e(x,y,z). To reduce the cost and enable in-service NDE in spatially constrained environment, it is highly desirable to develop PT with compact and inexpensive IR camera. Following initial qualification of an AM component for deployment in a nuclear reactor, a compact PT system can also be used for in-service nondestructive evaluation (NDE) applications. However, data cube obtained with PT based on compact IR camera suffers from strong thermal noises and loss of features due to relatively low sampling rate. In this report we describe two unsupervised machine learning (ML) algorithms for enhancement of PT images obtained with compact IR camera. In one approach, we introduce Sparse Coding Discrete Cosine Transform (SC/DCT) algorithm to remove additive white Gaussian noise (AWGN) from spatial thermal effusivity reconstructions. In another approach we introduce a Spatial Temporal Denoised Thermal Source Separation (STDTSS) ML algorithm to process thermograms. The STDTSS algorithm consists of spatial and temporal denoising using Gaussian and Savitzky–Golay filtering, followed by the matrix decomposition using Principal Component Analysis (PCA), and Independent Component Analysis (ICA) to automatically detect flaws. In the work described in this report, we constructed a compact PT system using a relatively small and low-cost FLIR A65 camera, consisting on uncooled microbolometer detector. Performance of SC/DCT algorithm was demonstrated on enhancing TT images of Inconel 718 AM plate. Performance of the STDTSS methods was investigated using thermography data obtained from imaging stainless steel 316L specimens produced with LPBF method with imprinted calibrated porosity defects.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1987

Relaxation schemes for spectral multigrid methods

The effectiveness of relaxation schemes for solving the systems of algebraic equations which arise from spectral discretizations of elliptic equations is examined. Iterative methods are an attractive alternative to direct methods because Fourier transform techniques enable the discrete matrix-vector products to be computed almost as efficiently as for corresponding but sparse finite difference discretizations. Preconditioning is found to be essential for acceptable rates of convergence. Preconditioners based on second-order finite difference methods are used. A comparison is made of the performance of different relaxation methods on model problems with a variety of conditions specified around the boundary. The investigations show that iterations based on incomplete LU decompositions provide the most efficient methods for solving these algebraic systems.

Phillips, Timothy N.↗
DOE OSTI2019

Spinning constraints on chaotic large c CFTs

We study out-of-time ordered four-point functions in two dimensional conformal field theories by suitably analytically continuing the Euclidean correlator. For large central charge theories with a sparse spectrum, chaotic dynamics is revealed in an exponential decay, this is seen directly in the contribution of the vacuum block to the correlation function. However, contributions from individual non-vacuum blocks with large spin and small twist dominate over the vacuum block. We argue, based on holographic intuition, that suitable summations over such intermediate states in the block decomposition of the correlator should be sub-dominant, and attempt to use this criterion to constrain the OPE data with partial success. Along the way we also discuss the relation between the spinning Virasoro blocks and the on-shell worldline action of spinning particles in an asymptotically AdS spacetime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

A framework for solving atomistic phonon-structure scattering problems in the frequency domain using perfectly matched layer boundaries

We present a numerical approach to the solution of elastic phonon-interface and phonon-nanostructure scattering problems based on a frequency-domain decomposition of the atomistic equations of motion and the use of perfectly matched layer (PML) boundaries. Unlike molecular dynamic wavepacket analysis, the current approach provides the ability to simulate scattering from individual phonon modes, including wavevectors in highly dispersive regimes. Like the atomistic Green's function method, the technique reduces scattering problems to a system of linear algebraic equations via a sparse, tightly banded matrix regardless of dimensionality. However, the use of PML boundaries enables rapid absorption of scattered wave energies at the boundaries and provides a simple and inexpensive interpretation of the scattered phonon energy flux calculated from the energy dissipation rate in the PML. The accuracy of the method is demonstrated on connected monoatomic chains, for which an analytic solution is known. The parameters defining the PML are found to affect the performance and guidelines for selecting optimal parameters are given. The method is used to study the energy transmission coefficient for connected diatomic chains over all available wavevectors for both optical and longitudinal phonons; it is found that when there is discontinuity between sublattices, even connected chains of equivalent acoustic impedance have near-zero transmission coefficient for short wavelengths. The phonon scattering cross section of an embedded nanocylinder is calculated in 2D for a wide range of frequencies to demonstrate the extension of the method to high dimensions. The calculations match continuum theory for long-wavelength phonons and large cylinder radii, but otherwise show complex physics associated with discreteness of the lattice. Examples include Mie oscillations which terminate when incident phonon frequencies exceed the maximum available frequency in the embedded nanocylinder, and scattering efficiencies larger than two near the Brillouin zone edge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Methane emissions proportional to permafrost carbon thawed in Arctic lakes since the 1950s

Permafrost thaw exposes previously frozen soil organic matter to microbial decomposition. This process generates methane and carbon dioxide, and thereby fuels a positive feedback process that leads to further warming and thaw. Despite widespread permafrost degradation during the past ~40 years, the degree to which permafrost thaw may be contributing to a feedback between warming and thaw in recent decades is not well understood. Radiocarbon evidence of modern emissions of ancient permafrost carbon is also sparse. Here we combine radiocarbon dating of lake bubble trace-gas methane (113 measurements) and soil organic carbon (289 measurements) for lakes in Alaska, Canada, Sweden and Siberia with numerical modelling of thaw and remote sensing of thermokarst shore expansion. Methane emissions from thermokarst areas of lakes that have expanded over the past 60 years were directly proportional to the mass of soil carbon inputs to the lakes from the erosion of thawing permafrost. Here, radiocarbon dating indicates that methane age from lakes is nearly identical to the age of permafrost soil carbon thawing around them. Based on this evidence of landscape-scale permafrost carbon feedback, we estimate that 0.2 to 2.5 Pg permafrost carbon was released as methane and carbon dioxide in thermokarst expansion zones of pan-Arctic lakes during the past 60 years.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Solving larger maximum clique problems using parallel quantum annealing

Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave Systems, which we consider in this work, is sparsely connected and moderately sized (on the order of thousands of qubits), thus necessitating a minor-embedding of a logical problem onto the physical qubit hardware. The combination of relatively small hardware sizes and the necessity of a minor-embedding can mean that solving large optimization problems is not possible on current quantum annealers. In this research, we show that a hybrid approach combining parallel quantum annealing with graph decomposition allows one to solve larger optimization problem accurately. We apply the approach to the Maximum Clique problem on graphs with up to 120 nodes and 6395 edges.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1980

Improvements in sparse matrix operations of NASTRAN

A "nontransmit" packing routine was added to NASTRAN to allow matrix data to be refered to directly from the input/output buffer. Use of the packing routine permits various routines for matrix handling to perform a direct reference to the input/output buffer if data addresses have once been received. The packing routine offers a buffer by buffer backspace feature for efficient backspacing in sequential access. Unlike a conventional backspacing that needs twice back record for a single read of one record (one column), this feature omits overlapping of READ operation and back record. It eliminates the necessity of writing, in decomposition of a symmetric matrix, of a portion of the matrix to its upper triangular matrix from the last to the first columns of the symmetric matrix, thus saving time for generating the upper triangular matrix. Only a lower triangular matrix must be written onto the secondary storage device, bringing 10 to 30% reduction in use of the disk space of the storage device.

Harano, S.↗
DOE OSTI2021

pyDRESCALk

Modern data scientists are tasked to analyze ever-growing data sets with increasingly complex relationships. Tensor decompositions have come to play a central role in identifying underlying latent structures in higher-order data. The problem of fitting tensor models to different distributions is complicated by the combinations of size, dimensionality, and sparsity present in real world data. The situation demands efficient algorithms designed for shared-memory and distributed systems. This work will present new research that tackles these challenges on several different fronts, leveraging optimizations in numerical algorithms and sparse tensor representations in heterogeneous high performance computing environments.

Bhattarai, Manish↗
DOE OSTI2013

Eigenfunction Decomposition of Reactor Perturbations and Transitions Using MCNP Monte Carlo

Monte Carlo criticality calculations for nuclear reactors have typically only been able to find the primary eigenvalue and eigenmode. With the new fission matrix capability in MCNP6, it becomes possible to solve for higher modes, which are useful in wide variety of analyses. As a test case of this new capability, two reactor models in both a base configuration and a perturbed configuration were simulated in MCNP to generate fission matrices. Tools were written to find a relatively small number of eigenpairs of the resulting matrices, whereupon it was found that the implicitly restarted Arnoldi method outperformed the previously used power iteration as an eigenvalue algorithm by a factor of 1500 for a 3600 × 3600 sparse matrix.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗
DOE OSTI2020

Forward sensitivity approach for estimating eddy viscosity closures in nonlinear model reduction

In this paper, we propose a variational approach to estimate eddy viscosity using forward sensitivity method (FSM) for closure modeling in nonlinear reduced order models. FSM is a data assimilation technique that blends model's predictions with noisy observations to correct initial state and/or model parameters. We apply this approach on a projection based reduced order model (ROM) of the one-dimensional viscous Burgers equation with a square wave defining a moving shock, and the two-dimensional vorticity transport equation formulating a decay of Kraichnan turbulence. We investigate the capability of the approach to approximate an optimal value for eddy viscosity with different measurement configurations. Specifically, we show that our approach can sufficiently assimilate information either through full field or sparse noisy measurements to estimate eddy viscosity closure to cure standard Galerkin reduced order model (GROM) predictions. Therefore, our approach provides a modular framework to correct forecasting error from a sparse observational network on a latent space. We highlight that the proposed GROM-FSM framework is promising for emerging digital twin applications, where real-time sensor measurements can be used to update and optimize surrogate model's parameters.

42 ENGINEERING↗
DOE OSTI2022

Fast-decaying plant litter enhances soil carbon in temperate forests but not through microbial physiological traits

Abstract Conceptual and empirical advances in soil biogeochemistry have challenged long-held assumptions about the role of soil micro-organisms in soil organic carbon (SOC) dynamics; yet, rigorous tests of emerging concepts remain sparse. Recent hypotheses suggest that microbial necromass production links plant inputs to SOC accumulation, with high-quality (i.e., rapidly decomposing) plant litter promoting microbial carbon use efficiency, growth, and turnover leading to more mineral stabilization of necromass. We test this hypothesis experimentally and with observations across six eastern US forests, using stable isotopes to measure microbial traits and SOC dynamics. Here we show, in both studies, that microbial growth, efficiency, and turnover are negatively (not positively) related to mineral-associated SOC. In the experiment, stimulation of microbial growth by high-quality litter enhances SOC decomposition, offsetting the positive effect of litter quality on SOC stabilization. We suggest that microbial necromass production is not the primary driver of SOC persistence in temperate forests. Factors such as microbial necromass origin, alternative SOC formation pathways, priming effects, and soil abiotic properties can strongly decouple microbial growth, efficiency, and turnover from mineral-associated SOC.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗
DOE OSTI2023

Zero-truncated Poisson regression for sparse multiway count data corrupted by false zeros

Abstract We propose a novel statistical inference methodology for multiway count data that is corrupted by false zeros that are indistinguishable from true zero counts. Our approach consists of zero-truncating the Poisson distribution to neglect all zero values. This simple truncated approach dispenses with the need to distinguish between true and false zero counts and reduces the amount of data to be processed. Inference is accomplished via tensor completion that imposes low-rank tensor structure on the Poisson parameter space. Our main result shows that an $N$-way rank-$R$ parametric tensor $\boldsymbol{\mathscr{M}}\in (0,\infty )^{I\times \cdots \times I}$ generating Poisson observations can be accurately estimated by zero-truncated Poisson regression from approximately $IR^2\log _2^2(I)$ non-zero counts under the nonnegative canonical polyadic decomposition. Our result also quantifies the error made by zero-truncating the Poisson distribution when the parameter is uniformly bounded from below. Therefore, under a low-rank multiparameter model, we propose an implementable approach guaranteed to achieve accurate regression in under-determined scenarios with substantial corruption by false zeros. Several numerical experiments are presented to explore the theoretical results.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗