Search NASA⌕ Search

SEARCH · Search NASA

Results for “polynomial method”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1976

Polynominal Interpolation Methods for Viscous Flow Calculations

Higher-order collocation procedures resulting in tridiagonal matrix systems are derived from polynomial spline interpolation and by Hermitian (Taylor series) finite-difference discretization. The similarities and special features of these different developments are discussed. The governing systems apply for both uniform and variable meshes. Hybrid schemes resulting from two different polynomial approximations for the first and second derivatives lead to a nonuniform mesh extension of the so-called compact or Pad? difference technique (Hermite 4). A variety of fourth-order methods are described and the Hermitian approach is extended to sixth-order (Hermite 6). The appropriate spline boundary conditions are derived for all procedures. For central finite differences, this leads to a two-point, second-order accurate generalization of the commonly used three-point end-difference formula. Solutions with several spline and Hermite procedures are presented for the boundary layer equations, with and without mass transfer, and for the incompressible viscous flow in a driven cavity. Divergence and nondivergence equations are considered for the cavity. Among the fourth-order techniques, it is shown that spline 4 has the smallest truncation error. The spline 4 procedure generally requires one-quarter the number of mesh points in a given coordinate direction as a central finite-difference calculation of equal accuracy. The Hermite 6 procedure leads to remarkably accurate boundary layer solutions.

Rubin, S. G.↗
NASA NTRS1987

Simultaneous stochastic inversion for geomagnetic main field and secular variation. I - A large-scale inverse problem

The method of stochastic inversion is extended to the simultaneous inversion of both main field and secular variation. In the present method, the time dependency is represented by an expansion in Legendre polynomials, resulting in a simple diagonal form for the a priori covariance matrix. The efficient preconditioned Broyden-Fletcher-Goldfarb-Shanno algorithm is used to solve the large system of equations resulting from expansion of the field spatially to spherical harmonic degree 14 and temporally to degree 8. Application of the method to observatory data spanning the 1900-1980 period results in a data fit of better than 30 nT, while providing temporally and spatially smoothly varying models of the magnetic field at the core-mantle boundary.

Bloxham, Jeremy↗
DOE OSTI2025

Image-Driven Hybrid Structural Analysis Based on Continuum Point Cloud Method with Boundary Capturing Technique

Conventional approaches for the structural health monitoring of infrastructures often rely on physical sensors or targets attached to structural members, which require considerable preparation, maintenance, and operational effort, including continuous on-site adjustments. This paper presents an image-driven hybrid structural analysis technique that combines digital image processing (DIP) and regression analysis with a continuum point cloud method (CPCM) built on a particle-based strong formulation. Polynomial regressions capture the boundary shape change due to the structural loading and precisely identify the edge and corner coordinates of the deformed structure. The captured edge profiles are transformed into essential boundary conditions. This allows the construction of a strongly formulated boundary value problem (BVP), classified as the Dirichlet problem. Capturing boundary conditions from the digital image is novel, although a similar approach was applied to the point cloud data. It was shown that the CPCM is more efficient in this hybrid simulation framework than the weak-form-based numerical schemes. Unlike the finite element method (FEM), it can avoid aligning boundary nodes with regression points. A three-point bending test of a rubber beam was simulated to validate the developed technique. The simulation results were benchmarked against numerical results by ANSYS and various relevant numerical schemes. The technique can effectively solve the Dirichlet-type BVP, yielding accurate deformation, stress, and strain values across the entire problem domain when employing a linear strain model and increasing the number of CPCM nodes. In addition, comparative analysis with conventional displacement tracking techniques verifies the developed technique’s robustness. The proposed technique effectively circumvents the inherent limitations of traditional monitoring methods resulting from the reliance on physical gauges or target markers so that a robust and non-contact solution for remote structural health monitoring in real-scale infrastructures can be provided, even in unfavorable experimental environments.

Chemistry↗
NASA NTRS2002

