Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparsity”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Data Quality Monitoring for the Hadron Calorimeters Using Transfer Learning for Anomaly Detection

The proliferation of sensors brings an immense volume of spatio-temporal (ST) data in many domains, including monitoring, diagnostics, and prognostics applications. Data curation is a time-consuming process for a large volume of data, making it challenging and expensive to deploy data analytics platforms in new environments. Transfer learning (TL) mechanisms promise to mitigate data sparsity and model complexity by utilizing pre-trained models for a new task. Despite the triumph of TL in fields like computer vision and natural language processing, efforts on complex ST models for anomaly detection (AD) applications are limited. In this study, we present the potential of TL within the context of high-dimensional ST AD with a hybrid autoencoder architecture, incorporating convolutional, graph, and recurrent neural networks. Motivated by the need for improved model accuracy and robustness, particularly in scenarios with limited training data on systems with thousands of sensors, this research investigates the transferability of models trained on different sections of the Hadron Calorimeter of the Compact Muon Solenoid experiment at CERN. The key contributions of the study include exploring TL’s potential and limitations within the context of encoder and decoder networks, revealing insights into model initialization and training configurations that enhance performance while substantially reducing trainable parameters and mitigating data contamination effects.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Rocket Launch Detection with Smartphone Audio and Transfer Learning

Rocket launches generate infrasound signatures that have been detected at great distances. Due to the sparsity of the networks that have made these detections, however, most signals are detected tens of minutes to hours after the rocket launch. In this work, a method of near-real-time detection of rocket launches using data from a network of smartphones located 10–70 km from launch sites is presented. A machine learning model is trained and tested on the open-access Aggregated Smartphone Timeseries of Rocket-generated Acoustics (ASTRA), Smartphone High-explosive Audio Recordings Dataset (SHAReD), and ESC-50 datasets, resulting in a final accuracy of 97% and a false positive rate of <1%. The performance and behavior of the model are summarized, and its suitability for persistent monitoring applications is discussed.

acoustics↗
DOE OSTI2026

Deep nonparametric estimation of operators between infinite dimensional spaces

Learning operators between infinitely dimensional spaces is an important learning task arising in machine learning, imaging science, mathematical modeling and simulations, etc. This paper studies the nonparametric estimation of Lipschitz operators using deep neural networks. Non-asymptotic upper bounds are derived for the generalization error of the empirical risk minimizer over a properly chosen network class. Under the assumption that the target operator exhibits a low dimensional structure, our error bounds decay as the training sample size increases, with an attractive fast rate depending on the intrinsic dimension in our estimation. Our assumptions cover most scenarios in real applications and our results give rise to fast rates by exploiting low dimensional structures of data in operator estimation. We also investigate the influence of network structures (e.g., network width, depth, and sparsity) on the generalization error of the neural network estimator and propose a general suggestion on the choice of network structures to maximize the learning efficiency quantitatively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Data Assimilation with Machine Learning Surrogate Models: A Case Study with FourCastNet

Modern data-driven surrogate models for weather forecasting provide accurate short-term predictions but inaccurate and nonphysical long-term forecasts. This paper investigates online weather prediction using machine learning surrogates supplemented with partial and noisy observations. We empirically demonstrate and theoretically justify that, despite the long-time instability of the surrogates and the sparsity of the observations, filtering estimates can remain accurate in the long-time horizon. As a case study, we integrate FourCastNet, a weather surrogate model, within a variational data assimilation framework using partial, noisy ERA5 data. Our results show that filtering estimates remain accurate over a year-long assimilation window and provide effective initial conditions for forecasting tasks, including extreme event prediction.

