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

Comparing the Expense and Accuracy of Methods to Simulate Atomic Vibrations in Rubrene

Atomic vibrations can inform about materials properties from hole transport in organic semiconductors to correlated disorder in metal–organic frameworks. Currently, there are several methods for predicting these vibrations using simulations, but the accuracy–efficiency tradeoffs have not been examined in depth. In this work, rubrene is used as a model system to predict atomic vibrational properties using six different simulation methods: density functional theory, density functional tight binding, density functional tight binding with a Chebyshev polynomial-based correction, a trained machine learning model, a pretrained machine learning model called ANI-1, and a classical forcefield model. The accuracy of each method is evaluated by comparison to the experimental inelastic neutron scattering spectrum. All methods discussed here show some accuracy across a wide energy region, though the Chebyshev-corrected tight-binding method showed the optimal combination of high accuracy with low expense. We then offer broad simulation guidelines to yield efficient, accurate results for inelastic neutron scattering spectrum prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A NEW TOOL FOR IMAGE ANALYSIS BASED ON CHEBYSHEV RATIONAL FUNCTIONS: CHEF FUNCTIONS

We introduce a new approach to the modeling of the light distribution of galaxies, an orthonormal polar basis formed by a combination of Chebyshev rational functions and Fourier polynomials that we call CHEF functions, or CHEFs. We have developed an orthonormalization process to apply this basis to pixelized images, and implemented the method as a Python pipeline. The new basis displays remarkable flexibility, being able to accurately fit all kinds of galaxy shapes, including irregulars, spirals, ellipticals, highly compact, and highly elongated galaxies. It does this while using fewer components than similar methods, as shapelets, and without producing artifacts, due to the efficiency of the rational Chebyshev polynomials to fit quickly decaying functions like galaxy profiles. The method is linear and very stable, and therefore is capable of processing large numbers of galaxies in a fast and automated way. Due to the high quality of the fits in the central parts of the galaxies, and the efficiency of the CHEF basis modeling galaxy profiles up to very large distances, the method provides highly accurate estimates of total galaxy fluxes and ellipticities. Future papers will explore in more detail the application of the method to perform multiband photometry, morphological classification, and weak shear measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the 10{sup 2} innermost eigenpairs of a topological insulator matrix with dimension 10{sup 9} derived from quantum physics applications.

97 MATHEMATICS AND COMPUTING↗

Symbolic computation of recurrence equations for the Chebyshev series solution of linear ODE's

If a linear ordinary differential equation with polynomial coefficients is converted into integrated form then the formal substitution of a Chebyshev series leads to recurrence equations defining the Chebyshev coefficients of the solution function. An explicit formula is presented for the polynomial coefficients of the integrated form in terms of the polynomial coefficients of the differential form. The symmetries arising from multiplication and integration of Chebyshev polynomials are exploited in deriving a general recurrence equation from which can be derived all of the linear equations defining the Chebyshev coefficients. Procedures for deriving the general recurrence equation are specified in a precise algorithmic notation suitable for translation into any of the languages for symbolic computation. The method is algebraic and it can therefore be applied to differential equations containing indeterminates.

Geddes, K. O.↗

Rapidly convergent quantum Monte Carlo using a Chebyshev projector

The multireference coupled-cluster Monte Carlo (MR-CCMC) algorithm is a determinant-based quantum Monte Carlo (QMC) algorithm that is conceptually similar to Full Configuration Interaction QMC (FCIQMC). It has been shown to offer a balanced treatment of both static and dynamic correlation while retaining polynomial scaling, although application to large systems with significant strong correlation remained impractical. In this paper, we document recent algorithmic advances that enable rapid convergence and a more black-box approach to the multireference problem. These include a logarithmically scaling metric-tree-based excitation acceptance algorithm to search for determinants connected to the reference space at the desired excitation level and a symmetry-screening procedure for the reference space. We show that, for moderately sized reference spaces, the new search algorithm brings about an approximately 8-fold acceleration of one MR-CCMC iteration, while the symmetry screening procedure reduces the number of active reference space determinants with essentially no loss of accuracy. We also introduce a stochastic implementation of an approximate wall projector, which is the infinite imaginary time limit of the exponential projector, using a truncated expansion of the wall function in Chebyshev polynomials. Notably, this wall-Chebyshev projector can be used to accelerate any projector-based QMC algorithm. We show that it requires significantly fewer applications of the Hamiltonian to achieve the same statistical convergence. We benchmark these acceleration methods on the beryllium and carbon dimers, using initiator FCIQMC and MR-CCMC with basis sets up to cc-pVQZ quality.

Zhao, Zijun↗

Charge And Dynamic Current On Tubular Antennas For Various Drive Conditions

