Search NASA⌕ Search

SEARCH · Search NASA

Results for “Basis functions”

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

A Multivariate Space‐Time Dynamic Model for Characterizing the Atmospheric Impacts Following the Mt. Pinatubo Eruption

The June 1991 Mt. Pinatubo eruption resulted in a massive increase of sulfate aerosols in the atmosphere, absorbing radiation and leading to global changes in surface and stratospheric temperatures. A volcanic eruption of this magnitude serves as a natural analog for stratospheric aerosol injection, a proposed solar radiation modification method to combat a warming climate. The impacts of such an event are multifaceted and region-specific. Our goal is to characterize the multivariate and dynamic nature of the atmospheric impacts following the Mt. Pinatubo eruption. We developed a multivariate space-time dynamic linear model to understand the full extent of the spatially- and temporally-varying impacts. Specifically, spatial variation is modeled using a flexible set of basis functions for which the basis coefficients are allowed to vary in time through a vector autoregressive (VAR) structure. This novel model is cast in a Dynamic Linear Model (DLM) framework and estimated via a customized MCMC approach. We demonstrate how the model quantifies the relationships between key atmospheric parameters prior to and following the Mt. Pinatubo eruption with reanalysis data from MERRA-2 and highlight when such a model is advantageous over univariate models.

Dynamic Linear Model↗
DOE OSTI2025

Siegert-pseudostate formulation with B-splines

Siegert states (SSs) serve as a useful basis for studying quantum scattering from finite-range potentials. Since they form a discrete instead of continuous set of eigen-solutions, SSs are convenient for performing electronic structure calculations in atoms, molecules, and plasmas. Numerical instabilities may arise, however, in the computation of SSs if the potential vanishes for some extended region, a situation commonly occurring in plasma calculations. Here, in this paper, we identify the cause of these instabilities as the use of non-localized radial basis functions. We thus advocate the use of localized radial basis functions, in particular B-splines, for more robust computations of SSs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Multiclass Classification Using Bayesian Multivariate Adaptive Regression Splines

We present a new Bayesian model for the problem of multiclass classification. In this model, the probabilities of class membership of a given observation are determined by the mean of a latent Gaussian distribution. The mean functions of this latent distribution consist of combinations of highly flexible basis functions of the inputs: multivariate adaptive regression splines (MARS), first developed for multiple regression. We use reversible jump Markov chain Monte Carlo to make inference on the classification model, including the number of basis functions. We compare the probabilistic classification performance of our proposed approach to existing methods on simulated and benchmark data, and compare uncertainty estimates on simulated data. Our proposed method compares favorably with existing Bayesian and frequentist multiclass classification methods in out-of-sample probabilistic classification, and uncertainty estimation of these probabilistic classifications. We examine the fit of the proposed method to a data set of hurricane storm surge levels near Delaware Bay, US, and conclude that sea level rise is a key contributor to damage delivered by storm surge.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Linear-Scaling Local Natural Orbital-Based Full Triples Treatment in Coupled-Cluster Theory

We present an efficient, asymptotically linear-scaling implementation of the canonically O(N 8 ) coupled-cluster method with singles, doubles, and full triples excitations (CCSDT) method. We apply the domain-based local pair natural orbital (DLPNO) approach for computing CCSDT amplitudes. Our method, called DLPNO–CCSDT, uses the converged coupled-cluster amplitudes from a preceding DLPNO–CCSD(T) computation as a starting point for the solution of the CCSDT equations in the local natural orbital basis. To simplify the working equations, we t1-dress our two-electron integrals and Fock matrices, allowing our equations to take on the form of CCDT. With appropriate parameters, our method can recover more than 99.99% of the total canonical CCSDT correlation energy. In addition, we demonstrate that our method consistently yields sub-kJ mol –1 errors in relative energies when compared to canonical CCSDT, and, likewise, when computing the difference between CCSDT and CCSD(T). Finally, to highlight the low scaling of our algorithm, we present timings on linear alkanes (up to 30 carbons and 730 basis functions) and water clusters (up to 131 water molecules and 3144 basis functions).

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

Linear-scaling quadruple excitations in local pair natural orbital coupled-cluster theory

