Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Gradient-based constrained optimization using a database of linear reduced-order models

A methodology grounded in model reduction is presented for accelerating the gradient-based solution of a family of linear or nonlinear constrained optimization problems where the constraints include at least one linear Partial Differential Equation (PDE). A key component of this methodology is the construction, during an offline phase, of a database of pointwise, linear, Projection-based Reduced-Order Models (PROM)s associated with a design parameter space and the linear PDE(s). A parameter sampling procedure based on an appropriate saturation assumption is proposed to maximize the efficiency of such a database of PROMs. A real-time method is also presented for interpolating at any queried but unsampled parameter vector in the design parameter space the relevant sensitivities of a PROM. The practical feasibility, computational advantages, and performance of the proposed methodology are demonstrated for several realistic, nonlinear, aerodynamic shape optimization problems governed by linear aeroelastic constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

DRIPS: A framework for dimension reduction and interpolation in parameter space

Reduced-order models are often used to describe the behavior of complex systems, whose simulation with a full model is too expensive, or to extract salient features from the full model’s output. We introduce a new model-reduction framework DRIPS (dimension reduction and interpolation in parameter space) that combines the offline local model reduction with the online parameter interpolation of reduced-order bases (ROBs). The offline step of this framework relies on dynamic mode decomposition (DMD) to build a low-rank linear surrogate model, equipped with a local ROB, for quantities of interest derived from the training data generated by repeatedly solving the (nonlinear) high-fidelity model for multiple parameter points. The online step consists of the construction of a parametric reduced-order model for each target/test point in the parameter space, with the interpolation of ROBs done on a Grassman manifold and the interpolation of reduced-order operators done on a matrix manifold. The DMD component enables DRIPS to model (typically low-dimensional) quantities of interest directly, without having to access the (typically high-dimensional and possibly nonlinear) operators in a high-fidelity model that governs the dynamics of the underlying high-dimensional state variables, as required in projection-based reduced-order modeling. A series of numerical experiments suggests that DRIPS yields a model reduction, which is computationally more efficient than the commonly used projection-based proper orthogonal decomposition; it does so without requiring a prior knowledge of the governing equation for quantities of interest. Furthermore, for the nonlinear systems considered, DRIPS is more accurate than Gaussian-process interpolation (Kriging).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Scalable Gaussian Process Approach to Shear Mapping with MuyGPs

Analysis of cosmic shear is an integral part of understanding structure growth across cosmic time, which in turn provides us with information about the nature of dark energy. Conventional methods generate shear maps from which we can infer the matter distribution in the universe. Current methods (e.g., Kaiser–Squires inversion) for generating these maps, however, are tricky to implement and can introduce bias. Recent alternatives construct a spatial process prior for the lensing potential, which allows for inference of the convergence and shear parameters given lensing shear measurements. Realizing these spatial processes, however, scales cubically in the number of observations—an unacceptable expense as near-term surveys expect billions of correlated measurements. Therefore, we present a linearly scaling shear map construction alternative using a scalable Gaussian process prior called MuyGPs. MuyGPs avoids cubic scaling by conditioning interpolation on only nearest neighbors and fits hyperparameters using batched leave-one-out cross-validation. This work is the first step toward a full, scalable mass mapping method. We work in a simplified regime where we validate our method by interpolating and analyzing maps given noisy point-estimate data from all three shear fields, taken from a suite of N -body ray-tracing simulations. We also show that we can perform these operations at the scale of billions of galaxies on high-performance computing platforms.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Algebraic Multigrid with Optimal Interpolation and Adaptive Smoothers (Final Report)

The project team continued with work on developing new bootstrap AMG techniques for solving symmetric and non-symmetric PDE systems. The focus of this work is to derive more reliable measures of the quality of the coarse space set than the convergence rate of the standard F-relaxation form of CR and a more robust form of interpolation than the so-called ideal form. We have successfully derived a sharp variant of CR that gives the precise convergence rate of the two-grid method using this optimal interpolation and, in addition, we derived a new Generalized Bootstrap AMG setup algorithm that uses as its main tool a multilevel eigensolver for the generalized eigenvalue problem involving the system matrix and the symmetrized smoother. In addition, the approach allows for general block smoothers with overlap. We have applied the method to scalar diffusion problems, linear elasticity, and Maxwell’s and the method shows marked improvements over existing AMG methods for these problems. In addition, the team worked with CASC members on new forms of ideal AMG interpolation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Solving MaxCut with quantum imaginary time evolution

