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 145 records · Page 8

Comparing smoothing techniques for extracting MOSFET threshold voltage

Measurement noise acts as a barrier to the accurate calculation of threshold voltage by derivative-based extraction methods. We examined several smoothing techniques and their effects on measurement noise in threshold voltage extracted by the linear extrapolation method and the g m /I d method. We applied these techniques on a set of SiC power MOSFET devices before and after they had undergone accelerated thermal testing. The smoothing methods examined are least-squares polynomial fitting, low-pass filtering using Butterworth and Chebyshev fillers, and differential smoothing. These methods are compared by their shift in threshold voltage compared to unsmoothed data and their standard deviation among the measurements of each device. All methods performed poorly at smoothing when extracting via the g m /I d due to the large amounts of high-magnitude subthreshold noise, mostly tending to extract threshold voltages far below the expected value. Differential smoothing provided results closest to the expected value with an absolute shift of 1.2 V on average. The smoothing methods performed better with the LE method. On a failed device, all smoothing methods except polynomial smoothing preserved the large threshold voltage anomaly for four out of five measurements. These results show that choice of smoothing method, if used must be evaluated based on the device and extraction method.

42 ENGINEERING↗

Pseudo spectral Chebyshev representation of few-group cross sections on sparse grids

This paper presents a pseudo spectral method for representing few-group homogenised cross sections, based on hierarchical polynomial interpolation. The interpolation is performed on a multi-dimensional sparse grid built from Chebyshev nodes. The representation is assembled directly from the samples using basis functions that are constructed as tensor products of the classical one-dimensional Lagrangian interpolation functions. The advantage of this representation is that it combines the accuracy of Chebyshev interpolation with the efficiency of sparse grid methods. As an initial test, this interpolation method was used to construct a representation for the two-group macroscopic cross sections of a VVER pin cell. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Fischer, Bernd↗

Recurrence relations for computing with modified divided differences

Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abcissas. Recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial are given. The latter operation is likely to be useful if MDD are used in a method for solving stiff differential equations.

Krogh, F.↗

Recurrence relations for computing with modified divided differences

Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abscissas. This note gives recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial. The latter operation is likely to be useful if MDD are used in a method for solving stiff differential equations.

Krogh, F. T.↗

Compression of ephemerides

An algorithm is proposed for generating sequences of Chebyshev series which are the best approximations of an astronomical ephemeris in the sense of Chebyshev over large intervals of time. The criterion for a polynomial approximation of a function to be the best polynomial approximation of the function is that the error function present certain rippling characteristics as described by Remez (1957). General features of the program in PL/1 are described.

Deprit, A.↗

Quadrature imposition of compatibility conditions in Chebyshev methods

This paper handles a problem encountered in the solution by way of Chebyshev spectral collocation discretization of the Poisson equation with homogeneous Neumann boundary conditions. When pseudospectral Chebyshev methodology is utilized to discretize the partial differential equation these integrals have to be approximated by an appropriate quadrature formula. The correct quadrature formula is developed for these problems, taking into account the degree of the polynomials involved. It is shown that this formula leads to a well-conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗

On polynomial preconditioning for indefinite Hermitian matrices

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

Freund, Roland W.↗

Quadrature imposition of compatibility conditions in Chebyshev methods

Often, in solving an elliptic equation with Neumann boundary conditions, a compatibility condition has to be imposed for well-posedness. This condition involves integrals of the forcing function. When pseudospectral Chebyshev methods are used to discretize the partial differential equation, these integrals have to be approximated by an appropriate quadrature formula. The Gauss-Chebyshev (or any variant of it, like the Gauss-Lobatto) formula can not be used here since the integrals under consideration do not include the weight function. A natural candidate to be used in approximating the integrals is the Clenshaw-Curtis formula, however it is shown that this is the wrong choice and it may lead to divergence if time dependent methods are used to march the solution to steady state. The correct quadrature formula is developed for these problems. This formula takes into account the degree of the polynomials involved. It is shown that this formula leads to a well conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗

Stability analysis of spectral methods for hyperbolic initial-boundary value systems

A constant coefficient hyperbolic system in one space variable, with zero initial data is discussed. Dissipative boundary conditions are imposed at the two points x = + or - 1. This problem is discretized by a spectral approximation in space. Sufficient conditions under which the spectral numerical solution is stable are demonstrated - moreover, these conditions have to be checked only for scalar equations. The stability theorems take the form of explicit bounds for the norm of the solution in terms of the boundary data. The dependence of these bounds on N, the number of points in the domain (or equivalently the degree of the polynomials involved), is investigated for a class of standard spectral methods, including Chebyshev and Legendre collocations.

Gottlieb, D.↗

Compression of ephemerides by discrete Chebyshev approximations

The use of Chebyshev series in representing the ephemerides of satellites and planets in terms of truncated polynomial series is discussed. Emphasis is placed on a FORTRAN package which was developed for fitting satellite orbits. The features desired in any approximation are: (1) the ability to compress a satellite emphemeris; (2) the ability to represent a satellite ephemeris over several orbits; (3) guaranteed accuracy to within prescribed tolerance over the time interval of consideration; and (4) fast processing. These features are imposed with an eye towards adapting the approximation for use on microprocessor applications in which storage is limited and real time processing is required.

