Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse direct method”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

PSelInv—A Distributed Memory Parallel Algorithm for Selected Inversion: The Symmetric Case

We describe an efficient parallel implementation of the selected inversion algorithm for distributed memory computer systems, which we call PSelInv. The PSelInv method computes selected elements of a general sparse matrix Athat can be decomposed as A= LU, where L is lower triangular and U is upper triangular. The implementation described in this article focuses on the case of sparse symmetric matrices. It contains an interface that is compatible with the distributed memory parallel sparse direct factorization SuperLU-DIST. Yet, the underlying data structure and design of PSelInv allows it to be easily combined with other factorization routines, such as PARDISO. We discuss general parallelization strategies such as data and task distribution schemes. Specifically, we describe how to exploit the concurrency exposed by the elimination tree associated with the LU factorization of A. We demonstrate the efficiency and accuracy of PSelInv by presenting several numerical experiments. In particular, we show that PSelInv can run efficiently on more than 4,000 cores for a modestly sized matrix. We also show how PSelInv can be used to accelerate large-scale electronic structure calculations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A communication-avoiding 3D sparse triangular solver

We present a novel distributed memory algorithm to improve the strong scalability of the solution of a sparse triangular system. This operation appears in the solve phase of direct methods for solving general sparse linear systems, Ax = b. Our 3D sparse triangular solver employs several techniques, including a 3D MPI process grid, elimination tree parallelism, and data replication, all of which reduce the per-process communication when combined. We present analytical models to understand the communication cost of our algorithm and show that our 3D sparse triangular solver can reduce the per-process communication volume asymptotically by a factor of O(n1/4) and O(n1/6) for problems arising from the finite element discretizations of 2D "planar" and 3D "non-planar" PDEs, respectively. We implement our algorithm for use in SuperLU_DIST3D, using a hybrid MPI+OpenMP programming model. Our 3D triangular solve algorithm, when run on 12k cores of Cray XC30, outperforms the current state-of-the-art 2D algorithm by 7.2x for planar and 2.7x for the non-planar sparse matrices, respectively.

Sao, Piyush↗
DOE OSTI2020

A WKB based preconditioner for the 1D Helmholtz wave equation

Frequency-domain full-wave solutions to the cold-plasma problem have become ubiquitous in the study of radio frequency power in fusion plasmas. However, recent efforts at extreme levels of geometric fidelity have revealed fundamental limits in the problem size that can be solved by typical sparse direct solver based methods. These limits are of particular importance in the 3D study of RF launchers, where the number of degrees of freedom required can exceed 100 million. In such cases, it would be advantageous to solve the system via iterative means, but due to the large null space of the curl-curl operator, the convergence properties of algorithms like GMRES are poor. Here we present a physics-based preconditioner in the form of a WKB solution and demonstrate the iterative solution to the frequency-domain Helmholtz problem in 1D for several cases ranging from satisfying the WKB approximation to strongly violating it.

Green, David↗
DOE OSTI2021

Discrete-Direct Model Calibration and Uncertainty Propagation Method Confirmed on Multi-Parameter Plasticity Model Calibrated to Sparse Random Field Data

A discrete direct (DD) model calibration and uncertainty propagation approach is explained and demonstrated on a 4-parameter Johnson-Cook (J-C) strain-rate dependent material strength model for an aluminum alloy. The methodology's performance is characterized in many trials involving four random realizations of strain-rate dependent material-test data curves per trial, drawn from a large synthetic population. The J-C model is calibrated to particular combinations of the data curves to obtain calibration parameter sets which are then propagated to “Can Crush” structural model predictions to produce samples of predicted response variability. These are processed with appropriate sparse-sample uncertainty quantification (UQ) methods to estimate various statistics of response with an appropriate level of conservatism. This is tested on 16 output quantities (von Mises stresses and equivalent plastic strains) and it is shown that important statistics of the true variabilities of the 16 quantities are bounded with a high success rate that is reasonably predictable and controllable. The DD approach has several advantages over other calibration-UQ approaches like Bayesian inference for capturing and utilizing the information obtained from typically small numbers of replicate experiments in model calibration situations—especially when sparse replicate functional data are involved like force–displacement curves from material tests. The DD methodology is straightforward and efficient for calibration and propagation problems involving aleatory and epistemic uncertainties in calibration experiments, models, and procedures.

42 ENGINEERING↗
DOE OSTI2024

Material Model Parameters Optimization in Liquid Mercury Target Dynamics Simulation With Machine Learning Surrogates