We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an imaginary-time-dependent Hamiltonian interpolating between a given graph and a subgraph with two edges excised. We apply the method to thousands of randomly selected graphs with up to fifty vertices. We show that our algorithm exhibits a 93% and above performance converging to the maximum solution of the MaxCut problem for all considered graphs. Our results compare favorably with the performance of classical algorithms, such as the greedy and Goemans–Williamson algorithms. We also discuss the overlap of the final state of the QITE algorithm with the ground state as a performance metric, which is a quantum feature not shared by other classical algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Interpolating the ‘t Hooft model between Instant and Light-Front dynamics in the Coulomb Gauge

The 1+1D model of quantum chromodynamics (QCD) in the infinite number of colors, or 't Hooft model, can be interpolated between the instant form dynamics (IFD) and the light-front dynamics (LFD) using an interpolation parameter 0 (IFD) ≤ δ ≤ π/4 (LFD). This was realized in the interpolating axial gauge which links the axial gauge (A 1 = 0) in IFD and the light-front gauge (A + = 0) [1]. In this presentation, we discuss the corresponding realization in the interpolating Coulomb gauge which links the temporal gauge (A 0 = 0) in IFD and the light-front gauge (A + = 0) and its benefit of resolving the issue associated with the absence of the conjugate field to the gauge field A 0 in the axial gauge. In both gauges, all degrees of freedom are physical making these gauge choices ideal for finding the bound-state equations and for renormalizability. Although the gauge independence of the physical observables such as the meson mass spectra following Regge trajectories may be guaranteed due to the gauge symmetry of QCD, the realization and interpretation of the identical physical results may depend on the gauge choices. Here, we discuss such difference in the realization of the confinement phenomena ala linear potential in the two different gauges, Coulomb vs. Axial, and highlight the gauge independent physical results expected. We also comment on the utility of the interpolation which leads to an alternative quasi-PDF that can be implemented in the lattice QCD without suffering from the large momentum boost.

Duggin, Hunter↗
DOE OSTI2024

Multiparticle interpolating operators in quantum field theories with cubic symmetry

Numerical studies of lattice quantum field theories are conducted in finite spatial volumes, typically with cubic symmetry in the spatial coordinates. Motivated by these studies, this work presents a general algorithm to construct multiparticle interpolating operators for quantum field theories with cubic symmetry. The algorithm automates the block diagonalization required to combine multiple operators of definite linear momentum into irreducible representations of the appropriate little group. Examples are given for distinguishable and indistinguishable particles including cases with both zero and nonzero spin.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Skyrmions and hopfions in three-dimensional frustrated magnets

Here, a model of an inversion-symmetric frustrated spin system is introduced which hosts three-dimensional extensions of magnetic skyrmions. In the continuum approximation, this model reduces to a nonlinear sigma model on a squashed sphere that has a natural interpolating parameter. At one limit of the parameter, the model reduces to a frustrated magnetic system earlier considered by Sutcliffe as a host to hopfions, and in the other limit, it becomes very similar to the 3D Skyrme model. To better understand the relation between hopfions and 3D skyrmions, a model interpolating between the Faddeev-Niemi and the Skyrme models is reconsidered and it is shown that energies of the solitons obey a linear Bogomol'nyi-Prasad-Sommerfeld bound. The 3D skyrmions in the frustrated magnetic model are found and compared to the rational map ansatz.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Time-series forecasting using manifold learning, radial basis function interpolation, and geometric harmonics

We address a three-tier numerical framework based on nonlinear manifold learning for the forecasting of high-dimensional time series, relaxing the “curse of dimensionality” related to the training phase of surrogate/machine learning models. At the first step, we embed the high-dimensional time series into a reduced low-dimensional space using nonlinear manifold learning (local linear embedding and parsimonious diffusion maps). Then, we construct reduced-order surrogate models on the manifold (here, for our illustrations, we used multivariate autoregressive and Gaussian process regression models) to forecast the embedded dynamics. Finally, we solve the pre-image problem, thus lifting the embedded time series back to the original high-dimensional space using radial basis function interpolation and geometric harmonics. The proposed numerical data-driven scheme can also be applied as a reduced-order model procedure for the numerical solution/propagation of the (transient) dynamics of partial differential equations (PDEs). In conclusion, we assess the performance of the proposed scheme via three different families of problems: (a) the forecasting of synthetic time series generated by three simplistic linear and weakly nonlinear stochastic models resembling electroencephalography signals, (b) the prediction/propagation of the solution profiles of a linear parabolic PDE and the Brusselator model (a set of two nonlinear parabolic PDEs), and (c) the forecasting of a real-world data set containing daily time series of ten key foreign exchange rates spanning the time period 3 September 2001–29 October 2020.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Collisional excitation of interstellar PN by H 2 : New interaction potential and scattering calculations

