SEARCH · Search NASA

Results for “CHEBYSHEV APPROXIMATION”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1992

The eigenvalue spectrum of the Rayleigh equation for a plane shear layer

The eigenvalue spectrum of the Rayleigh equation is examined using three different solution techniques. In particular, a simple second-order finite difference scheme and two spectral methods, the Chebyshev tau and Chebyshev collocation methods, are used to discretize the equation. All of the approximation methods are shown to be capable of predicting the discrete spectrum as well as the continuous spectrum associated with the critical point singularity for the Rayleigh equation. The global eigenvalue methods considered here provide an efficient way of obtaining either an approximation to the complete eigenvalue spectrum or initial guesses for a local shooting procedure for the discrete part of the spectrum.

Liou, William W.-W.↗

NASA NTRS1995

Solution of acoustic workshop problems by a spectral multidomain method

We use a new staggered grid Chebyshev spectral multidomain method to solve three of the Workshop benchmark problems. The method defines solution unknowns at the nodes of the Chebyshev Gauss quadrature, and the fluxes at the nodes of the Chebyshev Gauss-Lobatto quadrature. The Chebyshev spectral method gives exponentially convergent phase and dissipation errors. The multidomain approximation gives the method flexibility. Using the method, we solve problems in Categories 1 and 5 of the benchmark problems.

Kopriva, Davis A.↗

NASA NTRS2011

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Nguyen, Nhan T.↗

DOE OSTI2025

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Multi-Factor-Coupled, Ahead-of-Time Aggregation of Power Flexibility Under Forecast Uncertainty

The increasing penetration of distributed energy resources (DERs) is significantly reshaping the role of distribution systems under active energy management. To aggregate the active-reactive power flexibility of DERs dispersed at the feeder and provide capacity support to the transmission system, it is essential to efficiently identify feasible substation power injection trajectories. This paper introduces a novel ahead-of-time flexibility characterization method to address it. First, a polyhedral non-feeder-level power flexibility region (PFR) is constructed, accounting for various time-dependent, power-coupled, and forecast error uncertainties. Then, a polyhedral feeder-level PFR is analytically derived through a coordinate transformation, which can reveal the uncertainty propagation path, i.e., how uncertainty applies to the feeder-level PFR. To facilitate the high-level application, a tractable chance-constrained Chebyshev centering optimization model is further developed to find a ball-shaped inner approximation of the feeder-level PFR. Finally, the proposed method is validated on a modified IEEE 123-bus test system. Here, both theoretical and experimental results show that, with appropriate robustness parameter settings, the proposed method can make the approximated PFR less conservative with abundant robustness against forecast error uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1993

Effect of curvature on stationary crossflow instability of a three-dimensional boundary layer

An incompressible three-dimensional laminar boundary-layer flow over a swept wing is used as a model to study both the wall-curvature and streamline-curvature effects on the stationary crossflow instability. The basic state is obtained by solving the full Navier-Stokes (N-S) equations numerically. The linear disturbance equations are cast on a fixed, body-intrinsic, curvilinear coordinate system. Those nonparallel terms which contribute mainly to the streamline-curvature effect are retained in the formulation of the disturbance equations and approximated by their local finite difference values. The resulting eigenvalue problem is solved by a Chebyshev collocation method. The present results indicate that the convex wall curvature has a stabilizing effect, whereas the streamline curvature has a destabilizing effect. A validation of these effects with an N-S solution for the linear disturbance flow is provided.

Lin, Ray-Sing↗

NASA NTRS1989

Optimal Chebyshev polynomials on ellipses in the complex plane

The design of iterative schemes for sparse matrix computations often leads to constrained polynomial approximation problems on sets in the complex plane. For the case of ellipses, we introduce a new class of complex polynomials which are in general very good approximations to the best polynomials and even optimal in most cases.

Fischer, Bernd↗

NASA NTRS1981

Photoexcitation and ionization in carbon dioxide - Theoretical studies in the separated-channel static-exchange approximation

Vertical-electronic static-exchange photoexcitation and ionization cross sections are reported which provide a first approximation to the complete dipole spectrum of CO2. Separated-channel static-exchange calculations of vertical-electronic transition energies and oscillator strengths, and Stieltjes-Chebyshev moment methods were used in the development. Detailed comparisons were made of the static-exchange excitation and ionization spectra with photoabsorption, electron-impact excitation, and quantum-defect estimates of discrete transition energies and intensities, and with partial-channel photoionization cross sections obtained from fluorescence measurements and from tunable-source and (e, 2e) photoelectron spectroscopy. Results show that the separate-channel static-exchange approximation is generally satisfactory in CO2.

Padial, N.↗

NASA NTRS1984

On the stability of the decelerating laminar boundary layer

The stability of a decelerating boundary-layer flow is investigated experimentally and numerically. Experimentally, a flat plate having a Blasius boundary layer is decelerated in an 18 m towing tank. The boundary layer becomes unstable to two-dimensional waves, which break down into three-dimensional patterns, hairpin vortices, and finally turbulent bursts when the vortices lift off the wall. The unsteady boundary-layer equations are solved numerically to generate instantaneous velocity profiles for a range of boundary and initial conditions. A quasi-steady approximation is invoked and the stability of local velocity profiles is determined by solving the Orr-Sommerfeld equation using Chebyshev matrix methods. Comparisons are made between the numerical predictions and the experimentally observed instabilities.