A Numerical Scheme for Ordinary Differential Equations Having Time Varying and Nonlinear Coefficients Based on the State Transition Matrix

A variable order method of integrating initial value ordinary differential equations that is based on the state transition matrix has been developed. The method has been evaluated for linear time variant and nonlinear systems of equations. While it is more complex than most other methods, it produces exact solutions at arbitrary time step size when the time variation of the system can be modeled exactly by a polynomial. Solutions to several nonlinear problems exhibiting chaotic behavior have been computed. Accuracy of the method has been demonstrated by comparison with an exact solution and with solutions obtained by established methods.

Bartels, Robert E.↗
NASA NTRS2003

A Stochastic Collocation Algorithm for Uncertainty Analysis

This report describes a stochastic collocation method to adequately handle a physically intrinsic uncertainty in the variables of a numerical simulation. For instance, while the standard Galerkin approach to Polynomial Chaos requires multi-dimensional summations over the stochastic basis functions, the stochastic collocation method enables to collapse those summations to a one-dimensional summation only. This report furnishes the essential algorithmic details of the new stochastic collocation method and provides as a numerical example the solution of the Riemann problem with the stochastic collocation method used for the discretization of the stochastic parameters.

Mathelin, Lionel↗
NASA NTRS1990

Optimal finite-thrust spacecraft trajectories using collocation and nonlinear programming

A new method is described for the determination of optimal spacecraft trajectories in an inverse-square field using finite, fixed thrust. The method employs a recently developed optimization technique which uses a piecewise polynomial representation for the state and controls, and collocation, thus converting the optimal control problem into a nonlinear programming problem, which is solved numerically. This technique has been modified to provide efficient handling of those portions of the trajectory which can be determined analytically, i.e., the coast arcs. Among the problems that have been solved using this method are optimal rendezvous and transfer (including multirevolution cases) and optimal multiburn orbit insertion from hyperbolic approach.

Enright, Paul J.↗
NASA NTRS1984

A method for modeling finite-core vortices in wake-flow calculations

A numerical method for computing nonplanar vortex wakes represented by finite-core vortices is presented. The approach solves for the velocity on an Eulerian grid, using standard finite-difference techniques; the vortex wake is tracked by Lagrangian methods. In this method, the distribution of continuous vorticity in the wake is replaced by a group of discrete vortices. An axially symmetric distribution of vorticity about the center of each discrete vortex is used to represent the finite-core model. Two distributions of vorticity, or core models, are investigated: a finite distribution of vorticity represented by a third-order polynomial, and a continuous distribution of vorticity throughout the wake. The method provides for a vortex-core model that is insensitive to the mesh spacing. Results for a simplified case are presented. Computed results for the roll-up of a vortex wake generated by wings with different spanwise load distributions are presented; contour plots of the flow-field velocities are included; and comparisons are made of the computed flow-field velocities with experimentally measured velocities.

Stremel, P. M.↗
NASA NTRS2004

Validation of an Impedance Education Method in Flow

This paper reports results of a research effort to validate a method for educing the normal incidence impedance of a locally reacting liner, located in a grazing incidence, nonprogressive acoustic wave environment with flow. The results presented in this paper test the ability of the method to reproduce the measured normal incidence impedance of a solid steel plate and two soft test liners in a uniform flow. The test liners are known to be locally react- ing and exhibit no measurable amplitude-dependent impedance nonlinearities or flow effects. Baseline impedance spectra for these liners were therefore established from measurements in a conventional normal incidence impedance tube. A key feature of the method is the expansion of the unknown impedance function as a piecewise continuous polynomial with undetermined coefficients. Stewart's adaptation of the Davidon-Fletcher-Powell optimization algorithm is used to educe the normal incidence impedance at each Mach number by optimizing an objective function. The method is shown to reproduce the measured normal incidence impedance spectrum for each of the test liners, thus validating its usefulness for determining the normal incidence impedance of test liners for a broad range of source frequencies and flow Mach numbers. Nomenclature

Watson, Willie R.↗
NASA NTRSDate not supplied