Here, rotational excitation of interstellar PN molecules induced by collisions with H 2 is investigated. We present the first ab initio four-dimensional potential energy surface (PES) for the PN–H 2 van der Waals system. The PES was obtained using an explicitly correlated coupled cluster approach with single, double, and perturbative triple excitations [CCSD(T)-F12b]. The method of interpolating moving least squares was used to construct an analytical PES from these data. The equilibrium structure of the complex was found to be linear, with H 2 aligned at the N end of the PN molecule, at an intermolecular separation of 4.2 Å. The corresponding well-depth is 224.3 cm -1 . The dissociation energies were found to be 40.19 cm -1 and 75.05 cm -1 for complexes of PN with ortho-H 2 and para-H 2 , respectively. Integral cross sections for rotational excitation in PN–H 2 collisions were calculated using the new PES and were found to be strongly dependent on the rotational level of the H 2 molecule. These new collisional data will be crucial to improve the estimation of PN abundance in the interstellar medium from observational spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Geophysical and Environmental Monitoring Data, and Subsurface Flow Modelling Results for Chicken Bone Meadow, Mt. Snodgrass, Crested Butte, CO

This dataset includes geoelectrical monitoring data acquired between October 2021 and November 2022, soil moisture and temperature data, groundwater data obtained from borehole SNIB covering the period from June 2021 to September 2022, and hydrological modelling results. The data were acquired to investigate how variations in bedrock type and topography, and vegetation cover control subsurface flow dynamics. To provide insights into the subsurface flow dynamics and their controls, a monitoring transect was installed at the Chicken Bone Meadow, Mt. Snodgrass, Crested Butte, CO, measuring the spatio-temporal variations of soil moisture, soil and snow temperature, subsurface electrical resistivity variations, and groundwater dynamics. Field data are organized in a folder structure, with Electrical Resistivity Tomography (ERT) data being provided as one file per measurement, and data of the soil moisture and temperature sensors being provided as text files covering the entire monitoring period. The ‘Locations.csv’ file contains the location of all sensors, given in NAD83 – UTM Zone 13N. ERT monitoring data has been processed to filter data based on reciprocal errors (data with errors > 30% were removed), a linear error model was fitted to each survey, and to ensure a constant set of measurements for time-lapse inversion, filtered data were interpolated and assigned a 100% measurement error. Soil moisture and temperature data were acquired at 15 min intervals, and averaged to provide 1h data. Weather data and borehole data (groundwater depth, conductivity and temperature) were acquired at 30 min intervals, and are provided as daily measurements; all measurements are averaged, except of precipitation values, which are given as daily accumulation. The hydrological model was set up along the ERT monitoring transect, and net infiltration was used as surface boundary condition and derived from the weather data. Four different results are provided, (1) results for a parameterization using hydraulic permeability and porosity as derived from the ERT data through petrophysical relationships, and (2) three simplified model results, using 1 to 3 geological layers above the bedrock. Modelling was performed using PFLOTRAN, and for each model the PFLOTRAN input files are provided. The result files include weekly hydrological modelling results (e.g., saturation, velocities, pressures), as well as the model parameterization. The dataset additionally includes a file-level metadata (flmd.csv) file that lists each file contained in the dataset with associated metadata; and a data dictionary (dd.csv) file that contains column/row headers used throughout the files along with a definition, units, and data type.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Learning genetic perturbation effects with variational causal inference

Advances in sequencing technologies have enhanced the understanding of gene regulation in cells. In particular, Perturb-seq has enabled high-resolution profiling of the transcriptomic response to genetic perturbations at the single-cell level. This understanding has implications in functional genomics and potentially for identifying therapeutic targets. Various computational models have been developed to predict perturbational effects. While deep learning models excel at interpolating observed perturbational data, they tend to overfit in the lack of enough data and may not generalize well to unseen perturbations. In contrast, mechanistic models, such as linear causal models based on gene regulatory networks, hold greater potential for extrapolation, as they encapsulate regulatory information that can predict responses to unseen perturbations. However, their application has been limited to small studies due to overly simplistic assumptions, making them less effective in handling noisy, large-scale single-cell data. We propose a hybrid approach that combines a mechanistic causal model with variational deep learning, termed Single Cell Causal Variational Autoencoder (SCCVAE). The mechanistic model employs a learned regulatory network to represent perturbational changes as shift interventions that propagate through the learned network. SCCVAE integrates this mechanistic causal model into a variational autoencoder, generating rich, comprehensive transcriptomic responses. Our results indicate that SCCVAE exhibits superior performance over current state-of-the-art baselines for extrapolating to predict unseen perturbational responses. Additionally, for the observed perturbations, the latent space learned by SCCVAE allows for the identification of functional perturbation modules and simulation of single-gene knockdown experiments of varying penetrance, presenting a robust tool for interpreting and interpolating perturbational responses at the single-cell level.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Uncertainty Quantification of Calculated Temperatures for the AGR 5/6/7 Experiment

