The 1669-1670 Newton-Raphson’s method is still used to solve equations systems and unconstrained optimization problems. Since this method, some other algorithms inspired by Newton’s have been proposed: in 1839 Chebyshev developped a high order cubical convergence algorithm, and in 1967 Shamanskii proposed an acceleration of Newton’s method. By considering a Newton-type methods as displacement d...

in this paper, a chebyshev finite difference method has been proposed in order to solvenonlinear two-point boundary value problems for second order nonlinear differentialequations. a problem arising from chemical reactor theory is then considered. the approachconsists of reducing the problem to a set of algebraic equations. this method can be regardedas a non-uniform finite difference scheme. t...

in this paper a modification of he's variational iteration method (vim) has been employed to solve dung and riccati equations. sometimes, it is not easy or even impossible, to obtain the first few iterations of vim, therefore, we suggest to approximate the integrand by using suitable expansions such as taylor or chebyshev expansions.

In this paper, we present the constrained Jacobi polynomial which is equal to the constrained Chebyshev polynomial up to constant multiplication. For degree n = 4, 5, we find the constrained Jacobi polynomial, and for n ≥ 6, we present the normalized constrained Jacobi polynomial which is similar to the constrained Chebyshev polynomial.

While the Chebyshev pseudospectral method provides a spectrally accurate method, integration of partial differential equations with spatial derivatives of order M requires time steps of approximately O(N−2M ) for stable explicit solvers. Theoretically, time steps may be increased to O(N−M ) with the use of a parameter, α-dependent mapped method introduced by Kosloff and Tal-Ezer [J. Comput. Phy...

A numerical method for Riccati equation is presented in this work. The method is based on the replacement of unknown functions through a truncated series of hybrid of block-pulse functions and Chebyshev polynomials. The operational matrices of derivative and product of hybrid functions are presented. These matrices together with the tau method are then utilized to transform the differential equ...

In this paper, we consider Chebyshev–Legendre Pseudo-Spectral (CLPS) method for solving coupled viscous Burgers (VB) equations. A leapfrog scheme is used in time direction, while CLPS method is used for space direction. Chebyshev–Gauss–Lobatto (CGL) nodes are used for practical computation. The error estimates of semi-discrete and fully-discrete of CLPS method for coupled VB equations are obtai...