In this paper we study the number of limit cycles bifurcating from isochronous surfaces of revolution contained in R, when we consider polynomial perturbations of arbitrary degree. The method for studying these limit cycles is based in the averaging theory and in the properties of Chebyshev systems. We present a new result on averaging theory and generalitzations of some classical Chebyshev sys...

Semiiterative methods are known as a powerful tool for the iterative solution of nonsingular linear systems of equations. For singular but consistent linear systems with coefficient matrix of index one, one can still apply the methods designed for the nonsingular case. However, if the system is inconsistent, the approximations usually fail to converge. Nevertheless, it is still possible to modi...

In this paper, we present a parallel quasi-Chebyshev acceleration applied to the nonoverlapping multisplitting iterative method for the linear systems when the coefficient matrix is either an H-matrix or a symmetric positive definite matrix. First, m parallel iterations are implemented in m different processors. Second, based on l1-norm or l2-norm, the m optimization models are parallelly treat...

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, we introduce a generalized Chebyshev collocation method (GCCM) based on the generalized Chebyshev polynomials for solving stiff systems. For employing a technique of the embedded Runge-Kutta method used in explicit schemes, the property of the generalized Chebyshev polynomials is used, in which the nodes for the higher degree polynomial are overlapped with those for the lower deg...

This pa per suggests a simple valuation method based on Chebyshev approximation at Chebyshev nodes to value American put options. It is similar to the approach taken in Sullivan (2000), where the option`s continuation region function is estimated by using a Chebyshev polynomial. However, in contrast to Sullivan (2000), the functional is fitted by using Chebyshev nodes. The suggested method is f...