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...

The Powell singular function was introduced 1962 by M.J.D. Powell as an unconstrained optimization problem. The function is also used as nonlinear least squares problem and system of nonlinear equations. The function is a classic test function included in collections of test problems in optimization as well as an example problem in text books. In the global optimization literature the function ...

The wave equation for vectors and symmetric tensors in spherical coordinates is studied under the divergence-free constraint. We describe a numerical method, based on the spectral decomposition of vector/tensor components onto spherical harmonics, that allows for the evolution of only those scalar fields which correspond to the divergence-free degrees of freedom of the vector/tensor. The full v...

Pseudospectral methods are investigated for singularly perturbed boundary value problems for ordinary diierential equations which possess boundary layers. It is well known that if the boundary layer is very small then a very large number of spectral collocation points is required to obtain accurate solutions. We introduce here a new eeective procedure, based on coordinate stretching and the Che...

In [M.M. Hosseini, Adomian decomposition method with Chebyshev polynomials, Appl. Math. Comput., in press] an efficient modification of the Adomian decomposition method was presented by using Chebyshev polynomials. Also, in [M.M. Hosseini, Adomian decomposition method for solution of differential algebraic equations, J. Comput. Appl. Math., in press] solution of linear differential algebraic eq...

In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretization of linear parabolic PDEs, demonstrate that the Chebyshev method can be an effective alternative...