相关论文: Chebyshev Expansions for Solutions of Linear Diffe…

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…

A recursion formula for derivatives of Chebyshev polynomials is replaced by an explicit formula.

Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…

We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…

We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…

Exponential divided differences arise in numerical linear algebra, matrix-function evaluation, and quantum Monte Carlo simulations, where they serve as kernel weights for time evolution and observable estimation. Efficient and numerically…

Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…

A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…

In this study linear and nonlinear higher order singularly perturbed problems are examined by a numerical approach, the differential quadrature method. Here, the main idea is using Chebyshev polynomials to acquire the weighting coefficient…

This paper considers functional series whose terms are higher-order derivatives of Chebyshev polynomials of the second kind, where the degree of the polynomial is related to the order of the derivative. Analytic summation is used to…

The Chebyshev expansion offers a numerically efficient and easy-implement algorithm for evaluating dynamic correlation functions using matrix product states (MPS). In this approach, each recursively generated Chebyshev vector is…

In this work, considering a general subclass of bi-univalent functions and using the Chebyshev polynomials, we obtain coefficient expansions for functions in this class.

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

In this paper, we investigate some properties of Chebyshev polynomials arising from non-linear differential equations. From our investigation, we derive some new and interesting identities on Chebyshev polynomials.

We provide a definition of Multidimensional Chebyshev Systems of order N which is satisfied by the solutions of a wide class of elliptic equations of order 2N. This definition generalizes a very large class of Extended Complete Chebyshev…

The even and odd Zernike Polynomials R_n^m(x) can be expanded into sums of even and odd Chebyshev Polynomials T_i(x). This manuscript provides closed forms for the rational expansion coefficients c_{n,m,i} for a set of small 0 <= n-m <= 6…

In this paper we demonstrate that a well known linear inequality method developed for rational Chebyshev approximation is equivalent to the application of the bisection method used in quasiconvex optimisation. Although this correspondence…

The analogy between the nth power function and the nth Chebyshev polynomial is pursued, leading to consideration of Chebyshev radicals as analogous to ordinary radicals and Chebyshev exponents to ordinary exponents, and the cosine and…

We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…