Search NASA⌕ Search

SEARCH · Search NASA

Results for “Chebyshev 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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

The accurate solution of Poisson's equation by expansion in Chebyshev polynomials

A Chebyshev expansion technique is applied to Poisson's equation on a square with homogeneous Dirichlet boundary conditions. The spectral equations are solved in two ways - by alternating direction and by matrix diagonalization methods. Solutions are sought to both oscillatory and mildly singular problems. The accuracy and efficiency of the Chebyshev approach compare favorably with those of standard second- and fourth-order finite-difference methods.

Haidvogel, D. B.↗
NASA NTRS1996

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Johnson, Duane↗
NASA NTRS1989

Chebyshev Polynomials Are Not Always Optimal

The authors are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, the authors show that this is not true in general. Moreover, the authors derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented.

CHEBYSHEV APPROXIMATION↗
NASA NTRS1989

Chebyshev polynomials are not always optimal

The problem is that of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. It is shown that this is not true in general. Moreover, sufficient conditions are derived which guarantee that Chebyshev polynomials are optimal. Some numerical examples are also presented.

Fischer, Bernd↗
NASA NTRS2013

Trajectory Optimization Using Adjoint Method and Chebyshev Polynomial Approximation for Minimizing Fuel Consumption During Climb

This paper describes two methods of trajectory optimization to obtain an optimal trajectory of minimum-fuel- to-climb for an aircraft. The first method is based on the adjoint method, and the second method is based on a direct trajectory optimization method using a Chebyshev polynomial approximation and cubic spine approximation. The approximate optimal trajectory will be compared with the adjoint-based optimal trajectory which is considered as the true optimal solution of the trajectory optimization problem. The adjoint-based optimization problem leads to a singular optimal control solution which results in a bang-singular-bang optimal control.

Chebyshev Polynomial↗
NASA NTRS1982

The optimization of convergence for Chebyshev polynomial methods in an unbounded domain

Grosch and Orszag (1977) have performed a numerical analysis of the problem of solving differential equations in a semiinfinite or infinite domain using Chebyshev polynomials. The principal limitation of the conducted study was that it was entirely empirical. Various differential equations were solved in different ways and the numbers were compared. The present investigation has the objective to extend the studies conducted by Grosch and Orszag by deriving asymptotic approximations to the Chebyshev coefficients of simple model functions. This approach makes it possible to conduct more systematic comparisons of different methods, extend the range of comparisons, and, perhaps most important, give simple analytic formulas for choosing the optimum domain size or mapping parameter L for various situations.

Boyd, J. P.↗
DOE OSTI2022

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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 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 OSTI2021

Semi-Automated Creation of Density Functional Tight Binding Models through Leveraging Chebyshev Polynomial-Based Force Fields

Density functional tight binding (DFTB) is an attractive method for accelerated quantum simulations of condensed matter due to its enhanced computational efficiency over standard density functional theory (DFT) approaches. However, DFTB models can be challenging to determine for individual systems of interest, especially for metallic and interfacial systems where different bonding arrangements can lead to significant changes in electronic states. In this regard, we have created a rapid-screening approach for determining systematically improvable DFTB interaction potentials that can yield transferable models for a variety of conditions. Our method leverages a recent reactive molecular dynamics force field where many-body interactions are represented by linear combinations of Chebyshev polynomials. This allows for the efficient creation of multi-center representations with relative ease, requiring only a small investment in initial DFT calculations. Here, we have focused our workflow on TiH 2 as a model system and show that a relatively small training set based on unit-cell-sized calculations yields a model accurate for both bulk and surface properties. Our approach is easy to implement and can yield reliable DFTB models over a broad range of thermodynamic conditions, where physical and chemical properties can be difficult to interrogate directly and there is historically a significant reliance on theoretical approaches for interpretation and validation of experimental results.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
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↗
NASA NTRS2012

Algorithm for Compressing Time-Series Data

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

Hawkins, S. Edward, III↗
DOE OSTI2022

Extended kinetic lattice grand canonical Monte Carlo simulation method for transport of multicomponent ion mixtures through a model nanopore system

