Search NASA⌕ Search

SEARCH · Search NASA

Results for “Functional approximation”

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

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗

Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation

Whittle index policy is a heuristic to the intractable restless multi-armed bandits (RMAB) problem. Although it is provably asymptotically optimal, finding Whittle indices remains difficult. In this paper, we present Neural-Q-Whittle, a Whittle index based Q-learning algorithm for RMAB with neural network function approximation, which is an example of nonlinear two-timescale stochastic approximation with Q-function values updated on a faster timescale and Whittle indices on a slower timescale. Despite the empirical success of deep Q-learning, the non-asymptotic convergence rate of Neural-Q-Whittle, which couples neural networks with two-timescale Q-learning largely remains unclear. This paper provides a finite-time analysis of Neural-Q-Whittle, where data are generated from a Markov chain, and Q-function is approximated by a ReLU neural network. Our analysis leverages a Lyapunov drift approach to capture the evolution of two coupled parameters, and the nonlinearity in value function approximation further requires us to characterize the approximation error. Combing these provide Neural-Q-Whittle with convergence rate, where is the number of iterations.

reinforcement learning, structured learning, conve↗

Self‐Consistent Convolutional Density Functional Approximations: Application to Adsorption at Metal Surfaces

The exchange-correlation (XC) functional in density functional theory is used to approximate multi-electron interactions. A plethora of different functionals are available, but nearly all are based on the hierarchy of inputs commonly referred to as “Jacob's ladder.” This paper introduces an approach to construct XC functionals with inputs from convolutions of arbitrary kernels with the electron density, providing a route to move beyond Jacob's ladder. We derive the variational derivative of these functionals, showing consistency with the generalized gradient approximation (GGA), and provide equations for variational derivatives based on multipole features from convolutional kernels. A proof-of-concept functional, PBEq, which generalizes the PBEα framework with mathematical equation being a spatially-resolved function of the monopole of the electron density, is presented and implemented. It allows a single functional to use different GGAs at different spatial points in a system, while obeying PBE constraints. Analysis of the results underlines the importance of error cancellation and the XC potential in data-driven functional design. After testing on small molecules, bulk metals, and surface catalysts, the results indicate that this approach is a promising route to simultaneously optimize multiple properties of interest.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning for accuracy in density functional approximations

Machine learning techniques have found their way into computational chemistry as indispensable tools to accelerate atomistic simulations and materials design. In addition, machine learning approaches hold the potential to boost the predictive power of computationally efficient electronic structure methods, such as density functional theory, to chemical accuracy and to correct for fundamental errors in density functional approaches. In this paper, recent progress in applying machine learning to improve the accuracy of density functional and related approximations is reviewed. Promises and challenges in devising machine learning models transferable between different chemistries and materials classes are discussed with the help of examples applying promising models to systems far outside their training sets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Physically interpretable approximations of many-body spectral functions

The rational function approximation provides a natural and interpretable representation of response functions such as the many-body spectral functions. We apply the vector fitting (VFIT) algorithm to fit a variety of spectral functions calculated from the Holstein model of electron-phonon interactions. We show that the resulting rational functions are highly efficient in their fitting of sharp features in the spectral functions, and could provide a means to infer physically relevant information from a spectral data set. The position of the peaks in the approximated spectral function are determined by the location of poles in the complex plane. Additionally, we developed a variant of VFIT that incorporates regularization to improve the quality of fits. With this procedure, we demonstrate it is possible to achieve accurate spectral function fits that vary smoothly as a function of physical conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

Heterogeneous Mixtures of Dictionary Functions to Approximate Subspace Invariance in Koopman Operators: Why Deep Koopman Operators Work

Abstract Koopman operators model nonlinear dynamics as a linear dynamic system acting on a nonlinear function as the state. This nonstandard state is often called a Koopman observable and is usually approximated numerically by a superposition of functions drawn from a dictionary . In a widely used algorithm, extended dynamic mode decomposition (EDMD), the dictionary functions are drawn from a fixed class of functions. Deep learning combined with EDMD has been used to learn novel dictionary functions in an algorithm called deep dynamic mode decomposition (deepDMD). The learned representation both (1) accurately models and (2) scales well with the dimension of the original nonlinear system. In this paper, we analyze the learned dictionaries from deepDMD and explore the theoretical basis for their strong performance. We explore State-Inclusive Logistic Lifting (SILL) dictionary functions to approximate Koopman observables. Error analysis of these dictionary functions show they satisfy a property of subspace approximation, which we define as uniform finite approximate closure. Typically, a Koopman dictionary’s nonlinear functions are homogeneous. In this paper, we discover that structured mixing of heterogeneous dictionary functions drawn from different classes of nonlinear functions achieve the same accuracy and dimensional scaling as the deep-learning-based deepDMD algorithm Yeung et al. ( In: 2019 American Control Conference (ACC), 2019). We specifically show this by building a heterogeneous dictionary comprised of SILL functions and conjunctive radial basis functions (RBFs). This mixed dictionary achieves similar accuracy and dimensional scaling to deepDMD with an order of magnitude reduction in parameters, while maintaining geometric interpretability. These results strengthen the viability of dictionary-based Koopman models to solving high-dimensional nonlinear learning problems.