Gad-El-hak, M.↗

NASA NTRS1994

On the Gibbs phenomenon 5: Recovering exponential accuracy from collocation point values of a piecewise analytic function

The paper presents a method to recover exponential accuracy at all points (including at the discontinuities themselves), from the knowledge of an approximation to the interpolation polynomial (or trigonometrical polynomial). We show that if we are given the collocation point values (or a highly accurate approximation) at the Gauss or Gauss-Lobatto points, we can reconstruct a uniform exponentially convergent approximation to the function f(x) in any sub-interval of analyticity. The proof covers the cases of Fourier, Chebyshev, Legendre, and more general Gegenbauer collocation methods.

Gottlieb, David↗

NASA NTRS1994

On the Gibbs phenomenon 4: Recovering exponential accuracy in a sub-interval from a Gegenbauer partial sum of a piecewise analytic function

We continue our investigation of overcoming Gibbs phenomenon, i.e., to obtain exponential accuracy at all points (including at the discontinuities themselves), from the knowledge of a spectral partial sum of a discontinuous but piecewise analytic function. We show that if we are given the first N Gegenbauer expansion coefficients, based on the Gegenbauer polynomials C(sub k)(sup mu)(x) with the weight function (1 - x(exp 2))(exp mu - 1/2) for any constant mu is greater than or equal to 0, of an L(sub 1) function f(x), we can construct an exponentially convergent approximation to the point values of f(x) in any subinterval in which the function is analytic. The proof covers the cases of Chebyshev or Legendre partial sums, which are most common in applications.

Gottlieb, David↗

NASA NTRS1975

The use of series-solutions for batch and sequential estimation

Iterative methods for the approximate solution of the nonlinear state estimation problem are investigated in which the solution is retained in the form of a finite series of Chebyshev polynomials. Algorithms are presented which allow the state to be estimated from observational data in either the batch or the sequential form. The advantages of these techniques are discussed.

Feagin, T.↗

DOE OSTI2024

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗

NASA NTRS1988

Single-grid spectral collocation for the Navier-Stokes equations

The aim of the paper is to study a collocation spectral method to approximate the Navier-Stokes equations: only one grid is used, which is built from the nodes of a Gauss-Lobatto quadrature formula, either of Legendre or of Chebyshev type. The convergence is proven for the Stokes problem provided with inhomogeneous Dirichlet conditions, then thoroughly analyzed for the Navier-Stokes equations. The practical implementation algorithm is presented, together with numerical results.

Bernardi, Christine↗

NASA NTRS1991

Planetary ephemerides approximation for radar astronomy

The planetary ephemerides approximation for radar astronomy is discussed, and, in particular, the effect of this approximation on the performance of the programmable local oscillator (PLO) used in Goldstone Solar System Radar is presented. Four different approaches are considered and it is shown that the Gram polynomials outperform the commonly used technique based on Chebyshev polynomials. These methods are used to analyze the mean square, the phase error, and the frequency tracking error in the presence of the worst case Doppler shift that one may encounter within the solar system. It is shown that in the worst case the phase error is under one degree and the frequency tracking error less than one hertz when the frequency to the PLO is updated every millisecond.

Sadr, R.↗

NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

NASA NTRS1990

Conforming Chebyshev spectral collocation methods for the solution of laminar flow in a constricted channel

The numerical simulation of steady planar two-dimensional, laminar flow of an incompressible fluid through an abruptly contracting channel using spectral domain decomposition methods is described. The key features of the method are the decomposition of the flow region into a number of rectangular subregions and spectral approximations which are pointwise C(1) continuous across subregion interfaces. Spectral approximations to the solution are obtained for Reynolds numbers in the range 0 to 500. The size of the salient corner vortex decreases as the Reynolds number increases from 0 to around 45. As the Reynolds number is increased further the vortex grows slowly. A vortex is detected downstream of the contraction at a Reynolds number of around 175 that continues to grow as the Reynolds number is increased further.

Karageorghis, Andreas↗

NASA NTRS1990

Linear iterative solvers for implicit ODE methods

The numerical solution of stiff initial value problems, which lead to the problem of solving large systems of mildly nonlinear equations are considered. For many problems derived from engineering and science, a solution is possible only with methods derived from iterative linear equation solvers. A common approach to solving the nonlinear equations is to employ an approximate solution obtained from an explicit method. The error is examined to determine how it is distributed among the stiff and non-stiff components, which bears on the choice of an iterative method. The conclusion is that error is (roughly) uniformly distributed, a fact that suggests the Chebyshev method (and the accompanying Manteuffel adaptive parameter algorithm). This method is described, also commenting on Richardson's method and its advantages for large problems. Richardson's method and the Chebyshev method with the Mantueffel algorithm are applied to the solution of the nonlinear equations by Newton's method.

Saylor, Paul E.↗