chebyshev nodes
Recently Published Documents


TOTAL DOCUMENTS

52
(FIVE YEARS 10)

H-INDEX

7
(FIVE YEARS 1)

2021 ◽  
Vol 166 ◽  
pp. 272-287
Author(s):  
Donatella Occorsio ◽  
Woula Themistoclakis

Author(s):  
Ali IBRAHIMOGLU

Polynomial interpolation with equidistant nodes is notoriously unreliable due to the Runge phenomenon, and is also numerically ill-conditioned. By taking advantage of the optimality of the interpolation processes on Chebyshev nodes, one of the best strategies to defeat the Runge phenomenon is to use the mock-Chebyshev points, which are selected from a satisfactory uniform grid, for polynomial interpolation. Yet, little literature exists on the computation of these points. In this study, we investigate the properties of the mock-Chebyshev nodes and propose a subsetting method for constructing mock-Chebyshev grids. Moreover, we provide a precise formula for the cardinality of a satisfactory uniform grid. Some numerical experiments using the points obtained by the method are given to show the effectiveness of the proposed method and numerical results are also provided.


2021 ◽  
pp. 39-53
Author(s):  
Mama Foupouagnigni ◽  
Daniel Duviol Tcheutia ◽  
Wolfram Koepf ◽  
Kingsley Njem Forwa
Keyword(s):  

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 751
Author(s):  
Jiří Hrivnák ◽  
Jiří Patera ◽  
Marzena Szajewska

We develop discrete orthogonality relations on the finite sets of the generalized Chebyshev nodes related to the root systems A 2 , C 2 and G 2 . The orthogonality relations are consequences of orthogonality of four types of Weyl orbit functions on the fragments of the dual weight lattices. A uniform recursive construction of the polynomials as well as explicit presentation of all data needed for the discrete orthogonality relations allow practical implementation of the related Fourier methods. The polynomial interpolation method is developed and exemplified.


2019 ◽  
Vol 9 (2) ◽  
pp. 471-480 ◽  
Author(s):  
Y. H. Youssri ◽  
R. M. Hafez

Abstract This work reports a collocation algorithm for the numerical solution of a Volterra–Fredholm integral equation (V-FIE), using shifted Chebyshev collocation (SCC) method. Some properties of the shifted Chebyshev polynomials are presented. These properties together with the shifted Gauss–Chebyshev nodes were then used to reduce the Volterra–Fredholm integral equation to the solution of a matrix equation. Nextly, the error analysis of the proposed method is presented. We compared the results of this algorithm with others and showed the accuracy and potential applicability of the given method.


Sign in / Sign up

Export Citation Format

Share Document