Discontinuous Galerkin and Related Methods for ODE

Starting from the standard integral formulation, the DG method is derived here in differential form. The key ingredient is a polynomial called the correction function, which helps ‘correct’ the discontinuous solution by approximating the jump and yields a continuous one. Under the right Radau quadrature, this continuous solution is identical to the solutions by the right Radau collocation and the continuous Galerkin (CG) methods. Next, the correction function facilitates the construction of the associated implicit Runge-Kutta schemes (IRK-DG). Different quadratures for DG result in different IRK-DG methods: left Radau quadrature in Radau IA, right Radau quadrature in Radau IIA or right Radau collocation, and Gauss quadrature in a method called DG-Gauss. The construction of IRK-DG clarifies the meaning and facilitates the proofs of various 𝐵(𝑝), 𝐶(𝜂), and 𝐷(𝜁) conditions for accuracy. The two consequences of these conditions are that all 𝑠-stage IRK-DG methods are accurate to order 2𝑠− 1, and the IRK-DG methods of Radau type are unique. Numerical examples showing the behavior of the DG solutions are provided. In all, the correction function plays a key role and helps establish the relations among the DG, IRK DG, collocation, and CG methods.

Numerical Methods for Ordinary Differential Equati↗
NASA NTRSDate not supplied

Monthly Mean DNI and GTI Derived from Monthly Mean GHI and DHI Using Two Methods: Comparisons with the BSRN Data and the Results Derived from the CERES Hourly Data

Monthly mean Global Horizontal Irradiances (GHI) and Diffuse Horizontal Irradiances (DHI) are more widely available than monthly mean Direct Normal Irradiances (DNI) and Global Tilted Irradiances (GTI). Empirical methods have been developed to derive monthly mean DNI and GTI from monthly mean GHI or from GHI and DHI. In this paper, we evaluate two such methods. The first one was the Whitlock Method developed by Charles H. Whitlock (2005) for the NASA POWER project by means of regression of the BSRN data. The method expresses the monthly mean DHI-to-GHI ratio as polynomial functions of monthly mean clearness index, sunset hour angle and noon solar elevation angle on the monthly-average-day. The monthly mean DNI is calculated by dividing the monthly mean GHI-DHI difference, or DirHI, by the cosine of the solar zenith angle at the mid-time between sunrise and solar noon on the monthly-average-day. The second method is the LJCR Method developed by Liu and Jorden (1960) and Collares-Pereira and Rabl (1979), and this method empirically splits monthly mean GHI and DHI into hourly means on the monthly-average-day, and the resulting hourly mean GHI and DHI and their difference, DirHI, can then be used to compute the monthly mean DNI, GTI and the global solar tracker irradiance (GTrI). This method is also used by RETScreen. We recently produced a set of hourly DNI and DHI by bias-correcting the CERES hourly DNI and DHI, and computed hourly GTI and GTrI as well. The data span twenty plus years from March 2000 to near present on a 1 by 1 grid system. The monthly mean CERES GHI and the corrected DHI are used as inputs to the above two methods to compute monthly mean DNI, GTI and GTrI. Through comparisons with the BSRN data, it is found that the Whitlock Method, with slight modification, and the LJCR Method can produce results that are nearly as good as the results derived from the CERES hourly data.

Taiping Zhang↗
DOE OSTI2025

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↗
NASA NTRS1974

Error detection and data smoothing based on local procedures

An algorithm is presented which is able to locate isolated bad points and correct them without contaminating the rest of the good data. This work has been greatly influenced and motivated by what is currently done in the manual loft. It is not within the scope of this work to handle small random errors characteristic of a noisy system, and it is therefore assumed that the bad points are isolated and relatively few when compared with the total number of points. Motivated by the desire to imitate the loftsman a visual experiment was conducted to determine what is considered smooth data. This criterion is used to determine how much the data should be smoothed and to prove that this method produces such data. The method utimately converges to a set of points that lies on the polynomial that interpolates the first and last points; however convergence to such a set is definitely not the purpose of our algorithm. The proof of convergence is necessary to demonstrate that oscillation does not take place and that in a finite number of steps the method produces a set as smooth as desired.

