In the field of digital signal processing, the function of a filter is to remove unwanted parts of the signal such as random noise that is also undesirable. To remove noise from the speech signal transmission or to extract useful parts of the signal such as the components lying within a certain frequency range. Filters are broadly used in signal processing and communication systems in applicati...

This is the second part in a series of papers on using spectral sparse grid methods for solving higher-dimensional PDEs. We extend the basic idea in the first part [18] for solving PDEs in bounded higher-dimensional domains to unbounded higher-dimensional domains, and apply the new method to solve the electronic Schrödinger equation. By using modified mapped Chebyshev functions as basis functio...

By applying hybrid functions of general block-pulse functions and the second Chebyshev polynomials, integrodifferential systems are converted into a system of algebraic equations. The approximate solutions of integrodifferential systems are derived. The numerical examples illustrate that the algorithms are valid.

A Chebyshev knot C(a, b, c, φ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + φ), where a, b, c are integers, Tn(t) is the Chebyshev polynomial of degree n and φ ∈ R. We show that any two-bridge knot is a Chebyshev knot with a = 3 and also with a = 4. For every a, b, c integers (a = 3, 4 and a, b coprime), we describe an algorithm that gives all Cheb...

A new class of time-integrators is presented for strongly nonlinear dynamical systems. These algorithms are far superior to the currently common time integrators in computational efficiency and accuracy. These three algorithms are based on a local variational iteration method applied over a finite interval of time. By using Chebyshev polynomials as trial functions andDirac–Delta functions as th...

The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known propertie...

a computational method for numerical solution of a nonlinear volterra and fredholm integro-differentialequations of fractional order based on chebyshev cardinal functions is introduced. the chebyshev cardinaloperational matrix of fractional derivative is derived and used to transform the main equation to a system ofalgebraic equations. some examples are included to demonstrate the validity and ...

in this note, we characterize chebyshev subalgebras of unital jb-algebras. we exhibit that if b is chebyshev subalgebra of a unital jb-algebra a, then either b is a trivial subalgebra of a or a= h r .l, where h is a hilbert space

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...