Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sparse interpolation”

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 OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A 3D Full Stress Tensor Model for Oklahoma

Abstract The stress tensor is an important property for upper crustal studies such as those that involve pore fluids and earthquake hazards. At tectonic plate scale, plate boundary forces and mantle convection are the primary drivers of the stress field. In many local settings (10–100 s of km and <10 km depth) in tectonic plate interiors, we can simplify by assuming a constant background stress field that is perturbed by local heterogeneity in density and elasticity. Local stress orientation and sometimes magnitude can be estimated from earthquake and borehole‐based observations when available. Modeling of the local stress field often involves interpolating sparse observations. We present a new method to estimate the 3D stress field in the upper crust and demonstrate it for Oklahoma. We created a 3D material model by inverting multiple types of geophysical observations simultaneously. Integrating surface‐wave dispersion, local travel times and gravity observations produces a model of P‐wave velocity, S‐wave velocity, and density. The stress field can then be modeled using finite element simulations. The simulations are performed using our simplified view of the local stress field as the sum of a constant background stress field that is perturbed by local density and elasticity heterogeneity and gravitational body forces. An orientation of N82°E, for the maximum compressive tectonic force, best agrees with previously observed stress orientations and faulting types in Oklahoma. The gravitational contribution of the horizontal stress field has a magnitude comparable to the tectonic contribution for the upper 5 km of the subsurface.

58 GEOSCIENCES↗
DOE OSTI2021

A Sparse-Grid Probabilistic Scheme for Approximation of the Runaway Probability of Electrons in Fusion Tokamak Simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, and the application of the proposed method in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve O(Δt) convergence, and that the local anisotropic adaptive refinement strategy (M. Stoyanov, Adaptive sparse grid construction in a context of local anisotropy and multiple hierarchical parents. In: Sparse Grids and Applications-Miami 2016, Springer, Berlin, 2018, pp. 175–199) can effectively handle the sharp transition layer between the runaway and non-runaway regions.

Yang, Minglei↗
DOE OSTI2020

Reply to Comment by Peterie Et Al. on “Accelerated Fill‐Up of the Arbuckle Group Aquifer and Links to U.S. Midcontinent Seismicity”

Abstract Peterie et al. question one observation in our paper: associating pressure increases to injection volumes at distances of up to 25 km from an injection well. In this reply, we show that the comment misunderstands our analysis and the evidence that led to this conclusion. We also show that gauge‐depth‐corrected pressures, used by the authors to produce statewide pressure maps, are discrepant with the static fluid level data, provided in our original compilation and analysis. The discrepancies are a result of the pressure correction method employed, which naïvely substitutes formation pressure for bottomhole pressure to calculate wellbore fluid density. Their linearly interpolated pressure maps, based on sparse data, contain interpolation and extrapolation artifacts that contradict injection trends in the state, the Theis solution, and the superposition principle. We reiterate that pressure and static fluid level increases in Class I wells existed prior to 2013, most notably in central Kansas, where recent earthquakes are cited in the comment as evidence of a pressure plume emanating from the Kansas‐Oklahoma border, 90 km away. We show that the space‐time pattern of seismicity in this area is inconsistent with a northward propagating pressure plume and, instead, seismicity appears to be centered on and near a cluster of high‐rate injection wells, two of which are among the highest rate wells in the state. These observations, along with recent M4 + earthquakes during continued decreases in wastewater injection in southern Kansas and northern Oklahoma, question the usefulness of the comment for understanding and managing societally significant earthquakes.

Ansari, Esmail↗
DOE OSTI2024

Advanced surrogate model for electron-scale turbulence in tokamak pedestals

We derive an advanced surrogate model for predicting turbulent transport at the edge of tokamaks driven by electron temperature gradient (ETG) modes. Our derivation is based on a recently developed sensitivity-driven sparse grid interpolation approach for uncertainty quantification and sensitivity analysis at scale, which informs the set of parameters that define the surrogate model as a scaling law. Our model reveals that ETG-driven electron heat flux is influenced by the safety factor q, electron beta β e and normalized electron Debye length λ D , in addition to well-established parameters such as the electron temperature and density gradients. To assess the trustworthiness of our model's predictions beyond training, we compute prediction intervals using bootstrapping. The surrogate model's predictive power is tested across a wide range of parameter values, including within-distribution testing parameters (to verify our model) as well as out-of-bounds and out-of-distribution testing (to validate the proposed model). Overall, validation efforts show that our model competes well with, or can even outperform, existing scaling laws in predicting ETG-driven transport.

fusion plasma↗
DOE OSTI2022

A general framework for quantifying uncertainty at scale