A pulsed spallation target is subjected to very short (∼0.7μs) but intense loads (23.3 kJ) from repeated proton pulses, which knock away neutrons from the mercury atoms’ nuclei for a wide range application in physics, engineering, medicine, petroleum exploration, biology, chemistry, etc. The effect of this pulsed loading on the stainless-steel target module which contains the flowing mercury target material is difficult to predict not only due to its short but intense explosive-like physical reaction, but also the nonlinear material behavior of the liquid mercury in the structure. Injecting small helium bubbles in the mercury has been an efficient method of mitigating the pressure wave at high power level stage. However, prediction of the resultant loading on the target is more difficult when helium gas is intentionally injected into the mercury. A 2-phase material model that incorporates the Rayleigh-Plesset (R-P) model is expected to address this complex multi-physics dynamics problem by including the bubble dynamics in the liquid mercury. A parameter sensitivity study was firstly employed to understand their impact on the simulation strains. The investigated parameters included E, μ, γ, σ, n, VFgas, and gas cumulative volume curve control parameters a and b. Verification and validation results from sparse polynomial expansions (SPE) method and directional Gaussian smoothing (DGS) optimization show that the surrogate model had training error of ∼7% and validation error of ∼15%, indicating that machine learning methods and surrogate models can help optimize the uncertain parameters in the complex 2-phase material model. This approach is expected to fill the knowledge gap between unknown liquid-gas mixture material model and measured vessel strain responses.

Lin, Lianshan↗
DOE OSTI2023

GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis

Integrating renewable resources within the transmission grid at a wide scale poses significant challenges for economic dispatch as it requires analysis with more optimization parameters, constraints, and sources of uncertainty. This motivates the investigation of more efficient computational methods, especially those for solving the underlying linear systems, which typically take more than half of the overall computation time. In this paper, we present our work on sparse linear solvers that take advantage of hardware accelerators, such as graphical processing units (GPUs), and improve the overall performance when used within economic dispatch computations. We treat the problems as sparse, which allows for faster execution but also makes the implementation of numerical methods more challenging. We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements when using high-performance linear solvers within alternating current optimal power flow (ACOPF) analysis. Furthermore, we demonstrate the feasibility of getting significant performance improvements by executing the entire computation on GPU-based hardware. Finally, we identify outstanding research issues and opportunities for even better utilization of heterogeneous systems, including those equipped with GPUs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Characterization of Acoustic Emissions From Analogue Rocks Using Sparse Regression‐DMDc

Abstract Moisture loss in rock is known to generate acoustic emissions (AE). Phenomena that result in AE during drying are related to the movement of fluids through the pores and induced‐cracks that arise from differential mineral shrinkage, especially in clay‐bearing rock. AE from the movement of fluids occurs from the reconfiguration of fluid interfaces during drying, while AE from mineral shrinkage involves the debonding within or between minerals. Here, analogue rock samples were used to examine the differences in the AE signatures when one or both AE source‐types are present. An unsupervised sparse regression model, Dynamic Mode Decomposition with control, that extends Dynamic Mode Decomposition is used to characterize the AE signals recorded during the drying of porous analogue rock samples fabricated with ordinary Portland cement, with and without clay. This method can effectively and accurately reconstruct acoustic signals emitted from samples that only experience moisture loss without cracking. However, the method struggles to reconstruct signals from samples with intricate crack networks that formed during drying because AE generating mechanisms can emit contemporaneously, and the resulting waves propagate through drying‐induced cracks that can lead to multiple internal reflections. Thus, the differential reconstruction accuracy of time series generated by different underlying physical processes provides a robust filter for reducing large data catalogs. In general, both dynamics and sparse initiating events are learned directly from data and this method exposes a data hierarchy based on the complexity of the intrinsic dynamics.

58 GEOSCIENCES↗
DOE OSTI2017

Efficient convolutional sparse coding

Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quantifying Dynamic Signal Spread in Real-Time High-Energy X-ray Diffraction

Abstract Measured intensity in high-energy monochromatic X-ray diffraction (HEXD) experiments provides information regarding the microstructure of the crystalline material under study. The location of intensity on an areal detector is determined by the lattice spacing and orientation of crystals so that changes in the heterogeneity of these quantities are reflected in the spreading of diffraction peaks over time. High temporal resolution of such dynamics can now be experimentally observed using technologies such as the mixed-mode pixel array detector (MM-PAD) which facilitates in situ dynamic HEXD experiments to study plasticity and its underlying mechanisms. In this paper, we define and demonstrate a feature computed directly from such diffraction time series data quantifying signal spread in a manner that is correlated with plastic deformation of the sample. A distinguishing characteristic of the analysis is the capability to describe the evolution from the distinct diffraction peaks of an undeformed alloy sample through to the non-uniform Debye–Scherrer rings developed upon significant plastic deformation. We build on our previous work modeling data using an overcomplete dictionary by treating temporal measurements jointly to improve signal spread recovery. We demonstrate our approach in simulations and on experimental HEXD measurements captured using the MM-PAD. Our method for characterizing the temporal evolution of signal spread is shown to provide an informative means of data analysis that adds to the capabilities of existing methods. Our work draws on ideas from convolutional sparse coding and requires solving a coupled convex optimization problem based on the alternating direction method of multipliers.