Pickard, H. M.↗

Criteria for the Best Approximation by Simple Partial Fractions on Semi-Axis and Axis

We study uniform approximation of real-valued functions f, f(∞) = 0, on ℝ{sup +} and ℝ by real-valued simple partial fractions (the logarithmic derivatives of polynomials). We obtain a criterion for the best approximation on ℝ{sup +} and ℝ in terms of the Chebyshev alternance. This criterion is similar to the known criterion on finite segments. For the problem of approximating odd functions on ℝ we construct an alternance criterion with a weakened condition on the poles of fractions. We present a criterion for the best approximation by simple partial fractions on ℝ{sup +} and ℝ in terms of Kolmogorov. We prove analogs of the de la Vallee-Poussin alternation theorem.

97 MATHEMATICS AND COMPUTING↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

Cell averaging Chebyshev methods for hyperbolic problems

A cell averaging method for the Chebyshev approximations of first order hyperbolic equations in conservation form is described. Formulas are presented for transforming between pointwise data at the collocation points and cell averaged quantities, and vice-versa. This step, trivial for the finite difference and Fourier methods, is nontrivial for the global polynomials used in spectral methods. The cell averaging methods presented are proven stable for linear scalar hyperbolic equations and present numerical simulations of shock-density wave interaction using the new cell averaging Chebyshev methods.

Wei, Cai↗

Using Laguerre polynomials to compute the matrix exponential in burnup calculations

An essential part of burnup analysis is to solve the burnup equations. The burnup equations can be regarded as a first-order linear system and solved by means of matrix exponential methods. Because of its large spectrum, it is difficult to compute the exponential of the burnup matrix. Conventional methods of computing the matrix exponential, such as the truncated Taylor expansion and the Pade approximation, are not applicable to burnup calculations. Recently the Chebyshev Rational Approximation Method (CRAM) has been applied to solve burnup matrix exponential and shown to be robust and accurate. However, the main defect of CRAM is that its coefficients are not easy to obtain. In this paper, an orthogonal polynomial expansion method, called Laguerre Polynomial Approximation Method (LPAM), is proposed to compute the matrix exponential in burnup calculations. The polynomial sequence of LPAM can be easily computed in any order and thus LPAM is quite convenient to be utilized into burnup codes. Two typical test cases with the decay and cross-section data taken from the standard ORIGEN 2.1 libraries are calculated for validation, against the reference results provided by CRAM of 14 order. Numerical results show that, LPAM is sufficiently accurate for burnup calculations. The influences of the parameters on the convergence of LPAM are also discussed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Enabling attractive-repulsive potentials in binary-collision-approximation monte-carlo codes for ion-surface interactions

Abstract Binary Collision Approximation (BCA) codes for ion-material interactions, such as SRIM, Tridyn, F-TRIDYN, and SDtrimSP, have historically been limited to screened Coulomb potentials even at low energies due to the difficulty in numerically solving the Distance of Closest Approach (DOCA) problem for attractive-repulsive potentials. Techniques such as direct n-body simulation or modifications to Newton’s method are either prohibitively costly or not guaranteed to work for all potentials. Advanced rootfinding techniques, such as companion matrix solvers, offer a solution. For many attractive-repulsive potentials, however, a companion matrix cannot be used directly, because there is no way to put the associated functions into a monomial basis form. A complementary technique is proxy rootfinding—by finding the best-fit polynomial approximant of a function, the zeros of the approximant can be guaranteed to be close to the zeros of the function. Using the Chebyshev basis and grid offers additional guarantees with regards to the quality of the approximation, the speed of convergence, and the avoidance of Runge’s phenomenon. By finding Chebyshev interpolants and using the Chebyshev-Frobenius companion matrix, the zeros of any real function on a bounded domain can be found. Here we show that using an Adaptive Chebyshev Proxy Rootfinder with Automatic Subdivision (ACPRAS) with appropriate scaling functions, numerical issues presented by attractive-repulsive potentials, including those of scale, can be handled. Using these techniques, we show that it is possible to include any physically reasonable interatomic potential in a BCA code, and to guarantee correctness of the resulting scattering angle calculations.

Materials Science↗

New Bernstein type inequalities for polynomials on ellipses

New and sharp estimates are derived for the growth in the complex plane of polynomials known to have a curved majorant on a given ellipse. These so-called Bernstein type inequalities are closely connected with certain constrained Chebyshev approximation problems on ellipses. Also presented are some new results for approximation problems of this type.

Freund, Roland↗

On the parallel solution of parabolic equations

Parallel algorithms for the solution of linear parabolic problems are proposed. The first of these methods is based on using polynomial approximation to the exponential. It does not require solving any linear systems and is highly parallelizable. The two other methods proposed are based on Pade and Chebyshev approximations to the matrix exponential. The parallelization of these methods is achieved by using partial fraction decomposition techniques to solve the resulting systems and thus offers the potential for increased time parallelism in time dependent problems. Experimental results from the Alliant FX/8 and the Cray Y-MP/832 vector multiprocessors are also presented.

Gallopoulos, E.↗