An Array Feed Radial Basis Function Tracking System for NASA's Deep Space Network Antennas
Explore the source record for details and available documents.
array feed neural network DSN least-squares antenn↗
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.
On hybrid temporal basis functions for stable numerical solution of time domain boundary integral equations
Explore the source record for details and available documents.
Fang Q. Hu↗
Design of Multi-Parameter Steerable Functions Using Cascade Basis Reduction
A new cascade basis reduction method of computing the optimal least-squares set of basis functions steering a given function is presented. The method combines the Lie group-theoretic and the singular value decomposition approaches in such a way that their respective strengths complement each other. Since the Lie group-theoretic approach is used, the set of basis and steering functions computed can be expressed analytically. Because the singular value decomposition method is used, this set of basis and steering functions is optimal in the least-squares sense. Furthermore, the computational complexity in designing basis functions for transformation groups with large numbers of parameters is significantly reduced. The efficiency of the cascade basis reduction method is demonstrated by designing a set of basis functions that steers a Gabor function under the four-parameter linear transformation group.
Teo, P.↗
A flexible class of priors for orthonormal matrices with basis function-specific structure
Statistical modeling of high-dimensional matrix-valued data motivates the use of a low-rank representation that simultaneously summarizes key characteristics of the data and enables dimension reduction. Low-rank representations commonly factor the original data into the product of orthonormal basis functions and weights, where each basis function represents an independent feature of the data. However, the basis functions in these factorizations are typically computed using algorithmic methods that cannot quantify uncertainty or account for basis function correlation structure a priori. While there exist Bayesian methods that allow for a common correlation structure across basis functions, empirical examples motivate the need for basis function-specific dependence structure. We propose a prior distribution for orthonormal matrices that can explicitly model basis function-specific structure. The prior is used within a general probabilistic model for singular value decomposition to conduct posterior inference on the basis functions while accounting for measurement error and fixed effects. We discuss how the prior specification can be used for various scenarios and demonstrate favorable model properties through synthetic data examples. Finally, we apply our method to two-meter air temperature data from the Pacific Northwest, enhancing our understanding of the Earth system’s internal variability.
97 MATHEMATICS AND COMPUTING↗
A numerical study of viscous vortex rings using a spectral method
Viscous, axisymmetric vortex rings are investigated numerically by solving the incompressible Navier-Stokes equations using a spectral method designed for this type of flow. The results presented are axisymmetric, but the method is developed to be naturally extended to three dimensions. The spectral method relies on divergence-free basis functions. The basis functions are formed in spherical coordinates using Vector Spherical Harmonics in the angular directions, and Jacobi polynomials together with a mapping in the radial direction. Simulations are performed of a single ring over a wide range of Reynolds numbers (Re approximately equal gamma/nu), 0.001 less than or equal to 1000, and of two interacting rings. At large times, regardless of the early history of the vortex ring, it is observed that the flow approaches a Stokes solution that depends only on the total hydrodynamic impulse, which is conserved for all time. At small times, from an infinitely thin ring, the propagation speeds of vortex rings of varying Re are computed and comparisons are made with the asymptotic theory by Saffman. The results are in agreement with the theory; furthermore, the error is found to be smaller than Saffman's own estimate by a factor square root ((nu x t)/R squared) (at least for Re=0). The error also decreases with increasing Re at fixed core-to-ring radius ratio, and appears to be independent of Re as Re approaches infinity). Following a single ring, with Re=500, the vorticity contours indicate shedding of vorticity into the wake and a settling of an initially circular core to a more elliptical shape, similar to Norbury's steady inviscid vortices. Finally, we consider the case of leapfrogging vortex rings with Re=1000. The results show severe straining of the inner vortex core in the first pass and merging of the two cores during the second pass.
Stanaway, S. K.↗
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↗
Evolvable synthetic neural system
An evolvable synthetic neural system includes an evolvable neural interface operably coupled to at least one neural basis function. Each neural basis function includes an evolvable neural interface operably coupled to a heuristic neural system to perform high-level functions and an autonomic neural system to perform low-level functions. In some embodiments, the evolvable synthetic neural system is operably coupled to one or more evolvable synthetic neural systems in a hierarchy.
Curtis, Steven A.↗
A Characteristics Approach to the Finite Element Method
Herein, we present a new method for solving the linear Boltzmann transport equation. Two commonly used and well-understood methods for solving partial differential equations are the method of characteristics (MOC) and the finite element method (FEM). We propose a new method that combines the fundamental concept of the FEM with the analytic solution from the MOC to obtain coefficients for the FEM basis function expansion. Traditionally, coefficients for the FEM basis function expansion are obtained via matrix inversion. Instead, we solve for the coefficients with the MOC and represent the underlying fields with the basis function expansion using these coefficients. We provide a convergence study for our method with results from two sets of FEM basis functions: Gauss-Legendre and Gauss-Lobatto sets. We also compare two different variations of our method categorized as short characteristics and intermediate characteristics.
42 ENGINEERING↗
Linear and Geometrically Nonlinear Structural Shape Sensing from Strain Data
An aircraft’s shape must be measured during flight to implement active shape controls such as active trim shape, divergence, and sonic boom controls. A basis function method for linear as well as geometrically nonlinear structural shape sensing is proposed in this study. Basis functions can be mode shapes, linear static deformation shapes, and/or geometrically nonlinear static deformation shapes. The proposed basis function method is validated using a high-aspect-ratio wing, a swept test plate, and the National Aeronautics and Space Administration X-59 aircraft. A large structural deformation of a high-aspect-ratio wing is successfully captured using the proposed basis function method with less than 0.3%prediction error at the wing-tip section. The basis function method gives excellent deformation prediction, even with stress concentration. Performance of the basis functions is compared using the X-59 stabilator sample case. In most of the sample load cases, static deformations give a better correlation with the target deformation than do mode shapes. Wing shape sensing with sparse strain data are also demonstrated in this study using the X-59 aircraft. Predicted structural deformations match reasonably with the target deformations, even without strain gauges on some structural components. The predicted deformations have a good match with the target deformations.
Static Deformation↗
A 3D High-Order Unstructured Finite-Volume Algorithm for Solving Maxwell's Equations
A three-dimensional finite-volume algorithm based on arbitrary basis functions for time-dependent problems on general unstructured grids is developed. The method is applied to the time-domain Maxwell equations. Discrete unknowns are volume integrals or cell averages of the electric and magnetic field variables. Spatial terms are converted to surface integrals using the Gauss curl theorem. Polynomial basis functions are introduced in constructing local representations of the fields and evaluating the volume and surface integrals. Electric and magnetic fields are approximated by linear combinations of these basis functions. Unlike other unstructured formulations used in Computational Fluid Dynamics, the new formulation actually does not reconstruct the field variables at each time step. Instead, the spatial terms are calculated in terms of unknowns by precomputing weights at the beginning of the computation as functions of cell geometry and basis functions to retain efficiency. Since no assumption is made for cell geometry, this new formulation is suitable for arbitrarily defined grids, either smooth or unsmooth. However, to facilitate the volume and surface integrations, arbitrary polyhedral cells with polygonal faces are used in constructing grids. Both centered and upwind schemes are formulated. It is shown that conventional schemes (second order in Cartesian grids) are equivalent to the new schemes using first degree polynomials as the basis functions and the midpoint quadrature for the integrations. In the new formulation, higher orders of accuracy are achieved by using higher degree polynomial basis functions. Furthermore, all the surface and volume integrations are carried out exactly. Several model electromagnetic scattering problems are calculated and compared with analytical solutions. Examples are given for cases based on 0th to 3rd degree polynomial basis functions. In all calculations, a centered scheme is applied in the interior, while an upwind matching scheme is employed at material interfaces and the Engquist-Majda non-reflecting boundary condition is implemented at the numerical outer boundaries. The staggered leapfrog scheme and the Runge-Kutta methods are utilized for the time integration. Excellent agreements are found between the numerical and analytical solutions.
Liu, Yen↗
A resolution independent neural operator
The Deep operator network (DeepONet) is a powerful yet simple neural operator architecture that utilizes two deep neural networks to learn mappings between infinite-dimensional function spaces. This architecture is highly flexible, allowing the evaluation of the solution field at any location within the desired domain. However, it imposes a strict constraint on the input space, requiring all input functions to be discretized at the same locations; this limits its practical applications. Here, in this work, we introduce a general framework for operator learning from input–output data with arbitrary number and locations of sensors. This begins by introducing a resolution-independent DeepONet (RI-DeepONet), enabling it to handle input functions that are arbitrarily, but sufficiently finely, discretized. To this end, we propose two dictionary learning algorithms to adaptively learn a set of appropriate continuous basis functions, parameterized as implicit neural representations (INRs), from correlated signals defined on arbitrary point cloud data. These basis functions are then used to project arbitrary input function data as a point cloud onto an embedding space (i.e., a vector space of finite dimensions) with dimensionality equal to the dictionary size, which can be directly used by DeepONet without any architectural changes. In particular, we utilize sinusoidal representation networks (SIRENs) as trainable INR basis functions. The introduced dictionary learning algorithms are then used in a similar way to learn an appropriate dictionary of basis functions for the output function data, which defines a new neural operator architecture referred to as the R esolution I ndependent N eural O perator (RINO). In the RINO, the operator learning task simplifies to learning a mapping from the coefficients of input basis functions to the coefficients of output basis functions. We demonstrate the robustness and applicability of RINO in handling arbitrarily (but sufficiently richly) sampled input and output functions during both training and inference through several numerical examples.
Deep operator network (DeepONet)↗
Augmenting machine learning of Grad–Shafranov equilibrium reconstruction with Green's functions
This work presents a method for predicting plasma equilibria in tokamak fusion experiments and reactors. The approach involves representing the plasma current as a linear combination of basis functions using principal component analysis of plasma toroidal current densities (J t ) from the EFIT-AI equilibrium database. Then utilizing EFIT's Green's function tables, basis functions are created for the poloidal flux (ψ) and diagnostics generated from the toroidal current (J t ). Similar to the idea of a physics-informed neural network (NN), this physically enforces consistency between ψ, J t , and the synthetic diagnostics. First, the predictive capability of a least squares technique to minimize the error on the synthetic diagnostics is employed. The results show that the method achieves high accuracy in predicting ψ and moderate accuracy in predicting J t with median R 2 = 0.9993 and R 2 = 0.978, respectively. A comprehensive NN using a network architecture search is also employed to predict the coefficients of the basis functions. The NN demonstrates significantly better performance compared to the least squares method with median R 2 = 0.9997 and 0.9916 for J t and ψ, respectively. The robustness of the method is evaluated by handling missing or incorrect data through the least squares filling of missing data, which shows that the NN prediction remains strong even with a reduced number of diagnostics. Additionally, the method is tested on plasmas outside of the training range showing reasonable results.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
On the Application of Hilbert Spectral Analysis for Climate Studies
The Hilbert spectral analysis (Huang et al, 1998, Proceedings of the Royal Society of London, A 454, pp 903-995) consisted of two steps: First, the data has to be reduced into a finite number of Intrinsic Mode Function by the Empirical Mode Decomposition method, then the resulting Intrinsic Mode Functions are converted to time-frequency-energy distribution through Hilbert transform. In this approach, the Empirical Mode Functions served as the basis functions with which the data is expanded. This basis function is adaptive, and the decomposition is nonlinear. Furthermore, as the Hilbert transform is a singular transform, it retains a high degree of local information. The instantaneous frequency is determined by differentiation of the phase function; therefore, there is no restriction of the 'uncertainty principle' for all the time-frequency analysis resulting from a priori basis approach. With the adaptive basis and the instantaneous frequency, the Hilbert Spectral analysis can represent data from nonlinear and nonstationary processes without resorting to the harmonics. Another advantage of using instantaneous frequency is the ability to find out frequency from limited length of data, which is a critical problem in climate studies. As the processes driving the climate changes could be both nonlinear and nonstationary, the Hilbert Spectral Analysis could be of great use in examining the underlying mechanisms. A preliminary study based on the length of day data will be presented as example for the application of the Hilbert Spectral Analysis for climate study.
Huang, Norden E.↗
Multigrid-sinc methods
A Galerkin method using Whittaker cardinal or 'sinc' functions as basis functions is described for the solution of boundary-value problems. When the solution is analytic in the interior of the domain, the error of approximation using 2N + 1 points is O(e exp /-gamma sq rt N/) even if derivatives of the solution are singular at the boundaries. A multigrid method with overall complexity O(N log N) is used to solve the discrete equations. This paper contains a description of the multigrid-sinc algorithm along with some preliminary numerical results for two-point boundary-value problems.
Schaffer, Steve↗
A hexagonal orthogonal-oriented pyramid as a model of image representation in visual cortex
Retinal ganglion cells represent the visual image with a spatial code, in which each cell conveys information about a small region in the image. In contrast, cells of the primary visual cortex use a hybrid space-frequency code in which each cell conveys information about a region that is local in space, spatial frequency, and orientation. A mathematical model for this transformation is described. The hexagonal orthogonal-oriented quadrature pyramid (HOP) transform, which operates on a hexagonal input lattice, uses basis functions that are orthogonal, self-similar, and localized in space, spatial frequency, orientation, and phase. The basis functions, which are generated from seven basic types through a recursive process, form an image code of the pyramid type. The seven basis functions, six bandpass and one low-pass, occupy a point and a hexagon of six nearest neighbors on a hexagonal lattice. The six bandpass basis functions consist of three with even symmetry, and three with odd symmetry. At the lowest level, the inputs are image samples. At each higher level, the input lattice is provided by the low-pass coefficients computed at the previous level. At each level, the output is subsampled in such a way as to yield a new hexagonal lattice with a spacing square root of 7 larger than the previous level, so that the number of coefficients is reduced by a factor of seven at each level. In the biological model, the input lattice is the retinal ganglion cell array. The resulting scheme provides a compact, efficient code of the image and generates receptive fields that resemble those of the primary visual cortex.
Watson, Andrew B.↗
A Multi-Resolution Nonlinear Mapping Technique for Design and Analysis Application
This report describes a nonlinear mapping technique where the unknown static or dynamic system is approximated by a sum of dimensionally increasing functions (one-dimensional curves, two-dimensional surfaces, etc.). These lower dimensional functions are synthesized from a set of multi-resolution basis functions, where the resolutions specify the level of details at which the nonlinear system is approximated. The basis functions also cause the parameter estimation step to become linear. This feature is taken advantage of to derive a systematic procedure to determine and eliminate basis functions that are less significant for the particular system under identification. The number of unknown parameters that must be estimated is thus reduced and compact models obtained. The lower dimensional functions (identified curves and surfaces) permit a kind of "visualization" into the complexity of the nonlinearity itself.
Phan, Minh Q.↗
A Multi-Resolution Nonlinear Mapping Technique for Design and Analysis Applications
This report describes a nonlinear mapping technique where the unknown static or dynamic system is approximated by a sum of dimensionally increasing functions (one-dimensional curves, two-dimensional surfaces, etc.). These lower dimensional functions are synthesized from a set of multi-resolution basis functions, where the resolutions specify the level of details at which the nonlinear system is approximated. The basis functions also cause the parameter estimation step to become linear. This feature is taken advantage of to derive a systematic procedure to determine and eliminate basis functions that are less significant for the particular system under identification. The number of unknown parameters that must be estimated is thus reduced and compact models obtained. The lower dimensional functions (identified curves and surfaces) permit a kind of "visualization" into the complexity of the nonlinearity itself.
Phan, Minh Q.↗
Electromagnetic Scattering From a Polygonal Thin Metallic Plate Using Quadrilateral Meshing
The problem of electromagnetic (EM) scattering from irregularly shaped, thin, metallic flat plates in free space is solved using the electric field integral equation (EFIE) approach in conjunction with the method of moments (MoM) with quadrilateral meshing. An irregularly shaped thin plate is discretized into quadrilateral patches and the unknown electric surface current over the plate is expressed in terms of proper basis functions over these patches. The basis functions for the electric surface current density that satisfy the proper boundary conditions on these quadrilateral patches are derived. The unknown surface current density on these quadrilateral patches is determined by setting up and solving the electric field integral equation by the application of the MoM. From the knowledge of the surface current density, the EM scattering from various irregularly shaped plates is determined and compared with the earlier published results. The novelty in the present approach is the use of quadrilateral patches instead of well known and often used triangular patches. The numerical results obtained using the quadrilateral patches compare favorably with measured results.
Deshpande, Manohar D.↗