Johnson, Charles A.↗

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗

A numerical Poisson solver with improved radial solutions for a self-consistent locally scaled self-interaction correction method

Abstract The universal applicability of density functional approximations is limited by self-interaction error made by these functionals. Recently, a novel one-electron self-interaction-correction (SIC) method that uses an iso-orbital indicator to apply the SIC at each point in space by scaling the exchange-correlation and Coulomb energy densities was proposed. The locally scaled SIC (LSIC) method is exact for the one-electron densities, and unlike the well-known Perdew–Zunger SIC (PZSIC) method recovers the uniform electron gas limit of the uncorrected density functional approximation, and reduces to PZSIC method as a special case when isoorbital indicator is set to the unity. Here, we present a numerical scheme that we have adopted to evaluate the Coulomb potential of the electron density scaled by the iso-orbital indicator required for the self-consistent LSIC calculations. After analyzing the behavior of the finite difference method (FDM) and the green function solution to the radial part of the Poisson equation, we adopt a hybrid approach that uses the FDM for the Coulomb potential due to the monopole and the GF for all higher-order terms. The performance of the resultant hybrid method is assessed using a variety of systems. The results show improved accuracy than earlier numerical schemes. We also find that, even with a generic set of radial grid parameters, accurate energy differences can be obtained using a numerical Coulomb solver in standard density functional studies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Excited-State Densities from Time-Dependent Density Functional Response Theory

While the variational principle for excited-state energies leads to a route to obtaining excited-state densities from time-dependent density functional theory, relatively little attention has been paid to the quality of the resulting densities in real space obtained with different exchange-correlation functional approximations or how nonadiabatic approximations developed for energies of states of double-excitation character perform for their densities. Here we derive an expression directly in real space for the excited-state density, which includes the case of nonadiabatic kernels and consequently is able, for the first time, to yield densities of states of double-excitation character. Under some well-defined simplifications, we compare the performance of the local-density approximation and exact-exchange approximation, which are in a sense at the opposite extremes of the fundamental functional approximations, on local and charge-transfer excitations in one-dimensional model systems and show that the dressed Time-Dependent Density Functional Theory (TDDFT) approach gives good densities of double excitations.

approximation↗

Frontiers in Magnetic Materials

Magnetism is crucial to many modern technologies, a driver for condensed matter physics research and one of the most remarkable and diverse properties of matter. We propose to develop understanding of novel magnetism and magnetic related behavior in materials and use this to accelerate the discovery of forefront magnetic materials. The approach is via the connection of magnetic properties to specific structures and materials. Topics that will be addressed are (1) Metallic magnetic materials with unusually low carrier concentrations and/or moments (2) Magnetism arising from unusual chemistry including 4d and 5d magnetism and (3) Materials with strong spin-fluctuations, which can lead to quantum criticality, spin-fluctuation induced superconductivity and other novel quantum behavior. These topics overlap, for example, the 4d ruthenates include ferromagnets (perovskite SrRuO 3 ), extremely high ordering temperature antiferromagnets (honeycomb lattice SrRu 2 O 6 ) and well as quantum materials with strong spin fluctuations (layered perovskite Sr 2 RuO 4 and Sr 3 Ru 2 O 7 ). We will use of density calculations to connect magnetic properties with chemistry and structure and employ phenomenological theories to extend these results to properties that are not directly given by direct first principles methods and we will conduct tests to explore the limitations of density functional approximations and new functionals.

36 MATERIALS SCIENCE↗

Toward Chemical Accuracy for Chemi- and Physisorption with an Efficient Density Functional

Understanding molecular adsorption on surfaces underpins many problems in chemistry and materials science. Accurately and efficiently describing the adsorption has been a challenging task for first-principles methods as the process can involve both short-range chemical bond formations and long-range physical interactions, e.g., van der Waals (vdW) interaction. Density functional theory presents an appealing choice for modeling adsorption reactions, although calculations with many exchange-correlation density functional approximations struggle to accurately describe both chemical and physical molecular adsorptions. Here, we propose an efficient density functional approximation that is accurate for both chemical and physical adsorption by concurrently optimizing its semilocal component and the long-range vdW correction against the prototypical adsorption CO/Pt(111) and Ar 2 binding energy curve. The resulting function opens the door to accurate and efficient modeling of general molecular adsorption.

adsorption↗

Comparative Density Functional Theory Study of Magnetic Exchange Couplings in Dinuclear Transition-Metal Complexes

