We analyze the Legendre and Chebyshev spectral Galerkin semidiscretizations of a one dimensional homogeneous parabolic problem with nonconstant coefficients. We present error estimates for both smooth and nonsmooth data. In the Chebyshev case a limit in the order of approximation is established. On the contrary, in the Legendre case we find an arbitrary high order of convegence.

Through a geometncal approach of the blossoming pnnciple, we achieve a dimension élévation process for extended Chebyshev spaces Applied to a nested séquence ofsuch spaces included in a polynomial one, this allows to compute the Bézier points from the initial Chebyshev-Bézier points This method leads to interesting shape effects © Elsevier, Paris

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.

This paper is concerned with the problem of nonlinear simultaneous Chebyshev approximation in a real continuous function space. Some results on existence are established, in addition to characterization conditions of Kolmogorov type and also of alternation type. Applications are given to approximation by rational functions, by exponential sums and by Chebyshev splines with free knots.  2003 El...

This paper concerns the iterative solution of the linear system arising from the Chebyshev–collocation approximation of second-order elliptic equations and presents an optimal multigrid preconditioner based on alternating line Gauss–Seidel smoothers for the corresponding stiffness matrix of bilinear finite elements on the Chebyshev–Gauss–Lobatto grid.  2000 IMACS. Published by Elsevier Science...

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

Analytical solutions of integral equations, either do not exist or are hard to find. Due to this, many numerical methods have been developed for finding the solutions of integral equations. The use of wavelets has come to prominence during the last two decades. Wavelets can be used as analytical tools for signal processing, numerical analysis and mathematical modeling. The early works concernin...

Quaternion non-local means (QNLM) denoising algorithm makes full use of high degree self-similarities inside images to suppress the noise, so similarity metric plays a key role in its performance. In this study, two improvements have been made for QNLM: 1) For low level quaternion quasi-Chebyshev distance is proposed measure image patches and it has used replace Euclidean QNLM algorithm. Since ...

The usual way to determine the asymptotic behavior of the Chebyshev coefficients for a function is to apply the method of steepest descent to the integral representation of the coefficients. However, the procedure is usually laborious. We prove an asymptotic upper bound on the Chebyshev coefficients for the kth integral of a function. The tightness of this upper bound is then analyzed for the c...

We consider the evaluation of a recent generalization of the Epstein-Hubbell elliptic-type integral using the tau method approximation with a Chebyshev polynomial basis. This also leads to an approximation of Lauricella’s hypergeometric function of three variables. Numerical results are given for polynomial approximations of degree 6.