Abstract In many fields of science, comprehensive and realistic computational models are available nowadays. Often, the respective numerical calculations call for the use of powerful supercomputers, and therefore only a limited number of cases can be investigated explicitly. This prevents straightforward approaches to important tasks like uncertainty quantification and sensitivity analysis. This challenge can be overcome via our recently developed sensitivity-driven dimension-adaptive sparse grid interpolation strategy. The method exploits, via adaptivity, the structure of the underlying model (such as lower intrinsic dimensionality and anisotropic coupling of the uncertain inputs) to enable efficient and accurate uncertainty quantification and sensitivity analysis at scale. Here, we demonstrate the efficiency of this adaptive approach in the context of fusion research, in a realistic, computationally expensive scenario of turbulent transport in a magnetic confinement tokamak device with eight uncertain parameters, reducing the effort by at least two orders of magnitude. In addition, we show that this refinement method intrinsically provides an accurate surrogate model that is nine orders of magnitude cheaper than the high-fidelity model.

Farcaş, Ionuţ-Gabriel (ORCID:0000000238841580)↗
DOE OSTI2021

A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators, the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre, a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Nucleon-Pion Spectroscopy from Sparsened Correlators

Neutrino oscillation experiments require accurate reconstructions of neutrino energies, which depend in part on a theoretical understanding of the axial $N\rightarrow\Delta$ transition form factors. A lattice QCD study of this transition will require construction of all hadronic states with energies up to $m_\Delta$, which at the physical point includes $N\pi$ and $N\pi\pi$. Building interpolating operators from sparse grids at the source and sink is a versatile method that allows construction of a wide range of diagram topologies and has successfully been used in other multi-hadron calculations. We will discuss application of this method to nucleon-pion systems and present preliminary results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Towards Lattice QCD Calculations of Pion Production

Neutrino oscillation experiments require accurate reconstructions of neutrino energies, which depend in part on a theoretical understanding of the axial N→Δ transition form factors. A lattice QCD study of this transition will require construction of all hadronic states with energies up to mΔ, which at the physical point includes Nπ and Nππ. Building interpolating operators from sparse grids at the source and sink is a versatile method that allows construction of a wide range of diagram topologies and has successfully been used in other multi-hadron calculations. We will discuss application of this method to nucleon-pion systems and present preliminary results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Gaussian Process Regression under Computational and Epistemic Misspecification

Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper investigates the effect of such kernel approximations on the interpolation error. We introduce a unified framework to analyze Gaussian process regression under important classes of computational misspecification: Karhunen-Loève expansions that result in low-rank kernel approximations, multiscale wavelet expansions that induce sparsity in the covariance matrix, and finite element representations that induce sparsity in the precision matrix. Furthermore, our theory also accounts for epistemic misspecification in the choice of kernel parameters.

Gaussian process regression↗
DOE OSTI2024

Collocation methods for nonlinear differential equations on low-rank manifolds

We introduce new methods for integrating nonlinear differential equations on low-rank manifolds. These methods rely on interpolatory projections onto the tangent space, enabling low-rank time integration of vector fields that can be evaluated entry-wise. A key advantage of our approach is that it does not require the vector field to exhibit low-rank structure, thereby overcoming significant limitations of traditional dynamical low-rank methods based on orthogonal projection. To construct the interpolatory projectors, we develop a sparse tensor sampling algorithm based on the discrete empirical interpolation method (DEIM) that parameterizes tensor train manifolds and their tangent spaces with cross interpolation. Using these projectors, we propose two time integration schemes on low-rank tensor train manifolds. The first scheme integrates the solution at selected interpolation indices and constructs the solution with cross interpolation. The second scheme generalizes the well-known orthogonal projector-splitting integrator to interpolatory projectors. We demonstrate the proposed methods with applications to several tensor differential equations arising from the discretization of partial differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Learning an Algebriac Multrigrid Interpolation Operator Using a Modified GraphNet Architecture

This work, building on previous efforts, develops a suite of new graph neural network machine learning architectures that generate data-driven prolongators for use in Algebraic Multigrid (AMG). Algebraic Multigrid is a powerful and common technique for solving large, sparse linear systems. Its effectiveness is problem dependent and heavily depends on the choice of the prolongation operator, which interpolates the coarse mesh results onto a finer mesh. Previous work has used recent developments in graph neural networks to learn a prolongation operator from a given coefficient matrix. In this paper, we expand on previous work by exploring architectural enhancements of graph neural networks. A new method for generating a training set is developed which more closely aligns to the test set. Asymptotic error reduction factors are compared on a test suite of 3-dimensional Poisson problems with varying degrees of element stretching. Results show modest improvements in asymptotic error factor over both commonly chosen baselines and learning methods from previous work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

GPU-Accelerated Analytic Simulation of Sparse Ionization Signal Formation in Pixelated Projection Detector