Multicenter transition-metal complexes (MCTMs) with magnetically interacting ions have been proposed as components for information-processing devices and storage units. For any practical application of MCTMs as magnetic units, it is crucial to characterize their magnetic behavior, and in particular, the isotropic magnetic exchange coupling, J, between its magnetic centers. Due to the large size of typical MCTMs, density functional theory is the only practical electronic structure method for evaluating the J coupling. Here, we assess the accuracy of different density functional approximations for predicting the magnetic couplings of eight dinuclear transition-metal complexes, including five dimanganese, two dicopper, and one divanadium with known reliable experimental J couplings spanning from ferromagnetic to strong antiferromagnetic. The density functionals considered include global hybrid functionals which mix semilocal density functional approximations and exact exchange with a fixed admixing parameter, six local hybrid functionals where the admixing parameters are extended to be spatially dependent, the SCAN and r 2 SCAN meta-generalized gradient approximations (GGAs), and two widely used GGAs. We found that global hybrids tested in this work have a tendency to over-correct the error in magnetic coupling parameters from the Perdew–Burke–Ernzerhof (PBE) GGA as seen for manganese complexes. The performance of local hybrid density functionals shows no improvement in terms of bias and is scattered without a clear trend, suggesting that more efforts are needed for the extension from global to local hybrid density functionals for this particular property. The SCAN and r 2 SCAN meta-GGAs are found to perform as well as benchmark global hybrids on most tested complexes. We further analyze the charge density redistribution of meta-GGAs as well as global and local hybrid density functionals with respect to that of PBE, in connection to the self-interaction error or delocalization error.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Orbital dependent complications for close vs well-separated electrons in diradicals

We investigate two limits in open-shell diradical systems: O3, in which the interesting orbitals are in close proximity to one another, and (C21H13)2, where there is a significant spatial separation between the two orbitals. In accord with earlier calculations, we find that standard density-functional approximations do not predict the open-shell character for the former case but uniformly predict the open-shell character for the latter case. We trace the qualitatively incorrect behavior in O3 predicted by these standard density functional approximations to self-interaction error and use the Fermi–Löwdin-orbital-self-interaction-corrected formalism to determine accurate triplet, closed-shell singlet, and open-shell broken-spin-symmetry electronic configurations. Analysis of the resulting many-electron overlap matrices allows us to unambiguously show that the broken-spin-symmetry configurations do not participate in the representation of the Ms = 0 triplet states and allows us to reliably extract the singlet–triplet splitting in O3 by analyzing the energy as a function of Fermi-orbital-descriptor permutations. The results of these analyses predict the percentage of open-shell character in O3, which agrees well with conventional wavefunction-based methods. While these techniques are expected to be required in cases near the Coulson–Fischer point, we find that they will be less necessary in diradical systems with well-separated electrons, such as (C21H13)2. Results based on energies from self-interaction-corrected generalized gradient, local density, and Hartree–Fock approximations and experimental results are in generally good agreement for O3. These results help form the basis for deriving extended Heisenberg-like Hamiltonians that are needed for descriptions of molecular magnets when there are competing low-energy electronic configurations.

Chemistry↗

Reconnaissance with JWST of the J-region Asymptotic Giant Branch in Distance Ladder Galaxies: From Irregular Luminosity Functions to Approximation of the Hubble Constant

Abstract We study stars in the J-regions of the asymptotic giant branch (JAGB) of near-infrared color–magnitude diagrams in the maser host NGC 4258 and four hosts of six Type Ia supernovae (SNe Ia): NGC 1448, NGC 1559, NGC 5584, and NGC 5643. These clumps of stars are readily apparent near 1.0 < F150W − F277W < 1.5 andm F150W = 22–25 mag with James Webb Space Telescope NIRCam photometry. Various methods have been proposed to assign an apparent reference magnitude to this recently proposed standard candle, including the mode, median, sigma-clipped mean, or a modeled luminosity function parameter. We test the consistency of these by measuring intrahost variations, finding differences of up to ∼0.2 mag that significantly exceed statistical uncertainties. Brightness differences appear intrinsic, and are further amplified by the nonuniform shape of the JAGB luminosity function, also apparent in the LMC and SMC. We follow a “many methods” approach to measure consistently JAGB magnitudes and distance moduli to the SN Ia host sample calibrated by NGC 4258. We find broad agreement with distance moduli measured from Cepheids, tip of the red giant branch, and Miras. However, the SN host mean distance modulus estimated via the JAGB method necessary to estimateH 0 differs by ∼0.19 mag among the above definitions, the result of different levels of luminosity function asymmetry. The methods yield a full range of 71−78 km s −1 Mpc −1 , i.e., a fiducial result ofH 0 = 74.7 ± 2.1(stat) ± 2.3(sys, ±3.1 if combined in quadrature) km s −1 Mpc −1 , with systematic errors limited by the differences in methods. Future work may seek to standardize and refine this promising tool further, making it more competitive with established distance indicators.

Astronomy & Astrophysics↗

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