Search NASA⌕ Search

SEARCH · Search NASA

Results for “orthogonal polynomial”

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.

106 records · Page 6

Efficient data-driven regression for reduced-order modeling of spatial pattern formation

We present an efficient data-driven regression approach for constructing reduced-order models (ROMs) of reaction-diffusion systems exhibiting pattern formation. The ROMs are learned non-intrusively from available training data of physically accurate numerical simulations. The method can be applied to general nonlinear systems through the use of polynomial model form, while not requiring knowledge of the underlying physical model, governing equations, or numerical solvers. The process of learning ROMs is posed as a low-cost least-squares problem in a reduced-order subspace identified via Proper Orthogonal Decomposition (POD). Numerical experiments on classical pattern-forming systems–including the Schnakenberg and Mimura–Tsujikawa models–demonstrate that higher-order surrogate models significantly improve prediction accuracy while maintaining low computational cost. The proposed method provides a flexible, non-intrusive model reduction framework, well suited for the analysis of complex spatio-temporal pattern formation phenomena.

Data-driven modeling↗

Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces

This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.

kernel methods↗

Detailed three-dimensional isentropic analysis using an objective cross-sectional approach

An approach is presented which is designed to give detailed, computationally-efficient meteorological objective analyses over data-rich regions, with results independent of numerical model influences. Observed station data and interstation gradients are used to interpolate pressure, wind, and moisture information from vertical cross-sections onto isentropci surfaces by means of cubic polynomials. Three-dimensional grid-point analyses of mass and moisture are obtained by first constructing a series of nearly parallel vertical cross sections over a specified area, and then filling in the space between adjacent vertical analyses by employing a second set of nearly orthogonal cross sections. Gradients obtained from the mass analyses are then combined with observed wind data to obtain thermally-consistent observed wind analyses. It is concluded that the resulting analyses are useful for preserving significnat horizontal and vertical gradients, such as those associated with jet-streak systems. Examples are given which verify the applicability of this analysis technique to radiosonde data.

Petersen, R. A.↗

Working with Bézier Curves as bases for Functional Expansion Tallies

Functional expansion tallies (FETs) are powerful tools for getting more information per history from Monte Carlo simulations, but in the past they have been constrained to orthogonal bases. Bézier curves are used widely in computer aided design (CAD) geometry kernels and could be well-suited for FETs due to their ability to assume many arbitrary shapes, but they use nonorthogonal bases. Recent developments in 2021 have made nonorthogonal FETs possible. The convergence of Bézier curve FETs in both polynomial order and number of samples is explored in this work. It is shown that these bases are well-suited for representing normal distributions and this opens the door to the possibility of other CAD-derived FET bases.

97 - MATHEMATICS AND COMPUTING↗

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of sparse recovery for Legendre expansions using envelope bound

We provide novel sufficient conditions for the uniform recovery of sparse Legendre expansions using ℓ 1 minimization, where the sampling points are drawn according to orthogonalization (uniform) measure. So far, conditions of the form m ≳ Θ 2 s x log factors have been relied on to determine the minimum number of samples m that guarantees successful reconstruction of s-sparse vectors when the measurement matrix is associated to an orthonormal system. However, in case of sparse Legendre expansions, the uniform bound Θ of Legendre systems is so high that these conditions are unable to provide meaningful guarantees. Here, in this paper, we present an analysis which employs the envelop bound of all Legendre polynomials instead, and prove a new recovery guarantee for s-sparse Legendre expansions, m ≳ Θs 2 x log factors, which is independent of Θ. Arguably, this is the first recovery condition established for orthonormal systems without assuming the uniform boundedness of the sampling matrix. The key ingredient of our analysis is an extension of chaining arguments, recently developed in Bourgain and Chkifa et al., to handle the envelope bound. Furthermore, our recovery condition is proved via restricted eigenvalue property, a less demanding replacement of restricted isometry property which is perfectly suited to the considered scenario. Along the way, we derive simple criteria to detect good sample sets. Our numerical tests show that sets of uniformly sampled points that meet these criteria will perform better recovery on average.