This paper presents a GPU-accelerated simulation package, TRED, for next-generation neutrino detectors with pixelated charge readout, leveraging community-driven software ecosystems to ensure adaptability and extensibility. We introduce two generic contributions: (i) an effective-charge representation based on Gaussian quadrature rules, in which the linear- interpolation factors for the field response inside each voxel are absorbed into the effective charge, and (ii) a sparse, block- binned tensor representation that enables efficient FFT-based computation of induced signals on readout electrodes for sparsely activated detector volumes. The former captures structure inside a voxel without dense sampling, while the latter achieves low memory usage and scalable runtime, as demonstrated in bench- mark studies. The underlying data representation is applicable to large-scale detectors and to other computational problems involving sparse activity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Graph theory inspired anomaly detection at the LHC

Designing model-independent anomaly detection algorithms for analyzing LHC data remains a central challenge in the search for new physics, due to the high dimensionality of collider events. In this work, we develop a graph autoencoder as an unsupervised, model-agnostic tool for anomaly detection, using the LHC Olympics dataset as a benchmark. By representing jet constituents as a graph, we introduce a method to systematically control the information available to the model through sparse graph constructions that serve as physically motivated inductive biases. Specifically, (1) we construct graph autoencoders based on locally rigid Laman graphs and globally rigid unique graphs, and (2) we explore the clustering of jet constituents into subjets to interpolate between high- and low-level input representations. We obtain the best performance, measured in terms of the Significance Improvement Characteristic curve for an intermediate level of subjet clustering and certain sparse unique graph constructions. We further investigate the role of graph connectivity in jet classification tasks. Our results demonstrate the potential of leveraging graph-theoretic insights to refine and increase the interpretability of machine learning tools for collider experiments.

Automation↗
DOE OSTI2026

A scalable framework for efficient coupling of thermal and microstructural simulations in additive manufacturing

Predicting microstructure evolution in metal additive manufacturing (AM) is important for process optimization, but spatiotemporal scale disparities between thermal transport and microstructure evolution create significant challenges for efficient data transfer between simulation codes. To address this, we present Stork, a scalable framework for coupling thermal and microstructural simulations. Stork uses a sparse data representation to identify and store active solidification sub-volumes, enabling highly parallel quad-linear interpolation from coarse thermal grids to fine microstructure grids without large intermediate storage. We demonstrate the framework by coupling the semi-analytic heat transfer code 3DThesis with the time-parallel cellular automata code Toucan. This approach achieves over two orders of magnitude reduction in data generation time and file size compared to prior workflows. Numerical studies show that quad-linear interpolation preserves grain morphology and crystallographic texture in laser powder bed fusion (LPBF) simulations for coarsening ratios up to 16. Overall, Stork provides a scalable pathway for high-throughput, component-scale AM simulations on modern high-performance computing systems.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Underestimation of multi-decadal global O 2 loss due to an optimal interpolation method

Abstract. The global ocean's oxygen content has declined significantly over the past several decades and is expected to continue decreasing under global warming, with far-reaching impacts on marine ecosystems and biogeochemical cycling. Determining the oxygen trend, its spatial pattern, and uncertainties from observations is fundamental to our understanding of the changing ocean environment. This study uses a suite of CMIP6 Earth system models to evaluate the biases and uncertainties in oxygen distribution and trends due to sampling sparseness. Model outputs are sub-sampled according to the spatial and temporal distribution of the historical shipboard measurements, and the data gaps are filled by a simple optimal interpolation method using Gaussian covariance with a constant e-folding length scale. Sub-sampled results are compared to full model output, revealing the biases in global and basin-wise oxygen content trends. The simple optimal interpolation underestimates the modeled global deoxygenation trends, capturing approximately two-thirds of the full model trends. The North Atlantic and subpolar North Pacific are relatively well sampled, and the simple optimal interpolation is capable of reconstructing more than 80 % of the oxygen trend in the non-eddying CMIP models. In contrast, pronounced biases are found in the equatorial oceans and the Southern Ocean, where the sampling density is relatively low. The application of the simple optimal interpolation method to the historical dataset estimated the global oxygen loss to be 1.5 % over the past 50 years. However, the ratio of the global oxygen trend between the sub-sampled and full model output has increased the estimated loss rate in the range of 1.7 % to 3.1 % over the past 50 years, which partially overlaps with previous studies. The approach taken in this study can provide a framework for the intercomparison of different statistical gap-filling methods to estimate oxygen content trends and their uncertainties due to sampling sparseness.

Ito, Takamitsu (ORCID:000000019873099X)↗
DOE OSTI2022

Interpolation as a means of shift selection for multilevel Monte Carlo with lattice displacements

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse of the lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. We present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore choose shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation

Whyte, Travis↗