Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sparse approximation”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗
DOE OSTI2025

Tomographic Sparse View Selection Using the View Covariance Loss

Standard computed tomography (CT) reconstruction algorithms such as filtered back projection (FBP) and Feldkamp-Davis-Kress (FDK) require many views for producing high-quality reconstructions, which can slow image acquisition and increase cost in non-destructive evaluation (NDE) applications. Over the past 20 years, a variety of methods have been developed for computing high-quality CT reconstructions from sparse views. However, the problem of how to select the best views for CT reconstruction remains open. In this paper, we present a novel view covariance loss (VCL) function that measures the joint information of a set of views by approximating the normalized mean squared error (NMSE) of the reconstruction. We present fast algorithms for computing the VCL along with an algorithm for selecting a subset of views that approximately minimizes its value. Our experiments on simulated and measured data indicate that for a fixed number of views our proposed view covariance loss selection (VCLS) algorithm results in reconstructions with lower NRMSE, fewer artifacts, and greater accuracy than current alternative approaches.

Lin, Jingsong [Purdue University]↗
DOE OSTI2020

Nonlinear sparse Bayesian learning for physics-based models

This paper addresses the issue of overfitting while calibrating unknown parameters of over-parameterized physics-based models with noisy and incomplete observations. Here, a semi-analytical Bayesian framework of nonlinear sparse Bayesian learning (NSBL) is proposed to identify sparsity among model parameters during Bayesian inversion. NSBL offers significant advantages over machine learning algorithm of sparse Bayesian learning (SBL) for physics-based models, such as 1) the likelihood function or the posterior parameter distribution is not required to be Gaussian, and 2) prior parameter knowledge is incorporated into sparse learning (i.e. not all parameters are treated as questionable). NSBL employs the concept of automatic relevance determination (ARD) to facilitate sparsity among questionable parameters through parameterized prior distributions. The analytical tractability of NSBL is enabled by employing Gaussian ARD priors and by building a Gaussian mixture-model approximation of the posterior parameter distribution that excludes the contribution of ARD priors. Subsequently, type-II maximum likelihood is executed using Newton's method whereby the evidence and its gradient and Hessian information are computed in a semi-analytical fashion. We show numerically and analytically that SBL is a special case of NSBL for linear regression models. Subsequently, a linear regression example involving multimodality in both parameter posterior pdf and model evidence is considered to demonstrate the performance of NSBL in cases where SBL is inapplicable. Next, NSBL is applied to identify sparsity among the damping coefficients of a mass-spring-damper model of a shear building frame. These numerical studies demonstrate the robustness and efficiency of NSBL in alleviating overfitting during Bayesian inversion of nonlinear physics-based models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1996

A Note on Substructuring Preconditioning for Nonconforming Finite Element Approximations of Second Order Elliptic Problems

In this paper an algebraic substructuring preconditioner is considered for nonconforming finite element approximations of second order elliptic problems in 3D domains with a piecewise constant diffusion coefficient. Using a substructuring idea and a block Gauss elimination, part of the unknowns is eliminated and the Schur complement obtained is preconditioned by a spectrally equivalent very sparse matrix. In the case of quasiuniform tetrahedral mesh an appropriate algebraic multigrid solver can be used to solve the problem with this matrix. Explicit estimates of condition numbers and implementation algorithms are established for the constructed preconditioner. It is shown that the condition number of the preconditioned matrix does not depend on either the mesh step size or the jump of the coefficient. Finally, numerical experiments are presented to illustrate the theory being developed.

Maliassov, Serguei↗
NASA NTRS2016

Towards a Multi-Variable Parametric Cost Model for Ground and Space Telescopes