97 MATHEMATICS AND COMPUTING↗

Comparison of Prediction Modeling Methodologies for Aeroacoustic Characterization of Hovering sUAS Rotors

This work compared artificial neural network and multivariate orthogonal function modeling methodologies for the prediction and characterization of isolated hovering sUAS rotor aerodynamics and aeroacoustics. Design of Experiments was used to create input feature spaces over 9 input features: the number of rotor blades, rotor size, rotor speed, the amount of blade twist, blade taper ratio, tip chord length, collective pitch, airfoil camber, and airfoil thickness. CAMRAD~II and AARON were executed at the points defined by the input feature space to predict aerodynamic and aeroacoustic quantities. These predicted aerodynamic and aeroacoustic data were then used to generate artificial neural networks and polynomial response surface models. The two prediction model methodologies were evaluated over test data previously unseen by the models, which showed good prediction capabilities for both model types, with slightly lower prediction error for the artificial neural networks. A characterization study was performed, which showed that input features correspondent to the spanwise sectional blade lift and drag were the most significant factors to the aerodynamic thrust and power, respectively. It was also shown that the aeroacoustic quantities were highly dependent on variations in rotor speed and size, which affect the Doppler factor for tonal noise and the spanwise Reynolds number for broadband noise.

Christopher S Thurman↗

Mind the crosscap: $τ$-scaling in non-orientable gravity and time-reversal-invariant systems

Spectral statistics of quantum chaotic systems are governed by random matrix universality. In many cases of interest, time-reversal symmetry selects the Gaussian Orthogonal Ensemble (GOE) as the relevant universality class. In holographic CFTs, this is mirrored by the presence of non-orientable geometries in the dual gravitational path integral. In this work, we analyze general properties of these matrix models and their gravitational counterparts. First, we develop a formalism to express the universal level statistics in the canonical ensemble for arbitrary spectral curves, leading to a topological expansion with finite radius of convergence in the late-time $τ$-scaling limit. Then, we focus on topological gravity and study topological recursion on the moduli space of non-orientable surfaces. We find that the Weil-Petersson volumes display non-analytic behaviour multiplying polynomials in the boundary lengths. The volumes give rise to wormholes with late-time divergences, in contrast with the orientable case, which is finite. We identify systematic cancellations among WP volumes implied by the consistency and finiteness of the $τ$-scaling limit. In particular, the cancellation of late-time divergences requires a nontrivial genus resummation. Working in the gravitational microcanonical ensemble, we derive and resum all orders of the topological expansion matching the GOE matrix model in the high-energy regime.

Chaotic Dynamics (nlin.CD)↗

Aerodynamic Sensitivities over Separable Shape Tensors

Here, we present a comprehensive aerodynamic sensitivity analysis of airfoil parameterization informed by separable shape tensors. This parameterization approach uniquely benefits the design process by isolating various well-studied shape characteristics, such as airfoil thickness, and providing a well-regulated low-dimensional parameter domain for aerodynamic designs. Exploring the aerodynamic sensitivities of this novel parameterization can provide valuable insights for more robust designs and future manufacturing efforts. We construct a data-driven parameter space of airfoils using principal geodesic analysis of separable shape tensors informed by a curated database containing almost 20,000 suitable engineering airfoils. Analyzing the shape reconstruction error and the maximum mean discrepancy between joint distributions of aerodynamic quantities, we study the dimensionality of the learned parameter space. This simple numerical experiment demonstrates a dramatic dimension reduction that retains design effectiveness and promotes regularity of the shape representations. Finally, we generate new airfoils and use the HAM2D Reynolds-averaged Navier–Stokes solver to predict lift, drag, and moment coefficients. We compute multiple sensitivity metrics to quantify and assert the consistency of parameter influence on the aerodynamic quantities. We also explore low-dimensional polynomial ridge approximations to motivate physical intuitions and offer explanations of the approximated sensitivities.

17 WIND ENERGY↗

Computational study of three dimensional viscous flow through a turbine cascade using a multi-domain spectral technique