Engineering↗
DOE OSTI2024

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗
DOE OSTI2026

Sparsity Applications for Gradient‐Based Optimization of Wind Farms

Optimizing wind farms is essential for designing efficient energy systems, especially as farms grow larger and span multiple sites. However, this optimization becomes increasingly challenging due to the rising computational cost associated with more turbines. Gradient‐based optimization methods scale better than gradient‐free approaches for large problems, but the most computationally expensive component remains the calculation of gradients for the objective function and constraint Jacobians. To address this, we propose leveraging sparsity to accelerate gradient evaluations and reduce the size of the constraint Jacobian. Wind farms naturally exhibit sparsity—many turbines do not influence each other under certain wind directions. However, unlike traditional sparse problems with fixed patterns, wind farm sparsity is dynamic, requiring new strategies to handle changing interactions efficiently. This paper presents a study of sparsity in wind farm optimization and introduces several methods to exploit it. These strategies are tested on multiple farms using the analytic Cumulative Curl model, with gradients computed via automatic differentiation (AD). The same sparsity‐aware techniques are also applicable to finite difference (FD) methods, where they can yield even greater speedups due to the high cost of directional evaluations. Results show that sparse methods achieve up to a 10x speedup with less than ± 5% variance in optimized wake losses compared to traditional methods. These findings suggest that sparsity‐aware optimization not only maintains solution quality but also scales efficiently with farm size, enabling more comprehensive design exploration at reduced computational cost.

17 WIND ENERGY↗
DOE OSTI2024

Forecasting high-dimensional spatio-temporal systems from sparse measurements

This paper introduces a new neural network architecture designed to forecast high-dimensional spatio-temporal data using only sparse measurements. The architecture uses a two-stage end-to-end framework that combines neural ordinary differential equations (NODEs) with vision transformers. Initially, our approach models the underlying dynamics of complex systems within a low-dimensional space; and then it reconstructs the corresponding high-dimensional spatial fields. Many traditional methods involve decoding high-dimensional spatial fields before modeling the dynamics, while some other methods use an encoder to transition from high-dimensional observations to a latent space for dynamic modeling. In contrast, our approach directly uses sparse measurements to model the dynamics, bypassing the need for an encoder. This direct approach simplifies the modeling process, reduces computational complexity, and enhances the efficiency and scalability of the method for large datasets. We demonstrate the effectiveness of our framework through applications to various spatio-temporal systems, including fluid flows and global weather patterns. Although sparse measurements have limitations, our experiments reveal that they are sufficient to forecast system dynamics accurately over long time horizons. Our results also indicate that the performance of our proposed method remains robust across different sensor placement strategies, with further improvements as the number of sensors increases. This robustness underscores the flexibility of our architecture, particularly in real-world scenarios where sensor data is often sparse and unevenly distributed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Data-Driven Discovery of Active Nematic Hydrodynamics

Active nematics can be modeled using phenomenological continuum theories that account for the dynamics of the nematic director and fluid velocity through partial differential equations (PDEs). While these models provide a statistical description of the experiments, the relevant terms in the PDEs and their parameters are usually identified indirectly. We adapt a recently developed method to automatically identify optimal continuum models for active nematics directly from spatio-temporal data, via sparse regression of the coarse-grained fields onto generic low order PDEs. After extensive benchmarking, we apply the method to experiments with microtubule-based active nematics, finding a surprisingly minimal description of the system. Furthermore, our approach can be generalized to gain insights into active gels, microswimmers, and diverse other experimental active matter systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Creep and Tensile Properties of Direct Metal Laser Sintered (DMLS) Inconel 738LC Coupons and Comparison to Cast Properties

