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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Stabilized bases for high-order, interpolation semi-Lagrangian, element-based tracer transport

In a computational fluid model of the atmosphere, the advective transport of trace species, or tracers, can be computationally expensive. For efficiency, models often use semi-Lagrangian advection methods. High-order interpolation semi-Lagrangian (ISL) methods, in particular, can be extremely efficient, if the problem of property preservation specific to them can be addressed. Atmosphere models often use geometrically and logically nonuniform grids for efficiency and, as a result, element-based discretizations. Such grids and discretizations make stability a particular problem for ISL methods. Generally, high-order, element-based ISL methods that use the natural polynomial interpolant associated with a nodal finite-element discretization are unstable. Here, we derive new bases having order of accuracy up to nine, with positive nodal weights, that stabilize the element-based ISL method. We use these bases to construct the linear advection operator in the property-preserving Interpolation Semi-Lagrangian Element-based Transport (Islet) method. Then we discuss key software implementation details. Finally, we show performance results for the Energy Exascale Earth System Model's atmosphere dynamical core, comparing the original and new transport methods. These simulations used up to 27,600 Graphical Processing Units (GPU) on the Oak Ridge Leadership Computing Facility's Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Parallel Algebraic Multigrid for Fusion and Higher-Order PDEs

Multigrid methods play a key role in large-scale scientific simulation because they are among the fastest and most scalable approaches for solving the underlying sparse linear systems of equations that arise from a wide array of Partial Differential Equation (PDE) discretizations. Algebraic multigrid (AMG) is a special type of multigrid method that depends only on the description of the linear system, giving it better portability and broader applicability than geometric multigrid, as it requires no explicit knowledge of the problem geometry. Even though these methods are widely used today, there are still applications where further development is needed. In this report, we focus on PDEs with higher-order terms (e.g., fourth order), concentrating on a PDE that arises in tokamak edge plasma simulations (a tokamak is a machine that confines a plasma using magnetic fields and is believed to be the leading plasma confinement concept for future fusion power plants). General multigrid relaxes a linear system on coarser grids and reverses this process with interpolation, but standard AMG methods struggle with the aforementioned higher-order PDEs. We investigate cyclic coarsening and interpolation heuristics, as well as new iterative approximation methods of refining the solution at each grid to improve the existing multigrid approach. To this end, we ensure that these techniques are transferable to a parallelized setting with LLNL’s supercomputers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimal function estimation with photonic quantum sensor networks

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor []. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing. Published by the American Physical Society 2024

Bringewatt, Jacob↗
DOE OSTI2024

Quantum error mitigation by layerwise Richardson extrapolation

A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum expectation values is captured by a single parameter that, after being scaled to larger values, is eventually extrapolated to the zero-noise limit. We generalize this approach by introducing layerwise Richardson extrapolation (LRE), an error mitigation protocol in which the noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. The coefficients of the linear combination are analytically obtained from the theory of multivariate Lagrange interpolation. LRE leverages the flexible configurational space of layerwise unitary folding, allowing for a more nuanced mitigation of errors by treating the noise level of each layer of the quantum circuit as an independent variable. Furthermore, we provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Artificial intelligence “sees” split electrons

Chemical bonds between atoms are stabilized by the exchange-correlation (xc) energy, a quantum-mechanical effect in which “social distancing” by electrons lowers their electrostatic repulsion energy. Kohn-Sham density functional theory (DFT) states that the electron density determines this xc energy, but the density functional must be approximated. Furthermore, this is usually done by satisfying exact constraints of the exact functional (making the approximation predictive), by fitting to data (making it interpolative), or both. Two exact constraints—the ensemble-based piecewise linear variation of the total energy with respect to fractional electron number and fractional electron z-component of spin —require hard-to-control nonlocality. On page 1385 of this issue, Kirkpatrick et al. have taken a big step toward more accurate predictions for chemistry through the machine learning of molecular data plus the fractional charge and spin constraints, expressed as data that a machine can learn.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Data-driven models of nonautonomous systems

Nonautonomous dynamical systems are characterized by time-dependent inputs, which complicates the discovery of predictive models describing the spatiotemporal evolution of the state variables of quantities of interest from their temporal snapshots. When dynamic mode decomposition (DMD) is used to infer a linear model, this difficulty manifests itself in the need to approximate the time-dependent Koopman operators. Our approach is to approximate the original nonautonomous system with a modified system derived via a local parameterization of the time-dependent inputs. The modified system comprises a sequence of local parametric systems, which are subsequently approximated by a parametric surrogate model using the DRIPS (dimension reduction and interpolation in parameter space) framework. The offline step of DRIPS relies on DMD to build a linear surrogate model, endowed with reduced-order bases for the observables mapped from training data. The online step interpolates on suitable manifolds to construct a sequence of iterative parametric surrogate models; the target/test parameter points on these manifolds are specified by a local parameterization of the test time-dependent inputs. Here, we use numerical experimentation to demonstrate the robustness of our method and compare its performance with that of deep neural networks.

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 OSTI2022

