The Chebyshev finite difference method is applied to solve a system of two coupled nonlinear Lane-Emden differential equations arising in mathematical modelling of the excess sludge production from wastewater treatment plants. This method is based on a combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The approach consists of reducing the ...

In this manuscript, a numerical technique is presented for finding the eigenvalues of the regular Sturm-Liouville problems. The Chebyshev cardinal functions are used to approximate the eigenvalues of a regular Sturm-Liouville problem with Dirichlet boundary conditions. These functions defined by the Chebyshev function of the first kind. By using the operational matrix of derivative the problem ...

Let X be a non-reflexive real Banach space. Then for each norm | · | from a dense set of equivalent norms on X (in the metric of uniform convergence on the unit ball of X), there exists a three-point set that has no Chebyshev center in (X, | · |). This result strengthens theorems by Davis and Johnson, van Dulst and Singer, and Konyagin.

A system identification methodology based on Chebyshev spectral operators and an orthogonal system reduction algorithm is proposed, leading to a new approach for data-driven modeling of nonlinear spatiotemporal systems on nonperiodic domains. A continuous model structure is devised allowing for terms of arbitrary derivative order and nonlinearity degree. Chebyshev spectral operators are introdu...

This note presents a Markov-type inequality for polynomials in two variables where the Chebyshev polynomials of the second kind in either one of the variables are extremal. We assume a bound on a polynomial at the set of even or odd Chebyshev nodes with the boundary nodes omitted and obtain bounds on its even or odd order directional derivatives in a critical direction. Previously, the author h...

The kth Markoff-Duffin-Schaeffer inequality provides a bound for the maximum, over the interval -1 </= x </= 1, of the kth derivative of a normalized polynomial of degree n. The bound is the corresponding maximum of the Chebyshev polynomial of degree n, T = cos(n cos(-1)x). The requisite normalization is over the values of the polynomial at the n + 1 points where T achieves its extremal values....

In this paper, we propose to replace the Chebyshev series used in pseudospectral methods with the equivalent Chebyshev economized power series that can be evaluated more rapidly. We keep the rest of the implementation the same as the spectral method so that there is no new mathematical principle involved. We show by numerical examples that the new approach works well and there is indeed no sign...

This paper discusses a design of nonlinear observer by a formal linearization method using an application of Chebyshev Interpolation in order to facilitate processes for synthesizing a nonlinear observer and to improve the precision of linearization. A dynamic nonlinear system is linearized with respect to a linearization function, and a measurement equation is transformed into an augmented lin...

It is a well known fact that the generalized Vandermonde determinant can be expressed as the product of the standard Vandermonde determinant and a polynomial with nonnegative integer coefficients. In this paper we generalize this result to Vandermonde determinants over the Chebyshev basis. We apply this result to prove that the number of real roots in [1;1] of a real polynomial is bounded by th...

Large, sparse nonsymmetric systems of linear equations with a matrix whose eigenvalues lie in the right half plane may be solved by an iterative method based on Chebyshev polynomials for an interval in the complex plane. Knowledge of the convex hull of the spectrum of the matrix is required in order to choose parameters upon which the iteration depends. Adaptive Chebyshev algorithms , in which ...