Here, we present a fast, asymptotically linear-scaling implementation of the perturbative quadruples energy correction in coupled-cluster theory using local natural orbitals. Our work follows the domain-based local pair natural orbital (DLPNO) approach previously applied to lower levels of excitations in coupled-cluster theory. Our DLPNO-CCSDT(Q) algorithm uses converged doubles and triples amplitudes from a preceding DLPNO-CCSDT computation to compute the quadruples amplitude and energy in the quadruples natural orbital (QNO) basis. We demonstrate the compactness of the QNO space, showing that more than 95% of the (Q) correction can be recovered using relatively loose natural orbital cutoffs, compared to the tighter cutoffs used in pair and triples natural orbitals at lower levels of coupled-cluster theory. We also highlight the accuracy of our algorithm in the computation of relative energies, which yields deviations of sub-kJ mol −1 in relative energy compared to the canonical CCSDT(Q). Timings are conducted on a series of growing linear alkanes (up to 10 carbons and 608 basis functions) and water clusters (up to 49 water molecules and 2842 basis functions) to establish the asymptotic linear-scaling of our DLPNO-(Q) algorithm.

Auxiliary functions↗
DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗
DOE OSTI2024

Performance Improvements of the Griffin Solvers in FY24

The Griffin code is a MOOSE-based reactor physics application jointly developed by Idaho National Laboratory and Argonne National Laboratory under the Department of Energy Office of Nuclear Energy Nuclear Energy Advanced Modeling and Simulation Program. This fiscal year, we have made significant efforts to improve the performance of transport solver options and cross-section generation for the efficient use of Griffin in advanced reactor applications. For the HFEM-PN solver, the residual evaluations of HFEM kernels were optimized by utilizing the pre- computed averaged cross sections for individual elements. Numerical integration involving the evaluation of basis functions at quadrature points was bypassed by facilitating precomputed element mass matrices for response matrices. Red-black iterations were improved by introducing a new generalized minimum residual based solver. The memory usage of response matrix storage was significantly reduced by applying basis function rotations on interfaces and calculating volumetric odd-parity moments on the fly. Additionally, the adjoint flux and transient calculation capabilities of the HFEM-PN solver were successfully implemented and verified using the TWIGL benchmark problem. For the DFEM-SN solver, memory footprint and computation time were significantly reduced by not treating angular flux vectors as the MOOSE nonlinear system vectors. Specifically for IQS, scalar adjoint weighting was introduced to further eliminate angular adjoint flux storage in the MOOSE auxiliary system. It was demonstrated through the three-dimensional Advanced Burner Test Reactor core problem that the memory usage for transient calculations with the IQS method was reduced by over 7.5× compared to before the optimizations. For the self-shielding application programming interface, a new double-heterogeneity treatment method, named the Bell Function-Based Analytic Two-Region Slowing Down Method, was developed to efficiently flux-volume homogenize TRISO particles with the matrix. Additionally, optimizations were made to hyper- fine group (HFG) slowing down calculations by pretabulating collision probability coefficients and grouping isotopes, significantly reducing the computational time for calculating scattering sources per HFG. Lastly, the pin power reconstruction module was extended to account for temporal behavior in a microreactor analysis problem, specifically for a control drum transient. Verification tests for each of these improvements demonstrated significant performance enhancements and memory reduction.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Accuracy of kinetic equilibrium reconstruction of NSTX and NSTX-U plasmas and its impact on the transport and stability analysis

An accurate magnetohydrodynamic (MHD) equilibrium reconstruction is an essential starting point for stability and transport plasma analysis. Herein this work describes an approach for obtaining kinetic equilibrium reconstructions using the OMFIT framework, which has been applied for the first time to spherical tokamak data from NSTX and NSTX-U. The EFIT equilibrium solver is integrated with experimental data analysis procedures and subsequent TRANSP transport simulations to enhance the accuracy of the reconstruction, in particular, at the edge region, by adding constraints on the total pressure and current density profiles, based on the transport code solution. The accuracy of the equilibrium reconstruction depends on the uncertainty and number of constraints, as well as the choice of basis functions to represent the pressure and current density profiles. Improved fidelity of the equilibrium reconstruction is demonstrated by reducing the variability of the magnetic axis and boundary locations from several centimeters, for reconstructions based on magnetic and experimental pressure constraints, to only several millimeters, for kinetic reconstructions based on transport code constraints, when different representations of basis functions were tested. The variability of the safety factor on axis was reduced ten times in the same sensitivity study. The accuracy of the equilibrium reconstruction and subsequent mapping of the experimental kinetic profile data have a significant impact on the trapped gyro Landau fluid and linear CGYRO turbulence simulations, which predict different spectra of unstable modes and turbulent fluxes for cases with different numbers of constraints in the equilibrium reconstruction. Conversely, the stability analysis performed using the GATO code shows plasmas that are stable to n = 1 MHD modes in both equilibria using magnetic and experimental pressure constraints as well as the transport code constrained equilibrium. However, a scan of parameters away from these conditions shows considerable deviation in the threshold of unstable modes between these reconstructions. Therefore, for reliable plasma analysis and use in turbulence and stability calculations, a high-fidelity equilibrium reconstruction with accurate kinetic constraints based on transport code solutions is necessary.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Forward variable selection enables fast and accurate dynamic system identification with Karhunen-Loève decomposed Gaussian processes

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are O ( N P 2 ) in training and O ( P ) per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a ‘Susceptible, Infected, Recovered’ (SIR) toy problem, along with the experimental ‘Cascaded Tanks’ benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package.