Guerra, V. M.↗
NASA NTRS1985

Selecting step sizes in sensitivity analysis by finite differences

This paper deals with methods for obtaining near-optimum step sizes for finite difference approximations to first derivatives with particular application to sensitivity analysis. A technique denoted the finite difference (FD) algorithm, previously described in the literature and applicable to one derivative at a time, is extended to the calculation of several simultaneously. Both the original and extended FD algorithms are applied to sensitivity analysis for a data-fitting problem in which derivatives of the coefficients of an interpolation polynomial are calculated with respect to uncertainties in the data. The methods are also applied to sensitivity analysis of the structural response of a finite-element-modeled swept wing. In a previous study, this sensitivity analysis of the swept wing required a time-consuming trial-and-error effort to obtain a suitable step size, but it proved to be a routine application for the extended FD algorithm herein.

Iott, J.↗
NASA NTRS1993

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

Swarztrauber, Paul N.↗
NASA NTRS1998

A New and Fast Method for Smoothing Spectral Imaging Data

The Airborne Visible Infrared Imaging Spectrometer (AVIRIS) acquires spectral imaging data covering the 0.4 - 2.5 micron wavelength range in 224 10-nm-wide channels from a NASA ER-2 aircraft at 20 km. More than half of the spectral region is affected by atmospheric gaseous absorption. Over the past decade, several techniques have been used to remove atmospheric effects from AVIRIS data for the derivation of surface reflectance spectra. An operational atmosphere removal algorithm (ATREM), which is based on theoretical modeling of atmospheric absorption and scattering effects, has been developed and updated for deriving surface reflectance spectra from AVIRIS data. Due to small errors in assumed wavelengths and errors in line parameters compiled on the HITRAN database, small spikes (particularly near the centers of the 0.94- and 1.14-micron water vapor bands) are present in this spectrum. Similar small spikes are systematically present in entire ATREM output cubes. These spikes have distracted geologists who are interested in studying surface mineral features. A method based on the "global" fitting of spectra with low order polynomials or other functions for removing these weak spikes has recently been developed by Boardman (this volume). In this paper, we describe another technique, which fits spectra "locally" based on cubic spline smoothing, for quick post processing of ATREM apparent reflectance spectra derived from AVIRIS data. Results from our analysis of AVIRIS data acquired over Cuprite mining district in Nevada in June of 1995 are given. Comparisons between our smoothed spectra and those derived with the empirical line method are presented.

Gao, Bo-Cai↗
DOE OSTI2026

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗
DOE OSTI2025

Investigating the universality of five-point QCD scattering amplitudes at high energy

We investigate 2 → 3 QCD scattering amplitudes in multi-Regge kinematics, i.e. where the final partons are strongly ordered in rapidity. In this regime amplitudes exhibit intriguing factorisation properties which can be understood in terms of effective degrees of freedom called reggeons. Working within the Balitsky/JIMWLK framework, we predict these amplitudes for the first time to next-to-next-to-leading logarithmic order, and compare against the limit of QCD scattering amplitudes in full colour and kinematics. We find that the latter can be described in terms of universal objects, and that the apparent non-universality arising at NNLL comes from well-defined and under-control contributions that we can predict. Thanks to this observation, we extract for the first time the universal vertex that controls the emission of the central-rapidity gluon, both in QCD and $\mathcal{N}$ = 4 super Yang-Mills.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

NN-OpInf

SAND2026-18878O The NN-OpInf tool is a PyTorch-based approach to operator inference that uses composable, structure-preserving neural networks to represent nonlinear operators. Operator inference is a machine learning method for inferring low-dimensional systems from data and polynomial models for system dynamics. However, many systems do not conform to polynomial structures, which NN-OpInf addresses by parameterizing operators with neural networks. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