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 127 records · Page 7

Jig-Shape Optimization of a Low-Boom Supersonic Aircraft

A simple approach for optimizing the jig-shape is proposed in this study. This simple approach is based on an unconstrained optimization problem and applied to a low-boom supersonic aircraft. In this study, the jig-shape optimization is performed using the two-step approach. First, starting design variables are computed using the least-squares surface fitting technique. Next, the jig-shape is further tuned using a numerical optimization procedure based on an in-house object-oriented optimization tool. During the numerical optimization procedure, a design jig-shape is determined by the baseline jig-shape and basis functions. A total of 12 symmetric mode shapes of the cruise-weight configuration, rigid pitch shape, rigid left and right stabilator rotation shapes, and a residual shape are selected as sixteen basis functions. After three optimization runs, the trim shape error distribution is improved, and the maximum trim shape error of 0.9844 inches of the starting configuration becomes 0.00367 inch by the end of the third optimization run.

numerical analysi↗

Reduced-Order Modeling of a Heaving Airfoil

A reduced-order model of a flapping airfoil is developed using Proper Orthogonal Decomposition (POD). The proper basis functions, developed from snapshots of full Navier-Stokes simulations, are used for a Galerkin projection of the governing equations. The resulting coupled, nonlinear ordinary di.erential equations have a low dimension because the first few basis members capture most of the energy of the flow. The reduced-order model is used to simulate heaving motions that are both similar to and different from the motion(s) used to generate the basis functions, and the errors in the model are quantified. Several methods are used to generate mode sets that can be used over a range of heaving parameters, including snapshots from one, two, and multiple Navier-Stokes simulations. As snapshots from additional simulations are added to the decomposition, the mode sets become richer and can simulate a wider range of parameter space, at some computational cost. Whereas the POD method is fully applicable in three dimensions, the simulation technique based on a body-fixed and body-fitted grid suffers large overhead when extended to three dimensions. To reduce the overhead, an embedding technique is discussed which embeds the solid wing into a fixed Cartesian grid. The wing, which can now have multiple pieces and also be flexible, is represented by a distribution of body forces. This distribution is determined to give exactly the flow around a flapping wing.

Haj-Hariri, H.↗

Urn Models and Beta-splines

Some insight into the properties of beta-splines is gained by applying the techniques of urn models. Urn models are used to construct beta-spline basis functions and to derive the basic properties of these blending functions and the corresponding beta-spline curves. Only the simple notion of linear geometric continuity and with the most elementary beta parameter are outlined. Non-linear geometric continuity leads to additional beta parameters and to more complicated basis functions. Whether urn models can give us any insight into these higher order concepts still remains to be investigated.

Goldman, R. N.↗

Using EIGER for Antenna Design and Analysis