Solvable time-like cosets and holography beyond AdS

We build a novel time-like coset sigma-model describing type-II superstring theory in a charged rotating black-brane background that interpolates between a local AdS 3 in the IR and a linear-dilaton geometry in the UV. This allows one to peform a systematic study of holography in non-AdS backgrounds which are smoothly connected to AdS 3 . We construct massless closed string states vertex operators in the NS-NS sector, calculate the corresponding two-point correlation functions, and discuss holographic interpretation of our results from 4+1 dimensional boundary field theory point of view. Compactifying the theory on T 4 , we show that the spectrum of a single long string with unit winding agrees with the spectrum of a CFT 2 deformed by TT¯. We also calculate correlation functions of operators of the dual 1+1 dimensional non-conformal boundary field theory using worldsheet techniques.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Reification of latent microstructures: On supervised unsupervised and semi-supervised deep learning applications for microstructures in materials informatics

Machine learning (ML), including deep learning (DL), has become increasingly popular in the last few years due to its continually outstanding performance. In this context, we apply machine learning techniques to "learn" the microstructure using both supervised and unsupervised DL techniques. In particular, we focus (1) on the localization problem bridging (micro)structure (localized) property using supervised DL and (2) on the microstructure reconstruction problem in latent space using unsupervised DL. The goal of supervised and semi-supervised DL is to replace crystal plasticity finite element model (CPFEM) that maps from (micro)structure (localized) property, and implicitly the (micro)structure (homogenized) property relationships, while the goal of unsupervised DL is (1) to represent high-dimensional microstructure images in a non-linear low-dimensional manifold, and (2) to discover a way to interpolate microstructures via latent space associating with latent microstructure variables. At the heart of this report is the applications of several common DL architectures, including convolutional neural networks (CNN), autoencoder (AE), and generative adversarial network (GAN), to multiple microstructure datasets, and the quest of neural architecture search for optimal DL architectures.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Predicting metal–metal interactions. II. Accelerating generalized schemes through physical insights

Operando-computational frameworks that integrate descriptors for catalyst stability within catalyst screening paradigms enable predictions of rates and selectivity on chemically faithful representations of nanoparticles under reaction conditions. These catalyst stability descriptors can be efficiently predicted by density functional theory (DFT)-based models. The alloy stability model, for example, predicts the stability of metal atoms in nanoparticles with site-by-site resolution. In this work, we use physical insights to present accelerated approaches of parameterizing this recently introduced alloy-stability model. These accelerated approaches meld quadratic functions for the energy of metal atoms in terms of the coordination number with linear correlations between model parameters and the cohesive energies of bulk metals. By interpolating across both the coordination number and chemical space, these accelerated approaches shrink the training set size for 12 fcc p- and d-block metals from 204 to as few as 24 DFT calculated total energies without sacrificing the accuracy of our model. We validate the accelerated approaches by predicting adsorption energies of metal atoms on extended surfaces and 147 atom cuboctahedral nanoparticles with mean absolute errors of 0.10 eV and 0.24 eV, respectively. This efficiency boost will enable a rapid and exhaustive exploration of the vast material space of transition metal alloys for catalytic applications.

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

Latent space dynamics identification for interface tracking with application to shock-induced pore collapse

Capturing sharp, evolving interfaces remains a central challenge in reduced-order modeling, especially when data is limited and the system exhibits localized nonlinearities or discontinuities. Here, we propose LaSDI-IT (Latent Space Dynamics Identification for Interface Tracking), a data-driven framework that combines low-dimensional latent dynamics learning with explicit interface-aware encoding to enable accurate and efficient modeling of physical systems involving moving material boundaries. At the core of LaSDI-IT is a revised autoencoder architecture that jointly reconstructs the physical field and an indicator function representing material regions or phases, allowing the model to track complex interface evolution without requiring detailed physical models or mesh adaptation. The latent dynamics are learned through linear regression in the encoded space and generalized across parameter regimes using Gaussian process interpolation with greedy sampling. We demonstrate LaSDI-IT on the problem of shock-induced pore collapse in high explosives, a process characterized by sharp temperature gradients and dynamically deforming pore geometries. The method achieves relative prediction errors below 9% across the parameter space, accurately recovers key quantities of interest such as pore area and hot spot formation, and matches the performance of dense training with only half the data. This latent dynamics prediction was 10 6 times faster than the conventional high-fidelity simulation, proving its utility for multi-query applications. These results highlight LaSDI-IT as a general, data-efficient framework for modeling discontinuity-rich systems in computational physics, with potential applications in multiphase flows, fracture mechanics, and phase change problems.

Gaussian process↗
DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Chiral properties of the nucleon interpolating current and θ-dependent observables