This report documents the quantification of uncertainty of the calculated temperature data for the Advanced Gas Reactor (AGR) 5/6/7 fuel irradiation experiment conducted in the Advanced Test Reactor at Idaho National Laboratory in support of the Advanced Reactor Technologies? research and development program. Recognizing uncertainties inherent in physics and thermal simulations of the AGR 5/6/7 capsules, the results of the numerical simulations are used in combination with statistical analysis methods to improve qualification of measured data. The calculated fuel temperatures for AGR tests are also used for validation of the fission product transport and fuel performance simulation models. These crucial roles of the calculated fuel temperatures in ensuring achievement of the AGR experimental program objectives require accurate determination of the model temperature uncertainties. This report covers temperature uncertainty results for each of the five AGR 5/6/7 capsules. To quantify the uncertainty of calculated temperatures determined using the ABAQUS finite element heat transfer code, this study identifies and analyzes model parameters of potential importance to the calculated temperatures of fuel compacts and thermocouples. The selection of input parameters for uncertainty quantification is based on the ranking of their influences upon temperature predictions. Thus, selected input parameters include those with high sensitivity and those with the largest uncertainty. Propagation of model parameter uncertainty and sensitivity is then used to quantify the overall uncertainty of calculated temperatures. Measurement uncertainty, analysis of modeling assumptions, and expert judgment are used as the basis to quantify the uncertainty range for selected input parameters. The input uncertainties are dynamic, accounting for the effect of unplanned events and changes in thermal properties of capsule components over extended exposure to high temperatures and fast neutron irradiation. The sensitivity analysis performed in this work went beyond the traditional local sensitivity. Using experimental design, analysis of pairwise interactions of model parameters was performed to establish sufficiency of the time dependent first order (linear) expansion terms in constructing the temperature response surface. To achieve completeness, uncertainty propagation made use of pairwise noise correlations of model parameters. Furthermore, using an interpolation scheme over the input parameter domain, the analysis obtains time dependent sensitivity over the test campaign duration. This allows computation of uncertainty for the calculated fuel temperatures and the calculated graphite temperatures at thermocouple locations during the entire irradiation period.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

A Statistical Interpolation Code for Ocean Analysis and Forecasting

Abstract We present a data assimilation package for use with ocean circulation models in analysis, forecasting, and system evaluation applications. The basic functionality of the package is centered on a multivariate linear statistical estimation for a given predicted/background ocean state, observations, and error statistics. Novel features of the package include support for multiple covariance models, and the solution of the least squares normal equations either using the covariance matrix or its inverse—the information matrix. The main focus of this paper, however, is on the solution of the analysis equations using the information matrix, which offers several advantages for solving large problems efficiently. Details of the parameterization of the inverse covariance using Markov random fields are provided and its relationship to finite-difference discretizations of diffusion equations are pointed out. The package can assimilate a variety of observation types from both remote sensing and in situ platforms. The performance of the data assimilation methodology implemented in the package is demonstrated with a yearlong global ocean hindcast with a 1/4° ocean model. The code is implemented in modern Fortran, supports distributed memory, shared memory, multicore architectures, and uses climate and forecasts compliant Network Common Data Form for input/output. The package is freely available with an open source license from www.tendral.com/tsis/ .

Srinivasan, Ashwanth↗
DOE OSTI2020

An Evolve-Then-Correct Reduced Order Model for Hidden Fluid Dynamics

In this paper, we put forth an evolve-then-correct reduced order modeling approach that combines intrusive and nonintrusive models to take hidden physical processes into account. Specifically, we split the underlying dynamics into known and unknown components. In the known part, we first utilize an intrusive Galerkin method projected on a set of basis functions obtained by proper orthogonal decomposition. We then present two variants of correction formula based on the assumption that the observed data are a manifestation of all relevant processes. The first method uses a standard least-squares regression with a quadratic approximation and requires solving a rank-deficient linear system, while the second approach employs a recurrent neural network emulator to account for the correction term. We further enhance our approach by using an orthonormality conforming basis interpolation approach on a Grassmannian manifold to address off-design conditions. The proposed framework is illustrated here with the application of two-dimensional co-rotating vortex simulations under modeling uncertainty. The results demonstrate highly accurate predictions underlining the effectiveness of the evolve-then-correct approach toward real-time simulations, where the full process model is not known a priori.

long short-term memory↗
DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗
DOE OSTI2025

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