Due to the nature of sCO2 power cycles, a number of turbine parts must have good mechanical properties at elevated temperatures. For recompression cycles, the turbine inlet temperature is between 600°C - 750°C, which puts nearly all high-temperature turbine parts into a creep regime. The high-strength parts in these applications are often composed of materials having high nickel or chrome contents, and are often termed superalloys. At these temperatures, the blades must survive mechanical loads due to centrifugal stress and blade loading. While centrifugal stress is primarily a function of tip velocity and its associated centrifugal acceleration, blade loading is a function of power density. Since sCO2 turbomachinery is approaching the power density of rocket engines, blade loading tends to be quite large. Another result of this high power density is that blade passages for 1-10 MW turbines tend to be quite small, making conventional fabrication methods challenging and costly; this leads engineers to pioneer new techniques to address these challenges. The authors of the current work are addressing this challenge by applying additive manufacturing techniques in the production of a 10 MW radial inflow impeller. While a comprehensive database exists for the mechanical properties of forged and cast superalloys, data is sparse for superalloys fashioned by direct metal laser sintering (DMLS) or other additive manufacturing methods. For the remainder of this work, the term printed will refer to components manufactured using one of these processes for brevity. The current work stems from the desire to manufacture a radial inflow turbine impeller using additive manufactured (AM) Inconel 738. While Siemens has adopted the use of DMLS printed Inconel 738 for use in select aviation engine parts, creep and tensile properties have not been published to the extent needed to validate a given design. The current work will show creep and tensile properties of AM Inconel 738 in the horizontal and vertical build directions and their respective comparison to cast Inconel 738 properties.

wilkes, Jason↗
DOE OSTI2024

e RPCA : Robust Principal Component Analysis for Exponential Family Distributions

Abstract Robust principal component analysis (RPCA) is a widely used method for recovering low‐rank structure from data matrices corrupted by significant and sparse outliers. These corruptions may arise from occlusions, malicious tampering, or other causes for anomalies, and the joint identification of such corruptions with low‐rank background is critical for process monitoring and diagnosis. However, existing RPCA methods and their extensions largely do not account for the underlying probabilistic distribution for the data matrices, which in many applications are known and can be highly non‐Gaussian. We thus propose a new method called RPCA for exponential family distributions (), which can perform the desired decomposition into low‐rank and sparse matrices when such a distribution falls within the exponential family. We present a novel alternating direction method of multiplier optimization algorithm for efficient decomposition, under either its natural or canonical parametrization. The effectiveness of is then demonstrated in two applications: the first for steel sheet defect detection and the second for crime activity monitoring in the Atlanta metropolitan area.

Zheng, Xiaojun↗
DOE OSTI2021

Solving Inverse Stochastic Problems from Discrete Particle Observations Using the Fokker--Planck Equation and Physics-Informed Neural Networks

The Fokker--Planck (FP) equation governing the evolution of the probability density function (PDF) is applicable to many disciplines, but it requires specification of the coefficients for each case, which can be functions of space-time and not just constants and hence require the development of a data-driven modeling approach. When the data available is directly on the PDF, there exist methods for inverse problems that can be employed to infer the coefficients and thus determine the FP equation and subsequently obtain its solution. Herein, we address a more realistic scenario, where only sparse data are given on the particles' positions at a few time instants, which are not sufficient to accurately construct directly the PDF even at those times from existing methods, e.g., kernel estimation algorithms. To this end, we develop a general framework based on physics-informed neural networks (PINNs) that introduces a new loss function using the Kullback--Leibler divergence to connect the stochastic samples with the FP equation to simultaneously learn the equation and infer the multidimensional PDF at all times. In particular, we consider two types of inverse problems, type I, where the FP equation is known but the initial PDF is unknown, and type II, in which, in addition to the unknown initial PDF, the drift and diffusion terms are also unknown. In both cases, we investigate problems with either Brownian or Lévy noise or a combination of both. Here, we demonstrate the new PINN framework in detail in the one-dimensional (1D) case, but we also provide results for up to five dimensions demonstrating that we can infer both the FP equation and dynamics simultaneously at all times with high accuracy using only very few discrete observations of the particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Novel Fault Diagnosis Approach for Rolling Bearing Based on CWT and Adaptive Sparse Representation

Extraction and enhancement of weak impulse signature is the key of rolling bearing fault prognostics in which case the features are often weak and covered by noise. Tunable Q-factor wavelet transform (TQWT), as an emerging wavelet construction theory developed in a frequency domain explicitly, has the advantages of matching with the specific oscillation behavior of signal components. In this article, an adaptive sparse representation (ASR) method is proposed, which integrates the sparse code shrinkage (SCS) and parameter optimization into TQWT. However, direct application of ASR is difficult to extract fault signatures at the early stage or low-speed operation due to weak fault symptoms and background noise. A novel fault diagnosis strategy based on continuous wavelet transform (CWT) and ASR is investigated. CWT owns significant advantages on multiscale subdivision and weak signal detection. The results of simulated and experimental vibration signal analyses verify the effectiveness of the proposed method in accurately extracting weak impulse features from the noise environment.

Yuan, Xing↗
DOE OSTI2022

Tacho

SAND2022-7470 O Tacho is a performance portable sparse direct solver for use with various sparse matrix problems which typically arise from finite element methods. The code relies on the Kokkos parallel programming model porting to both CPUs and GPUs. It is also part of the Trilinos library. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Kim, Kyungjoo↗