Abstract An extended version of the original kinetic lattice grand canonical Monte Carlo simulation method combined with mean field theory (KLGCMC/MF) ( J. Chem. Phys. 2007 , 127, 024706) is presented for the study of transport of multicomponent ion mixtures through a model nanopore. Comparison of the extended KLGCMC/MF (eKLGCMC/MF) simulation results with Poisson–Nernst–Planck (PNP) calculations is also made to confirm the validity of the extended simulation approach. Unlike the original version of KLGCMC/MF simulation method that treats only a binary ionic solution with one cation and one anion species, this extended version can deal with a system that includes ternary ion mixtures. A diffusion probability algorithm is also added to the extended version of the simulation method to describe the inhomogeneous diffusivity of ions that is often observed in the ion permeation through nanopores. Both Legendre and Chebyshev polynomials of the second kind were tested as a basis set for the basis set expansion (BSE) method with which to calculate the reaction field energy in the eKLGCMC/MF simulation. It turned out that the Legendre polynomials perform better than the Chebyshev polynomials, and as a result, the Legendre polynomials were implemented in the current version of eKLGCMC/MF simulation algorithm. The presented eKLGCMC/MF simulation method with new features finds its potential applications in nanopore systems where the correlation between ion species with the same sign of charges plays a key role such as oscillating ion currents or anomalous mole fraction effects.

Choi, Inhyeok↗
NASA NTRS1975

Analytical theory for artificial satellites

A theory for generating segmented ephemerides is discussed as a means for fast generation and simple retrieval of nominal orbit data. Over a succession of finite intervals of time, the orbit is represented by a best approximation expressed by Chebyshev polynomials. Storage of coefficients tables for Chebyshev polynomials is seen as a method to reduce data and decrease transmission costs. A general algorithm was constructed and computer programs were designed. The possibility of storing an ephemeris for a few days in the on-board computer, or in microprocessors attached to the data collectors is suggested.

Deprit, A.↗
NASA NTRS2019

Meshless Local Petrov-Galerkin (MLPG) Method with Orthogonal Polynomials for Euler-Bernoulli Beam Problems

In this paper, the feasibility of orthogonal polynomials in the meshless local Petrov Galerkin method (MLPG) method is studied. The orthogonal polynomials, Chebyshev and Legendre polynomials, are used in this MLPG method as trial functions. The test functions used were power functions with smooth derivatives at their ends. The performance of these methods is studied by applying these methods to Euler-Bernoulli beam problems. The MLPG-Galerkin and Legendre methods passed all the patch tests for simple beam problems. Next the formulations are tested on complex beam problems such as beams with partial loadings and continuous beam problems. Problems with load discontinuities and additional supports require special attention. Near discontinuities, judicious choice of number of nodes and nodal placements are needed to obtain accurate deflections, slopes, moments and shear forces. As polynomial functions are used, the large number of nodes can create a transformation matrix that is ill-conditioned, resulting in problems with the inversion of the matrix. The conditioning worsens as the number of nodes are increased beyond 20. Quadruple precision was needed for models to obtain accurate solutions. Even with quadruple precision the accuracy of the method suffers as the number of nodes is increased beyond 20. This appears to be a drawback of the MLPG-Chebyshev and MLPG-Legendre methods.

Raju, Ivatury S.↗
DOE OSTI2021

Davis Computational Spectroscopy Workflow—From Structure to Spectra

Here, we describe an automated workflow that connects a series of atomic simulation tools to investigate the relationship between atomic structure, lattice dynamics, materials properties, and inelastic neutron scattering (INS) spectra. Starting from the atomic simulation environment (ASE) as an interface, we demonstrate the use of a selection of calculators, including density functional theory (DFT) and density functional tight binding (DFTB), to optimize the structures and calculate interatomic force constants. We present the use of our workflow to compute the phonon frequencies and eigenvectors, which are required to accurately simulate the INS spectra in crystalline solids like diamond and graphite as well as molecular solids like rubrene. We have also implemented a machine-learning force field based on Chebyshev polynomials called the Chebyshev interaction model for efficient simulation (ChIMES) to improve the accuracy of the DFTB simulations. We then explore the transferability of our DFTB/ChIMES models by comparing simulations derived from different training sets. We show that DFTB/ChIMES demonstrates ~100× reduction in computational expense while retaining most of the accuracy of DFT as well as yielding high accuracy for different materials outside of our training sets. The DFTB/ChIMES method within the workflow expands the possibilities to use simulations to accurately predict materials properties of increasingly complex structures that would be unfeasible with ab initio methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