Adrian, Melissa [Univ. of Chicago, IL (United Stat↗
DOE OSTI2026

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗
DOE OSTI2026

Performance of reanalysis and mesoscale models off the coast of Hawai'i

The eastern Hawai'i coast in the United States is characterized by considerable wind resource fuelled by persistent trade winds, making it an important area for energy research. The need is strong for reanalyses and higher-resolution regional simulations where observations have been historically limited, such as Hawai'i's offshore environments. However, studies using offshore observations in other parts of the world have shown that significant errors can occur in reanalyses and wind datasets, which can lead to inaccurate estimates of wind energy generation, payback periods, and extreme weather risks at project locations. The degree of such errors is influenced by a number of factors, including spatial resolution and the handling of processes within the planetary boundary layer (PBL). In this work, we provide a wind resource characterization from year-long lidar buoy measurements off the eastern coast of O'ahu, Hawai'i, an environment previously unobserved at the rotor level, and use the characterization to evaluate the performance of two simulation datasets. The O'ahu deployment location is meteorologically unique and less complex than land-based wind resource characterizations, being strongly characterized by trade winds with minimal land–atmosphere interaction influences. Despite the unique and fairly consistent meteorological conditions, we hypothesize that distinct simulation datasets will exhibit diverse ranges of errors similar to those that have been seen for other offshore locations. We find the European Centre for Medium-Range Weather Forecasts (ECMWF) Reanalysis version 5 (ERA5) to strongly underestimate observed wind speeds at the O'ahu location (bias = −1.54 m s −1 at a height of 140 m above sea level), while a regional Weather Research and Forecasting Model (WRF) simulation produced by the University of Hawai'i (UH-WRF) provides a significantly smaller wind speed bias (−0.25 m s −1 ), highlighting the value of running regional, higher-resolution simulations. The large bias noted for ERA5 is driven by significant underestimation of fast wind speeds (>9 m s −1 ), which the study site is largely characterized by, along with discontinuities in the ERA5 diurnal cycle. We also speculate that the relative sparsity of observations for data assimilation in this remote part of the world could influence the performance of ERA5 and that challenges with characterizing island effects could impact the performance of both datasets.

17 WIND ENERGY↗
NASA NTRS1972

Study of propellant dynamics in a shuttle type launch vehicle

A method and an associated digital computer program for evaluating the vibrational characteristics of large liquid-filled rigid wall tanks of general shape are presented. A solution procedure was developed in which slosh modes and frequencies are computed for systems mathematically modeled as assemblages of liquid finite elements. To retain sparsity in the assembled system mass and stiffness matrices, a compressible liquid element formulation was incorporated in the program. The approach taken in the liquid finite element formulation is compatible with triangular and quadrilateral structural finite elements so that the analysis of liquid motion can be coupled with flexible tank wall motion at some future time. The liquid element repertoire developed during the course of this study consists of a two-dimensional triangular element and a three-dimensional tetrahedral element.

Jones, C. E.↗
NASA NTRS1973

Sparse matrix methods based on orthogonality and conjugacy

A matrix having a high percentage of zero elements is called spares. In the solution of systems of linear equations or linear least squares problems involving large sparse matrices, significant saving of computer cost can be achieved by taking advantage of the sparsity. The conjugate gradient algorithm and a set of related algorithms are described.

Lawson, C. L.↗
NASA NTRS1972

Elimination on sparse symmetric systems of a special structure.

Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.

Segethova, J.↗
NASA NTRS1974

The role of solar local time in polar cap magnetic variations

The role of the earth's main field in controlling the morphology of magnetic disturbance is usually accounted for by use of invariant latitude and MLT (magnetic local time) as a coordinate system. Magnetic disturbance from ionospheric currents is also controlled by ionospheric conductivity. At high latitudes, where SLT (solar local time) can be very different from MLT, the use of only MLT can give misleading results. In particular, those diurnal magnetic variations in the polar cap that change characteristics between interplanetary magnetic sectors have a tendency to peak near noon SLT rather than noon MLT at Alert, where noon MLT and noon SLT differ by more than 10 hours. Because of the sparsity of magnetic observatories it is not possible to completely separate SLT and MLT effects.

Langel, R. A.↗
NASA NTRS1975

Sparse matrix techniques applied to modal analysis of multi-section duct liners

A simplified procedure is presented for analysis of ducts with discretely nonuniform properties. The analysis uses basis functions as the generalized coordinates. The duct eigenfunctions are approximated by finite series of these functions. The emphasis is on solution of the resulting large sparse set of linear equations. Characteristics of sparse matrix algorithms are outlined and some criteria for application are established. Analogies with structural methods are used to illustrate variations which can increase efficiency in generating values for design optimization routines. The effects of basis function selection, number of eigenfunctions and identification and ordering of equations on the sparsity and solution stability are included.

Arnold, W. R.↗
NASA NTRS1976

Evidence of Archaean life - A brief appraisal

Attention is called to the question of whether the meagerness of the Archaean fossil record is a function of a sparsity of preserved, cratonal, fossiliferous facies, or whether the abrupt break in the known fossil record near the Archaean-Proterozoic boundary reflects a major event in biological evolution. The paper then reviews the currently available geochemical and paleobiological data on Archaean biota. The occurrence of stromatolites in the Archaean, and the carbon isotopic composition of Archaean organic matter, both suggest strongly the existence of an Archaean biota. The presence of relatively abundant and morphologically complex microorganisms in deposits of early Proterozoic age seems to be certain evidence for a prior episode of Archaean evolution.

Schopf, J. W.↗
NASA NTRS1977

Numerical analysis of free vibrations of damped rotating structures

This paper is concerned with the efficient numerical solution of damped and undamped free vibration problems of rotating structures. While structural discretization is achieved by the finite element method, the associated eigenproblem solution is effected by a combined Sturm sequence and inverse iteration technique that enables the computation of a few required roots only without having to compute any other. For structures of complex configurations, a modal synthesis technique is also presented, which is based on appropriate combinations of eigenproblem solution of various structural components. Such numerical procedures are general in nature, which fully exploit matrix sparsity inherent in finite element discretizations, and prove to be most efficient for the vibration analysis of any damped rotating structure, such as rotating machineries, helicopter and turbine blades, spinning space stations, among others.

Gupta, K. K.↗
NASA NTRS1978

The Lanczos algorithm with selective orthogonalization

A new stable and efficient implementation of the Lanczos algorithm is presented. The algorithm is a powerful method for finding a few eigenvalues and eigenvectors at one or both ends of the spectrum of a symmetric matrix A. The algorithm is particularly effective if A is large and sparse in that the only way in which A enters the calculation is through a subroutine which computes Av for any vector v. Thus the user is free to take advantage of any sparsity structure in A and A need not even be represented as a matrix et al.

Parlett, B. N.↗
NASA NTRS1978

Some recent advances in numerical methods in structural dynamics

The purpose of this paper is to present some recent developments in the area of numerical dynamic analysis of large structural systems. The first part of the paper is devoted to the finite dynamic element method, a new concept in the discretization of a continuum, the adoption of which effects considerable reduction in the number of degrees of freedom for a required solution accuracy, when compared with the usual finite element method. This is followed by a brief description of eigenproblem solution techniques, for the free vibration analysis of both rotating and nonrotating structures, that fully exploit the associated matrix sparsity. Together, these techniques constitute a powerful tool for the free vibration and subsequent dynamic response analysis of complex practical structures.

Gupta, K. K.↗
NASA NTRS1980

Plan of research for integrated soil moisture studies. Recommendations of the Soil Moisture Working Group

Soil moisture information is a potentially powerful tool for applications in agriculture, water resources, and climate. At present, it is difficult for users of this information to clearly define their needs in terms of accuracy, resolution and frequency because of the current sparsity of data. A plan is described for defining and conducting an integrated and coordinated research effort to develop and refine remote sensing techniques which will determine spatial and temporal variations of soil moisture and to utilize soil moisture information in support of agricultural, water resources, and climate applications. The soil moisture requirements of these three different application areas were reviewed in relation to each other so that one plan covering the three areas could be formulated. Four subgroups were established to write and compile the plan, namely models, ground-based studies, aircraft experiments, and spacecraft missions.

Source record↗
NASA NTRS1982

Minimization versus homotopy algorithms

The relative merits and demerits of the minimization techniques are assessed using globally convergent quasi-Newton algorithms on the one hand and the homotopy algorithms on the other hand for the solution of problems of nonlinear structural analysis. Like the homotopy algorithms, the globally convergent quasi-Newton algorithms are equally suited for the solution of the nonlinear equations of structural analysis directly without having to pose the problem as an equivalent minimization problem. In the close neighborhood of the limit and bifurcation points quasi-Newton algorithms experience difficulties. Homotopy algorithms are robust for practically all types of nonlinear problems but are computationally not as cost effective since they provide an extremely accurate prediction of the response by calculating it as a large number of points. Globally convergent algorithms can perform well with very approximate Hessians, while homotopy algorithms require extremely accurate Hessians. While quasi-Newton algorithms can be very easily structured to exploit sparsity and symmetry, homotopy algorithms are not presently so structured and would require special modifications for exploitation of such features without sacrificing robustness and global convergence.

Kamat, M. P.↗
NASA NTRS1984

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