Some properties of near-Toeplitz tridiagonal matrices with specific perturbations in the first and last main diagonal entries are considered. Applying the relation between the determinant and Chebyshev polynomial of the second kind, we first give the explicit expressions of determinant and characteristic polynomial, then eigenvalues are shown by finding the roots of the characteristic polynomia...

In this paper, a Chebyshev spectral collocation domain decomposition (DD) semidiscretization by using a grid mapping, derived by Kosloff and Tal-Ezer in space is applied to the numerical solution of the generalized Burger’s–Huxley (GBH) equation. To reduce roundoff error in computing derivatives we use the above mentioned grid mapping. In this work, we compose the Chebyshev spectral collocation...

Abstract—In Digital Signal Processing, one of the most important filter type is the FIR filter which can be designed via various methods. Window technique is the most important technique that is used to design the FIR filter. Apart from various window techniques, Dolph-Chebyshev window has the subject of importance for the design of the FIR filter in efficient way. In this paper, the design met...

In this paper‎, two inverse problems of determining an unknown source term in a parabolic‎ equation are considered‎. ‎First‎, ‎the unknown source term is ‎estimated in the form of a combination of Chebyshev functions‎. ‎Then‎, ‎a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem‎. ‎For solving the problem‎, ‎the operational matrices of int...

The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...

In this paper, we introduce a family of fractional-order Chebyshev functions based on the classical Chebyshev polynomials. We calculate and derive the operational matrix of derivative of fractional order γ in the Caputo sense using the fractional-order Chebyshev functions. This matrix yields to low computational cost of numerical solution of fractional order differential equations to the soluti...

ECG (Electrocardiogram) signals originating from heart muscles, generate massive volume of digital data. They need to be compressed or approximated for efficient transmission and storage. ECG signal compression is traditionally performed in three ways: direct, transform and parameter extraction. Polynomial approximation which is a form of parameter extraction method, is employed here. This pape...

An acceleration scheme based on stationary iterativemethods is presented for solving linear system of equations. Unlike Chebyshev semi-iterative method which requires accurate estimation of the bounds for iterative matrix eigenvalues, we use a wide range of Chebyshev-like polynomials for the accelerating process without estimating the bounds of the iterative matrix. A detailed error analysis is...

In this paper, we show the application of Chebyshev structure proposed by McClellan and Chan for design of three-dimensional (3-D) filters based on the McClellan transformation. We consider the implementation of 3-D FIR cone-shaped filters designed recently by Mollova and Mecklenbräuker. The Chebyshev structure is originally developed for 2-D digital filters designed by transformation method, b...

We study the rate-distortion relationship in the set of permutations endowed with the Kendall τ-metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall τ-metric we provide bounds for small, medium,...