Hayes, Kyle↗
DOE OSTI2026

When Do Band Gap Calculations Agree with Experiments in Monolayer-Protected Cu 14 and Au 20 Atomically Precise Nanoclusters? A (TD)-DFT Comparison of HOMO–LUMO, Fundamental, Optical, and Electrochemical Energy Gaps

In view of the tremendous progress in atomically precise metal nanoclusters where electrochemical and optical energetics are routinely supported by computations to establish structure−function correlations, we explore the relationship between different protocols for measuring and computing band gaps of two distinct organic ligand-protected nanoclusters: [Cu 14 H 10 (MBN) 3 (PPh 3 ) 8 ] + and Au 20 (TBBT) 16 . Through UV/visible spectroscopy and differential pulse voltammetry, we measure optical and electrochemical band gaps in those systems. We then compare these experimentally determined gaps to HOMO−LUMO gaps, fundamental gaps, vertical excitation energies, and E o ox − E o red potentials computed using different density functional theory (DFT) or time-dependent DFT (TDDFT) methods. Specifically, in both copper and gold nanoclusters, we test the effect of truncating inert ligands from the model and compare density functionals with varying degrees of Hartree−Fock (HF) exchange from 0 to 50%, range-separated hybrids with a varying long-range tuning parameter, different correlation functionals, basis sets, and (equilibrium and nonequilibrium) continuum solvation models. Despite having different frontier orbital characters (the copper nanocluster has a metal-to-ligand charge transfer character while the gold nanocluster has metal-centered frontier orbitals), both nanoclusters display a similar sensitivity of the HOMO−LUMO gap to the HF exchange that is partially mitigated when computing the fundamental, optical, and electrochemical gaps. Other factors, such as the nature of the correlation functional, basis set, and geometry relaxation, have a considerably smaller effect on computed band gaps in these systems. Overall, this work provides guidelines for factors of varied importance for correlating computed and experimental band gap values.

Chemical calculations↗
DOE OSTI2026

What do physics-informed DeepONets learn? Understanding and improving training for scientific computing applications

Physics-informed deep operator networks (DeepONets) have emerged as a promising approach toward numerically approximating the solution of partial differential equations (PDEs). In this work, we aim to develop further understanding of what is being learned by physics-informed DeepONets by assessing the universality of the extracted basis functions and demonstrating their potential toward model reduction with spectral methods. Results provide clarity about measuring the performance of a physics-informed DeepONet through the decays of singular values and expansion coefficients. In addition, we propose a transfer learning approach for improving training for physics-informed DeepONets between parameters of the same PDE as well as across different, but related, PDEs where these models struggle to train well. This approach results in significant error reduction and learned basis functions that are more effective in representing the solution of a PDE.

Deep operator networks↗
DOE OSTI2024

Machine-learning based model reduction for partial differential equations

We develop a novel synergistic approach between model reduction and machine learning. The specific goal of this project is to aid in the construction of reduced order models for basis functions that are custom-made to represent the solution of partial differential equations. Partial differential equations (PDEs) are one of the main mathematical tools for describing physical phenomena. However, due to either efficiency or necessity, for many real-world problems, we are interested in constructing reduced order models (ROMs) which focus only on the explicit computation of subsets of the active spatio-temporal scales in the problem, while treating the interaction with the rest of the scales approximately. The task of accurate representation of such interactions (usually called memory terms) constitutes a vast area of research known as model reduction. PI Stinis has significant expertise in the construction of ROMs for complex systems. In addition, in recent work with the project key participant Qadeer, they have utilized machine learning to acquire custom-made basis functions (CBFs) to expand the solutions of PDEs. In the proposed work, we will merge the two concepts by constructing ROMs for subsets of the CBFs needed to represent the solution of a PDE. Specifically, we will use the Mori-Zwanzig model reduction formalism to construct ROMs for subsets of CBFs for nonlinear PDEs of various complexity, as well as investigate the usage of CBFs in the spectral vanishing viscosity method for problems that can form shocks in finite time. The outcome of the research is aimed to be proof-of-concept about a novel synergistic approach between model reduction and machine learning, thus advancing the field of scientific machine learning. Such a capability will benefit the efficient modeling of physical systems appearing in various areas of interest to the DOE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Strong Correlation DMRG and DFT