We revisit the chiral properties of nucleon interpolating currents, and show that of the two leading order currents j 1 and j 2 , only two linear combinations j 1 ± j 2 transform covariantly under the anomalous U⁢(1) A symmetry. As a result, calculations of quantities which vanish by symmetry in the chiral limit may produce unphysical results if carried out with different linear combinations of the currents. This includes observables such as electric dipole moments, induced by the quantum chromodynamics (QCD) parameter θ, and the θ-dependence of the nucleon mass. For completeness, we also exhibit the leading order results for nucleon electric dipole moments (d n,p ) induced by θ, and the nucleon magnetic moments (μ n,p ), when calculated using QCD sum rules for both the covariant choices of the nucleon interpolating current. The results in each channel, conveniently expressed as the ratios, d n,p /μ n,p , are numerically consistent, and reflect the required physical dependence on θ.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Deep-freeze graph training for latent learning

Scientific and engineering advances are primarily driven by multi-tier conceptual constructs and conditional theoretical frameworks. The theories allow predictions of hypothetical system responses, given a set of approximate conditions (ranges of applicability) imposed on latent parameters that cannot be measured directly. Learning to estimate the latent variables (Latent Learning) helps to pinpoint the anticipated range-edge anomalies and improves the confidence in interpretation, interpolation and extrapolation of limited experimental data. Due to high dimensionality and extreme non-linearity of the materials science problems, very large datasets are typically required for conventional data-driven model development. The vital experimental data collection, particularly on microstructural phases, is very challenging, which makes it difficult to compile a high-quality database. Incorporation of the domain knowledge into the computational graph structure, initialization and optimization processes presents a viable mechanism for developing accurate models, with limited datasets. Furthermore, this study successfully utilized the approach to build the Deep Freeze Graph (DeepFreG) by mapping known causality relationships and by digitizing empirical domain knowledge for Latent Learning (LL), with specific applications in materials science.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Ab Initio Many Body Quantum Embedding and Local Correlation in Crystalline Materials using Interpolative Separable Density Fitting

We present an efficient implementation of ab initio many-body quantum embedding and local correlation methods for infinite periodic systems through translational symmetry adapted interpolative separable density fitting, an approach which reduces the scaling of the calculations to only linear with the number of k-points. Employing this methodology, we compute correlated ground-state coupled cluster energies within density matrix embedding and local natural orbital correlation frameworks for both weakly and strongly correlated solids, using up to 1000 k-points. By extrapolating the local correlation domains and k-point sampling we further obtain estimates of the full coupled cluster with singles, doubles, and perturbative triples ground-state energies in the thermodynamic limit.

Chemical Physics (physics.chem-ph)↗
DOE OSTI2023

Generating accurate density matrices on the tangent space of a Grassmann manifold

Interpolating a density matrix from a set of known density matrices is not a trivial task. This is because a linear combination of density matrices does not necessarily correspond to another density matrix. In this Communication, density matrices are examined as objects of a Grassmann manifold. Although this manifold is not a vector space, its tangent space is a vector space. As a result, one can map the density matrices on this manifold to their corresponding vectors in the tangent space and then perform interpolations on that tangent space. The resulting interpolated vector can be mapped back to the Grassmann manifold, which can then be utilized (1) as an optimal initial guess for a self-consistent field (SCF) calculation or (2) to derive energy directly without time-consuming SCF iterations. Such a promising approach is denoted as Grassmann interpolation (G-Int). The hydrogen molecule has been used to illustrate that the described interpolated method in this work preserves the essential attributes of a density matrix. For phosphorus mononitride and ferrocene, it was demonstrated numerically that reference points for the definition of the corresponding tangent spaces can be chosen arbitrarily. In addition, the interpolated density matrices provide a superior and essentially converged initial guess for an SCF calculation to make the SCF procedure itself unnecessary. Finally, this accurate, efficient, robust, and systematically improved G-Int strategy has been used for the first time to generate highly accurate potential energy surfaces with fine details for the difficult case, ferrocene.

Chemistry↗
DOE OSTI2022

Non-intrusive reduced order modeling of natural convection in porous media using convolutional autoencoders: Comparison with linear subspace techniques

Natural convection in porous media is a highly nonlinear multiphysical problem relevant to many engineering applications (e.g., the process of CO 2 sequestration). Here, we extend and present a non-intrusive reduced order model of natural convection in porous media employing deep convolutional autoencoders for the compression and reconstruction and either radial basis function (RBF) interpolation or artificial neural networks (ANNs) for mapping parameters of partial differential equations (PDEs) on the corresponding nonlinear manifolds. To benchmark our approach, we also describe linear compression and reconstruction processes relying on proper orthogonal decomposition (POD) and ANNs. Further, we present comprehensive comparisons among different models through three benchmark problems. The reduced order models, linear and nonlinear approaches, are much faster than the finite element model, obtaining a maximum speed-up of 7 × 10 6 because our framework is not bound by the Courant–Friedrichs–Lewy condition; hence, it could deliver quantities of interest at any given time contrary to the finite element model. Our model’s accuracy still lies within a relative error of 7% in the worst-case scenario. We illustrate that, in specific settings, the nonlinear approach outperforms its linear counterpart and vice versa. We hypothesize that a visual comparison between principal component analysis (PCA) and t-Distributed Stochastic Neighbor Embedding (t-SNE) could indicate which method will perform better prior to employing any specific compression strategy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