The mixed boundary value problem of a tubular conductor is solved using an approximate representation of its Fourier coefficients. A two term solution is derived, which represents the solution over an extremely broad range of aspect ratios. This representation is used to find the electrostatic solution and capacitance of a charged tube as well as the solution of a tube in a uniform field and its dipole moment. This second case is directly useful as a model for a monopole electric field probe. This approximation is a special case of a representation using a combination of Chebyshev and Legendre polynomials. Combining the charged tube and tube in a uniform field allows the solution of voltage driven tubular antennas. Comparisons are made with numerical solutions using piecewise sinusoidal representations of the current. The results are also generalized to the dynamic case and up to and beyond the first resonance. Simple corrections for finite gap and delta gap drives to magnetic frill drives are examined using infinite tube integral transform representations. Corrections between magnetic frill drives and coaxial drives are also given. Approximate drive corrections using conformal mapping and an effective radius are also discussed. Finally, this efficient current representation is applied to the magnetic problem involving simple tubular solenoids.

97 MATHEMATICS AND COMPUTING↗

Spectral scheme for atomic structure calculations in density functional theory

In this study, we present a spectral scheme for atomic structure calculations in pseudopotential Kohn-Sham density functional theory. In particular, after applying an exponential transformation of the radial coordinates, we employ global polynomial interpolation on a Chebyshev grid, with derivative operators approximated using the Chebyshev differentiation matrix, and integrations using Clenshaw-Curtis quadrature. We demonstrate the accuracy and efficiency of the scheme through spin-polarized and unpolarized calculations for representative atoms, while considering local, semilocal, and hybrid exchange-correlation functionals. In particular, we find that $\mathcal{O}$(200) grid points are sufficient to achieve an accuracy of 1 microhartree in the eigenvalues for optimized norm conserving Vanderbilt pseudopotentials spanning the periodic table from atomic number Ζ = 1 to 83.

74 ATOMIC AND MOLECULAR PHYSICS↗

On Bernstein type inequalities and a weighted Chebyshev approximation problem on ellipses

A classical inequality due to Bernstein which estimates the norm of polynomials on any given ellipse in terms of their norm on any smaller ellipse with the same foci is examined. For the uniform and a certain weighted uniform norm, and for the case that the two ellipses are not too close, sharp estimates of this type were derived and the corresponding extremal polynomials were determined. These Bernstein type inequalities are closely connected with certain constrained Chebyshev approximation problems on ellipses. Some new results were also presented for a weighted approximation problem of this type.

Freund, Roland↗

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

Asymptotic formulae for the zeros of orthogonal polynomials

Let p{sub n}(t) be an algebraic polynomial that is orthonormal with weight p(t) on the interval [-1, 1]. When p(t) is a perturbation (in certain limits) of the Chebyshev weight of the first kind, the zeros of the polynomial p{sub n}( cos {tau}) and the differences between pairs of (not necessarily consecutive) zeros are shown to satisfy asymptotic formulae as n{yields}{infinity}, which hold uniformly with respect to the indices of the zeros. Similar results are also obtained for perturbations of the Chebyshev weight of the second kind. First, some preliminary results on the asymptotic behaviour of the difference between two zeros of an orthogonal trigonometric polynomial, which are needed, are established. Bibliography: 15 titles.

97 MATHEMATICS AND COMPUTING↗

On the constrained Chebyshev approximation problem on ellipses

Constrained Chebyshev approximation problems of the type with minimum (p is an element of Pi(sub n):p(c)=1) and maximum (z is an element of E) with /p(z)/ are considered. Here Pi(sub n) denotes the set of all complex polynomials of degree at most n, E is any ellipse in the complex plane, and c is an element of C/E. Such approximation problems arise in the context of optimizing semi-iterative methods for the solution of large, sparse systems of linear equations Ax=b with complex non-Hermitian coefficient matrices A. The problem of obtaining optimal polynomial preconditioners for conjugate gradient type methods for Ax=b also leads to problems of this type. A new family of polynomials -- q(sub n)(z;c), n is an element of N, and c is an element of C/E -- are introduced as the polynomials which are optimal for a modified version of the Chebyshev approximation problem with Pi(sub n) replaced by a certain subfamily. Some simple properties of q(sub n) are also listed. A necessary and sufficient condition for q(sub n) to be the extremal polynomial for the approximation problem is then derived. Finally, it is shown that q(sub n) is indeed optimal for the problem for all fixed n whenever the distance between c and E is sufficiently large. Results of some numerical tests are presented.

Freund, Roland↗

A method for including external feed in depletion calculations with CRAM and implementation into ORIGEN

A method for including external feed with polynomial time dependence in depletion calculations with the Chebyshev Rational Approximation Method (CRAM) is presented and the implementation of CRAM to the ORIGEN module of the SCALE suite is described. In addition to being able to handle time-dependent feed rates, the new solver also adds the capability to perform adjoint calculations. Results obtained with the new CRAM solver and the original depletion solver of ORIGEN are compared to high precision reference calculations, which shows the new solver to be orders of magnitude more accurate. Lastly, in most cases, the new solver is up to several times faster due to not requiring similar substepping as the original one.

97 MATHEMATICS AND COMPUTING↗