This project developed new ways to improve computer simulations of materials where electrons interact strongly with each other, a challenge for today’s most widely used method, density functional theory (DFT). We used an exact numerical method, the density matrix renormalization group (DMRG), to create highly accurate reference results for simple model systems, and used these to test DFT, prove when it will converge, and even train machine-learned functionals. We also invented new kinds of localized basis functions (“gausslets” and “multi-sliced gausslets”) and a “sliced-basis” approach that make high-accuracy simulations faster and more practical. These methods were applied to extended hydrogen systems, enabling the direct derivation of accurate low-energy models from first-principles calculations. We also introduced a new formalism, Conditional-Probability DFT, which could bypass traditional approximations. The tools and results from this work, including open-source software releases, will help scientists design and understand complex quantum materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A kinetic-based regularization method for data science applications

We propose a physics-based regularization technique for function learning, inspired by statistical mechanics. By drawing an analogy between optimizing the parameters of an interpolator and minimizing the energy of a system, we introduce corrections that impose constraints on the lower-order moments of the data distribution. This minimizes the discrepancy between the discrete and continuum representations of the data, in turn allowing to access more favorable energy landscapes, thus improving the accuracy of the interpolator. Our approach improves performance in both interpolation and regression tasks, even in high-dimensional spaces. Unlike traditional methods, it does not require empirical parameter tuning, making it particularly effective for handling noisy data. We also show that thanks to its local nature, the method offers computational and memory efficiency advantages over Radial Basis Function interpolators, especially for large datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Performance evaluation of CMIP6 models on the Arctic-Siberian Plain teleconnection affecting the East Asian heat waves

The frequency and intensity of summer heat waves in East Asia have increased sharply in recent decades, significantly impacting public health and the economy. The Arctic-Siberian Plain (ASP) teleconnection pattern has been identified as a key driver, with ASP warming amplifying atmospheric circulation patterns conducive to extreme temperatures. This study evaluates the ability of Coupled Model Inter-comparison Project phase 6 models to simulate the ASP pattern across interannual variability (IAV) and intra-seasonal variability (ISV) timescales using the Common Basis Function method. The multi-model mean shows statistically significant pattern correlations with ERA5 reanalysis, with correlation coefficients of 0.90 and 0.99 for IAV and ISV, respectively. While the ASP pattern is generally well captured, models exhibit substantial inter-model diversity in the intensity and position of anticyclonic anomalies over the ASP and East Asia. Models with ASP pattern variability similar to reanalysis better reproduce extreme East Asian temperatures, whereas those over- or underestimating ASP variability exhibit lower skill. These performance differences are related to differences in simulating key variables associated with the development of the ASP pattern. Our findings highlight the role of the ASP pattern in modulating extreme heat events, as models with improved ASP simulations align more closely with observed temperature extremes. Refining ASP representations in models could enhance seasonal heat wave predictions, improving climate adaptation strategies.

Arctic-Siberian Plain (ASP)↗
DOE OSTI2025

The overlapping fragment approach for non-orthogonal configuration interaction with fragments

The non-orthogonal configuration interaction with fragments (NOCI-F) approach is extended opening the possibility to study intramolecular processes and materials with covalent or ionic lattices. So far, NOCI-F has been applied to study intermolecular energy and electron transfer employing ensembles of fragments that do not have atoms or bonds in common. The here presented approach divides the target system into two overlapping fragments that share one or more atoms and/or one or more bonds. After the construction of a collection of (multiconfigurational) fragment wave functions in a state specific optimization procedure, the fragment wave functions are combined to form many-electron basis functions for the non-orthogonal configuration interaction of the whole system. The orbitals in the overlapping fragment are defined by a corresponding orbital transformation of the fragment orbitals through a singular value decomposition. The overlapping fragments approach is first illustrated for a model system and then used to highlight some possible applications of NOCI with overlapping fragments. In conclusion, the results of excited state diffusion in transition metal oxide, intramolecular singlet fission and magnetic interactions in organic biradicals and ionic compounds are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