EIGER (Electromagnetic Interactions GenERalized) is a frequency-domain electromagnetics software package that is built upon a flexible framework, designed using object-oriented techniques. The analysis methods used include moment method solutions of integral equations, finite element solutions of partial differential equations, and combinations thereof. The framework design permits new analysis techniques (boundary conditions, Green#s functions, etc.) to be added to the software suite with a sensible effort. The code has been designed to execute (in serial or parallel) on a wide variety of platforms from Intel-based PCs and Unix-based workstations. Recently, new potential integration scheme s that avoid singularity extraction techniques have been added for integral equation analysis. These new integration schemes are required for facilitating the use of higher-order elements and basis functions. Higher-order elements are better able to model geometrical curvature using fewer elements than when using linear elements. Higher-order basis functions are beneficial for simulating structures with rapidly varying fields or currents. Results presented here will demonstrate curren t and future capabilities of EIGER with respect to analysis of installed antenna system performance in support of NASA#s mission of exploration. Examples include antenna coupling within an enclosed environment and antenna analysis on electrically large manned space vehicles.

Champagne, Nathan J.↗

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↗

Sparse matrix techniques applied to modal analysis of multi-section duct liners

A simplified procedure is presented for analysis of ducts with discretely nonuniform properties. The analysis uses basis functions as the generalized coordinates. The duct eigenfunctions are approximated by finite series of these functions. The emphasis is on solution of the resulting large sparse set of linear equations. Characteristics of sparse matrix algorithms are outlined and some criteria for application are established. Analogies with structural methods are used to illustrate variations which can increase efficiency in generating values for design optimization routines. The effects of basis function selection, number of eigenfunctions and identification and ordering of equations on the sparsity and solution stability are included.

Arnold, W. R.↗

Reduced Order Methods for Prediction of Thermal-Acoustic Fatigue

The goal of this investigation is to assess the quality of high-cycle-fatigue life estimation via a reduced order method, for structures undergoing random nonlinear vibrations in a presence of thermal loading. Modal reduction is performed with several different suites of basis functions. After numerically solving the reduced order system equations of motion, the physical displacement time history is obtained by an inverse transformation and stresses are recovered. Stress ranges obtained through the rainflow counting procedure are used in a linear damage accumulation method to yield fatigue estimates. Fatigue life estimates obtained using various basis functions in the reduced order method are compared with those obtained from numerical simulation in physical degrees-of-freedom.

Przekop, A.↗

A Nonlinear Reduced Order Method for Prediction of Acoustic Fatigue

The goal of this investigation is to assess the quality of high-cycle-fatigue life estimation via a reduced order method, for structures undergoing geometrically nonlinear random vibrations. Modal reduction is performed with several different suites of basis functions. After numerically solving the reduced order system equations of motion, the physical displacement time history is obtained by an inverse transformation and stresses are recovered. Stress ranges obtained through the rainflow counting procedure are used in a linear damage accumulation method to yield fatigue estimates. Fatigue life estimates obtained using various basis functions in the reduced order method are compared with those obtained from numerical simulation in physical degrees-of-freedom.

Przekop, Adam↗

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↗

Evaluation of the Reflection Coefficient of Microstrip Elements for Reflectarray Antennas

Basis functions were studied and identified that provide efficient and accurate solutions for the induced patch currents and the reflection phase in microstrip reflect arrays. The integral equation of an infinite array of microstrip elements in the form of patches or crossed dipoles excited by a uniform plane wave is solved by the method-of-moments. Efficient choices of entire domain basis functions that yield accurate results have been described.

Rengarajan, Sembiam↗

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↗

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↗

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↗

Negative-energy states in the Dirac-Hartree-Fock problem - The effect of omission of two-electron integrals involving the small component

The effect of omission of two-electron integrals involving basis functions for the small component of the wavefunction on the eigenvalue spectrum in the Dirac-Hartree-Fock problem is studied. From an analysis of the Fock matrix it is shown that omission of these integrals moves the negative-energy states down, not up. Their complete omission does not give rise to intruder states. The appearance of intruder states occurs when only some of the core integrals are omitted, due to the nature of particular contraction schemes used for the core basis functions. Use of radially localized functions rather than atomic functions alleviates the intruder state problem.

Dyall, Kenneth G.↗

Two-dimensional mesh embedding for Galerkin B-spline methods

A number of advantages result from using B-splines as basis functions in a Galerkin method for solving partial differential equations. Among them are arbitrary order of accuracy and high resolution similar to that of compact schemes but without the aliasing error. This work develops another property, namely, the ability to treat semi-structured embedded or zonal meshes for two-dimensional geometries. This can drastically reduce the number of grid points in many applications. Both integer and non-integer refinement ratios are allowed. The report begins by developing an algorithm for choosing basis functions that yield the desired mesh resolution. These functions are suitable products of one-dimensional B-splines. Finally, test cases for linear scalar equations such as the Poisson and advection equation are presented. The scheme is conservative and has uniformly high order of accuracy throughout the domain.

Shariff, Karim↗

Refining Linear Fuzzy Rules by Reinforcement Learning

Linear fuzzy rules are increasingly being used in the development of fuzzy logic systems. Radial basis functions have also been used in the antecedents of the rules for clustering in product space which can automatically generate a set of linear fuzzy rules from an input/output data set. Manual methods are usually used in refining these rules. This paper presents a method for refining the parameters of these rules using reinforcement learning which can be applied in domains where supervised input-output data is not available and reinforcements are received only after a long sequence of actions. This is shown for a generalization of radial basis functions. The formation of fuzzy rules from data and their automatic refinement is an important step in closing the gap between the application of reinforcement learning methods in the domains where only some limited input-output data is available.

Berenji, Hamid R.↗

Simple and Efficient Numerical Evaluation of Near-Hypersingular Integrals

Recently, significant progress has been made in the handling of singular and nearly-singular potential integrals that commonly arise in the Boundary Element Method (BEM). To facilitate object-oriented programming and handling of higher order basis functions, cancellation techniques are favored over techniques involving singularity subtraction. However, gradients of the Newton-type potentials, which produce hypersingular kernels, are also frequently required in BEM formulations. As is the case with the potentials, treatment of the near-hypersingular integrals has proven more challenging than treating the limiting case in which the observation point approaches the surface. Historically, numerical evaluation of these near-hypersingularities has often involved a two-step procedure: a singularity subtraction to reduce the order of the singularity, followed by a boundary contour integral evaluation of the extracted part. Since this evaluation necessarily links basis function, Green s function, and the integration domain (element shape), the approach ill fits object-oriented programming concepts. Thus, there is a need for cancellation-type techniques for efficient numerical evaluation of the gradient of the potential. Progress in the development of efficient cancellation-type procedures for the gradient potentials was recently presented. To the extent possible, a change of variables is chosen such that the Jacobian of the transformation cancels the singularity. However, since the gradient kernel involves singularities of different orders, we also require that the transformation leaves remaining terms that are analytic. The terms "normal" and "tangential" are used herein with reference to the source element. Also, since computational formulations often involve the numerical evaluation of both potentials and their gradients, it is highly desirable that a single integration procedure efficiently handles both.

Fink, Patrick W.↗

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↗