Parametric cost models can be used by designers and project managers to perform relative cost comparisons between major architectural cost drivers and allow high-level design trades; enable cost-benefit analysis for technology development investment; and, provide a basis for estimating total project cost between related concepts. This paper hypothesizes a single model, based on published models and engineering intuition, for both ground and space telescopes: OTA Cost approximately (X) D(exp (1.75 +/- 0.05)) lambda(exp(-0.5 +/- 0.25) T(exp -0.25) e (exp (-0.04)Y). Specific findings include: space telescopes cost 50X to 100X more ground telescopes; diameter is the most important CER; cost is reduced by approximately 50% every 20 years (presumably because of technology advance and process improvements); and, for space telescopes, cost associated with wavelength performance is balanced by cost associated with operating temperature. Finally, duplication only reduces cost for the manufacture of identical systems (i.e. multiple aperture sparse arrays or interferometers). And, while duplication does reduce the cost of manufacturing the mirrors of segmented primary mirror, this cost savings does not appear to manifest itself in the final primary mirror assembly (presumably because the structure for a segmented mirror is more complicated than for a monolithic mirror).

Space Mirror Technology↗
DOE OSTI2020

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Results of a statistical approach to rainfall estimation using Nimbus 5 6.7 micrometers and 11.5 micrometers THIR data

Nimbus 5 6.7 mm and 11.5 mm temperature humidity infrared radiometer (THIR) data were used in a simple multiple regression scheme to test the feasibility of using these data to estimate hourly rainfall. Throughout the test area (85 W to 105 W and 45 N to 30 N) subareas (8 deg x 6 deg) were chosen from which point to point and areal statistics were obtained. Four subsets of data were used. The first consisted of only those surface stations indicating precipitation whose latitude and longitude coincided with the THIR grid points. A second used surface stations 0.1 degree from the THIR grid points. The third was a combination of subsets one and two. A reciprocal distance weighting scheme was used to derive precipitation values in data sparse areas. A fourth subset was made using these data combined with the data from subsets one and two. Point estimates resulted in negative correlations between estimated and grid derived "surface" precipitation. One degree areal estimates showed a slight improvement with a correlation coefficient of approximately 0.11. Single regression areal estimates resulted in correlations of approximately 0.11 and 0.20 for the 6.7 mm and 11.5 mm data respectively. These poor results were attributed to problems which are inherent in the satellite data (location errors, short temporal span of data, wavelength of sensors, etc.) and the lack of sufficient surface data to better verify the satellite estimate.

Ormsby, J. P.↗
DOE OSTI2023

Advanced data analysis in inertial confinement fusion and high energy density physics

Bayesian analysis enables flexible and rigorous definition of statistical model assumptions with well-characterized propagation of uncertainties and resulting inferences for single-shot, repeated, or even cross-platform data. This approach has a strong history of application to a variety of problems in physical sciences ranging from inference of particle mass from multi-source high-energy particle data to analysis of black-hole characteristics from gravitational wave observations. The recent adoption of Bayesian statistics for analysis and design of high-energy density physics (HEDP) and inertial confinement fusion (ICF) experiments has provided invaluable gains in expert understanding and experiment performance. In this Review, we discuss the basic theory and practical application of the Bayesian statistics framework. We highlight a variety of studies from the HEDP and ICF literature, demonstrating the power of this technique. Due to the computational complexity of multi-physics models needed to analyze HEDP and ICF experiments, Bayesian inference is often not computationally tractable. Two sections are devoted to a review of statistical approximations, efficient inference algorithms, and data-driven methods, such as deep-learning and dimensionality reduction, which play a significant role in enabling use of the Bayesian framework. We provide additional discussion of various applications of Bayesian and machine learning methods that appear to be sparse in the HEDP and ICF literature constituting possible next steps for the community. We conclude by highlighting community needs, the resolution of which will improve trust in data-driven methods that have proven critical for accelerating the design and discovery cycle in many application areas.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

The effects of storms and a transient sandy veneer on the interannual planform evolution of a low-relief coastal cliff and shore platform at Sargent Beach, Texas, USA

Coastal cliff erosion is alongshore-variable and episodic, with retreat rates that depend upon sediment as either tools of abrasion or protective cover. However, the feedbacks between coastal cliff planform morphology, retreat rate, and sediment cover are poorly quantified. This study investigates Sargent Beach, Texas, USA, at the annual to interannual scale to explore (1) the relationship between temporal and spatial variability in cliff retreat rate, roughness, and sinuosity and (2) the response of retreat rate and roughness to changes in sand and shell hash cover of the underlying mud substrate as well as the impact of major storms using field measurements of sediment cover, erosion, and aerial images to measure shore platform morphology and retreat. A storm event in 2009 increased the planform roughness and sinuosity of the coastal cliff at Sargent Beach. Following the storm, aerial-image-derived shorelines with annual resolution show a decrease in average alongshore erosion rates from 12 to 4 m yr –1 , coincident with a decrease in shoreline roughness and sinuosity (smoothing). Like the previous storm, a storm event in 2017 increased the planform roughness and sinuosity of the cliff. Over shorter timescales, monthly retreat of the sea cliff occurred only when the platform was sparsely covered with sediment cover on the shore platform, indicating that the tools and cover effects can significantly affect short-term erosion rates. The timescale to return to a smooth shoreline following a storm or roughening event, given a steady-state erosion rate, is approximately 24 years, with the long-term rate suggesting a maximum of ~107 years until Sargent Beach breaches, compromising the Gulf Intracoastal Waterway (GIWW) under current conditions and assuming no future storms or intervention. The observed retreat rate varies, both spatially and temporally, with cliff face morphology, demonstrating the importance of multi-scale measurements and analysis for interpretation of coastal processes and patterns of cliff retreat.

58 GEOSCIENCES↗
NASA NTRS1993

A three-dimensional pressure flux-split RNS application to sub/supersonic flow in inlets and ducts

The reduced Navier-Stokes (RNS) formulation is combined with a pressure based flux split procedure for the computational analysis of three dimensional flow. Only lowest order diffusion, that is required to satisfy the no-slip boundary condition is retained in this approximation. The governing equations are appropriately differenced such that the physical boundary conditions are closely coupled and combined to form a closed discrete system. No numerical or characteristic type boundary conditions are required. A global pressure relaxation procedure, i.e. multi-sweep PNS, is considered. A sparse matrix direct solver is applied to the crossplane solution. At the outflow boundary only the pressure or pressure gradient is prescribed. The resulting formulation has been applied to the solution of three-dimensional subsonic/supersonic internal flows in inlets and ducts.

Khosla, P. K.↗
NASA NTRS1993

Two-dimensional radiative transfer in cloudy atmospheres - The spherical harmonic spatial grid method

A new two-dimensional monochromatic method that computes the transfer of solar or thermal radiation through atmospheres with arbitrary optical properties is described. The model discretizes the radiative transfer equation by expanding the angular part of the radiance field in a spherical harmonic series and representing the spatial part with a discrete grid. The resulting sparse coupled system of equations is solved iteratively with the conjugate gradient method. A Monte Carlo model is used for extensive verification of outgoing flux and radiance values from both smooth and highly variable (multifractal) media. The spherical harmonic expansion naturally allows for different levels of approximation, but tests show that the 2D equivalent of the two-stream approximation is poor at approximating variations in the outgoing flux. The model developed here is shown to be highly efficient so that media with tens of thousands of grid points can be computed in minutes. The large improvement in efficiency will permit quick, accurate radiative transfer calculations of realistic cloud fields and improve our understanding of the effect of inhomogeneity on radiative transfer in cloudy atmospheres.

Evans, K. F.↗
NASA NTRS1994

Multifractal characterizations of nonstationarity and intermittency in geophysical fields: Observed, retrieved, or simulated

Geophysical data rarely show any smoothness at any scale, and this often makes comparison with theoretical model output difficult. However, highly fluctuating signals and fractal structures are typical of open dissipative systems with nonlinear dynamics, the focus of most geophysical research. High levels of variability are excited over a large range of scales by the combined actions of external forcing and internal instability. At very small scales we expect geophysical fields to be smooth, but these are rarely resolved with available instrumentation or simulation tools; nondifferentiable and even discontinuous models are therefore in order. We need methods of statistically analyzing geophysical data, whether measured in situ, remotely sensed or even generated by a computer model, that are adapted to these characteristics. An important preliminary task is to define statistically stationary features in generally nonstationary signals. We first discuss a simple criterion for stationarity in finite data streams that exhibit power law energy spectra and then, guided by developments in turbulence studies, we advocate the use of two ways of analyzing the scale dependence of statistical information: singular measures and qth order structure functions. In nonstationary situations, the approach based on singular measures seeks power law behavior in integrals over all possible scales of a nonnegative stationary field derived from the data, leading to a characterization of the intermittency in this (gradient-related) field. In contrast, the approach based on structure functions uses the signal itself, seeking power laws for the statistical moments of absolute increments over arbitrarily large scales, leading to a characterization of the prevailing nonstationarity in both quantitative and qualitative terms. We explain graphically, step by step, both multifractal statistics which are largely complementary to each other. The geometrical manifestations of nonstationarity and intermittency, 'roughness' and 'sparseness', respectively, are illustrated and the associated analytical (differentiability and continuity) properties are discussed. As an example, the two techniques are applied to a series of recent measurements of liquid water distributions inside marine stratocumulus decks; these are found to be multifractal over scales ranging from approximately 60 m to approximately 60 km. Finally, we define the 'mean multifractal plane' and show it to be a simple yet comprehensive tool with many applications including data intercomparison, (dynamical or stochastic) model and retrieval validations.

Davis, Anthony↗
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↗
NASA NTRS1994

Time integration algorithms for the two-dimensional Euler equations on unstructured meshes

Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.

Slack, David C.↗
NASA NTRS1982

Identification of a precambrian rift through Missouri by digital image processing of geophysical and geological data

A newly discovered feature in the midcontinent - a gravity low that begins at a break in the midcontinent gravity high in SE Nebraska, extends across Missouri in a NW-SE direction, and intersects the Mississippi Valley graben to form the Pascola arch - is discussed. The anomaly varies from 120 to 160 km in width, extends approximately 700 km, and is best expressed in southern Missouri, where it has a Bouguer amplitude of about -34 mGal. It is noted that the magnitude of the anomaly cannot be explained on the basis of a thickened section of Paleozoic sedimentary rock. The gravity data and the sparse seismic refraction data for the region are found to be consistent with an increased crustal thickness beneath the gravity low. It is thought that the gravity anomaly is probably the present expression of a failed arm of a rifting event, perhaps one associated with the spreading that led to or preceded formation of the granite and rhyolite terrain of southern Missouri.

Guinness, E. A.↗
NASA NTRS1978

Treatment of cloudiness in regional scale - Numerical weather prediction models

A numerical weather prediction model is considered in which cloud water and precipitation are explicitly predicted as functions of three space dimensions and time. Approximations in the thermodynamic and continuity equations are discussed in detail, as well as the cumulus parameterization and the cloud microphysics parameterization. An example of a real-data forecast indicates that very accurate quantitative precipitation and cloud cover forecasts are possible using initial observations from only the relatively sparse rawinsonde network in the U.S.

Kreitzberg, C. W.↗
NASA NTRS2018

Overview of Methods for Deriving the Radiative Transfer Theory from the Maxwell Equations. I: Approach Based on the Far-Field Foldy Equations

In this paper, we revisit, with further enhancements and clarifications, the self-consistent first-principles approach developed previously for deriving the vector radiative transfer theory for a discrete random medium with a sparse concentration of particles. We specifically consider the case of a plane-parallel particulate layer embedded in an otherwise homogeneous unbounded medium. The solution method is based on the far-field Foldy equations, an order-of-scattering expansion for the total field derived under the Twersky approximation, the computation of the coherent field by assuming that the positions of the particles are uncorrelated, and the ladder approximation for the coherency dyadic. The latter yields an integral equation for the diffuse specific coherency dyadic, defined through an angular spectrum repre- sentation for the coherency dyadic, which in turn, gives the vector radiative transfer equation for the diffuse specific intensity column vector. We analyze specifically the computation of the coherent field for inhomogeneous particulate media and multiple species of particles, the continuous extension of the far-field representation to the near field, the Foldy approximation, and the Foldy integral equation for the coherent field. Finally, we discuss the transition from the vector to the scalar radiative transfer equation.

Doicu, Adrian↗
NASA NTRS2003

Vector Radiative Transfer Equation for Arbitrarily Shaped and Arbitrarily Oriented Particles: A Microphysical Derivation from Statistical Electromagnetics

We use the concepts of statistical electromagnetics to derive the general radiative transfer equation (RTE) describing multiple scattering of polarized light by sparse discrete random media consisting of arbitrarily shaped and arbitrarily oriented particles. The derivation starts from the volume integral and Lippmann-Schwinger equations for the electric field scattered by a fixed N-particle system and proceeds to the vector form of the Foldy-Lax equations and their approximate far-field version. We then assume that particle positions are completely random and derive the vector RTE by applying the Twersky approximation to the coherent electric field and the Twersky and ladder approximations to the coherency dyad of the diffuse field in the limit N -> infinity. The concluding section discusses the physical meaning of the quantities entering the general vector RTE and the assumptions made in its derivation.

Mishchenko, Michael I.↗