The three dimensional viscous flow through a planar turbine cascade is numerically simulated by direct solution of the incompressible Navier-Stokes equations. Flow dependence in the spanwise direction is represented by direct expansion in Chebyshev polynomials, while the discretization on planes parallel to the endwalls is accomplished using the spectral element method. Elemental mapping from the physical to the computational space uses an algebraic mapping technique. A fractional time stepping method that consists of an explicit nonlinear convective step, an implicit pressure correction step, and an implicit viscous step is used to advance the Navier-Stokes equations forward in time. Results computed at moderate Reynolds numbers show a three dimensional endwall flow separation, a midspan separation of the blade suction surface boundary layer, and other three-dimensional features such as the presence of a saddle point flow in the endwall region. In addition, the computed skin friction lines are shown to be orthogonal to the surface vorticity lines, demonstrating the accuracy achievable in the present method.

Renaud, Earl W.↗

Sampling Low-Dimensional Markovian Dynamics for Preasymptotically Recovering Reduced Models from Data with Operator Inference

This work introduces a method for learning low-dimensional models from data of high-dimensional black-box dynamical systems. The novelty is that the learned models are exactly the reduced models that are traditionally constructed with classical projection-based model reduction techniques. Thus, the proposed approach learns models that are guaranteed to have the well-studied properties of reduced models known from model reduction, without requiring full knowledge of the governing equations and without requiring the operators of the high-dimensional systems. The key ingredient is a new data sampling scheme to obtain re-projected trajectories of high-dimensional systems that correspond to Markovian dynamics in low-dimensional subspaces. The exact recovery of reduced models from these re-projected trajectories is guaranteed pre-asymptotically under certain conditions for finite amounts of data and for a large class of systems with polynomial nonlinear terms. Numerical results demonstrate that the low-dimensional models learned with the proposed approach match reduced models from traditional model reduction up to numerical errors in practice. In conclusion, the numerical results further indicate that low-dimensional models fitted to re-projected trajectories are predictive even in situations where models fitted to trajectories without re-projection are inaccurate and unstable.

97 MATHEMATICS AND COMPUTING↗

Nearly steady flows in GONG prototype data

Doppler velocity images obtained with the GONG prototype instrument were analyzed to measure the nearly steady photospheric flows. The data consists of 88 images each of velocity, intensity, and modulation obtained at 20:00 UT on 88 days from July 1992 to February 1994. Each velocity image was temporally filtered to remove the p-mode oscillations, masked to exclude active regions, and then analyzed using spherical harmonics and orthogonal functions as described by Hathaway (1992). The spectral coefficients show very consistent results for the entire time interval with some evidence of year-to-year variations. The rotation profile agrees well with previous results and exhibits a north-south asymmetry that reverses sign during the 20 month interval. The residual rotation velocities exhibit structures with amplitudes of approximately 5 m/s that may be related to torsional oscillations. The meridional circulation is directed from the equator toward the poles with a peak velocity in the photosphere of approximately 50 m/s. The higher order components are very weak but indicate a divergent flow from the mid-latitudes (opposite that found for the June 1989 data). The convective limb shift is well fit by a 3rd order polynomial. The convection spectrum has a prominent peak at spherical harmonic degrees of l approximately 150 with very little signal in the low degree modes. Analysis of this signal shows that there is no evidence for giant cell convection at the level of approximately 10 m/s for all modes up to l = 32.

Hathaway, David H.↗

Mapping Aerosol Lidar Ratios Over Ocean using MODIS AOD Constrained Retrievals and GOCART Model Simulations

After 17 years, the NASA Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) mission ceased science operations in August 2023. For the final CALIPSO data products release (Version 5), the CALIPSO project seeks to improve the accuracy of its aerosol extinction by advancing knowledge of aerosol lidar ratios (i.e., extinction-to-backscatter ratios; LRs) for various aerosol types. The current algorithm assigns one LR value globally for each of the seven tropospheric aerosol types. The CALIPSO team aims to improve the retrieval algorithm through the development of regional and seasonal LR climatologies for the same aerosol types. In this study, aerosol LRs are inferred through Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) backscatter profiles constrained by collocated aerosol optical depth (AOD) from Aqua Moderate Resolution Imaging Spectroradiometer (MODIS) data over oceans during daytime. This analysis is subsampled for those profiles that are cloud-free and contain only one CALIOP-classified aerosol type. The CALIOP profiles are then collocated with aerosol volume fractions obtained through Goddard Chemistry Aerosol Radiation and Transport (GOCART) model simulations. This presentation will reveal findings that the 12-year (June 2006-August 2018) mean spatial distributions of inferred aerosol LRs for CALIOP-classified marine and dusty marine aerosols correspond inversely with patterns of GOCART sea salt volume fraction (SSVF). For example, smaller SSVFs (< 65%) and larger LRs (> 55 sr), are found near land masses (Fig. 1). This indicates the influence of advected anthropogenic aerosols (e.g., pollution and biomass burning smoke). In the remote oceans (i.e., regions likely less impacted by non-sea salt aerosols), the SSVFs are larger (> 95%) and the LRs are smaller (< 25 sr) (Fig. 1). A polynomial fit of the MODIS AOD constrained LRs to the corresponding GOCART SSVFs (intersect values of ~58 sr for SSVF of 0% and ~21 sr for SSVF of 100%) is further used to produce model-assisted climatological LR maps on seasonal scales. Additionally, we will show results of a LR validation analysis for which we compare the revised CALIPSO AODs obtained by applying the seasonal/regional constrained LRs against CALIPSO Version 4.51 Ocean Derived Column Optical Depth (ODCOD). While the majority of the presentation will focus on LRs for CALIOP-classified marine and dusty marine aerosols, an overview of LR results will show preliminary results for other aerosol types over ocean, such as dust and elevated smoke. The technique demon-strated in this study highlights the benefits not only to the final planned CALIPSO data release in 2025, but similar methods can be applied to future spaceborne elastic backscatter lidars with collocated passive sensors (e.g., such as those associated with NASA’s proposed Atmosphere Observing System).

Travis D Toth↗

Mapping Aerosol Lidar Ratios Over Ocean Using Constrained Retrievals and A Global Aerosol Model

The current NASA Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) algorithms assign one lidar ratio (i.e., extinction-to-backscatter ratio; LR) value globally for each of the seven tropospheric aerosol types. In a future data products release, the CALIPSO project aims to improve these algorithms through the development of regional and seasonal LR climatologies. In this work, aerosol LRs are inferred through Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) backscatter profiles constrained by collocated aerosol optical depth (AOD) from Aqua Moderate Resolution Imaging Spectroradiometer (MODIS) data. This analysis is subsampled for those profiles that are cloud-free and contain only one CALIOP-classified aerosol type (e.g., marine). The CALIOP profiles are then collocated with aerosol volume fractions obtained through Goddard Chemistry Aerosol Radiation and Transport (GOCART) model simulations. In this presentation, we show that the twelve-year (June 2006-August 2018) mean spatial distributions of inferred aerosol LRs for CALIOP-classified marine aerosols correspond inversely with patterns of GOCART sea salt volume fraction (SSVF). For example, smaller SSVFs (< 65%) and larger LRs (> 55 sr), are found near land masses. This is indicative of the influence of over-land aerosols (e.g., pollution and biomass burning smoke). In the remote oceans (i.e., regions likely less impacted by non-sea salt aerosols), larger SSVFs (> 95%) and smaller LRs (< 25 sr) are found. The developed relationship between the GOCART SSVFs and MODIS AOD constrained LRs (polynomial fit intersect values of ~56 sr for SSVF of 0% and ~21 sr for SSVF of 100%) is used to produce model-assisted climatological LR maps on seasonal scales. Additionally, we show maps of inferred LRs from constrained retrievals using the CALIPSO Ocean Derived Column Optical Depth (ODCOD) product and comparisons with those from the MODIS analyses. The technique demonstrated in this study not only benefits CALIPSO in the near-term, but similar methods can be applied to future spaceborne elastic backscatter lidars with collocated passive sensors, such as those associated with the upcoming NASA Atmosphere Observing System (AOS).

Travis Toth↗