Results 101 to 110 of about 183 (122)

On the Integral of the Lebesgue Function Induced by Interpolation at the Chebyshev Nodes

Acta Mathematica Hungarica, 2001
Let \(X=\{x_k=x_{kn}:k=1,2,\dots,n,n=1,2,3,\dots\}\) be a triangular array of nodes such that for each \(n\), \(-1\leq ...
Brutman, L., Gopengauz, I., Toledano, D.
openaire   +2 more sources

Identification of Nonlinear, Memoryless Systems Using Chebyshev Nodes

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006
The paper describes an approach for the identification of static nonlinearities from input-output measurements. The approach is based on a minimax approximation of memoryless nonlinear systems using Chebyshev polynomials. For memoryless nonlinear systems that are finite and continuous with finite derivatives, it is known that the error caused by the ...
Janez Jeraj, V. John Mathews
openaire   +1 more source

Generalization of Polynomial Interpolation at Chebyshev Nodes

2011
Previously, we generalized the Lagrange polynomial interpolation at Chebyshev nodes and studied the Lagrange polynomial interpolation at a special class of sets of nodes. This special class includes some well-known sets of nodes, such as zeros of the Chebyshev polynomials of first and second kinds, Chebyshev extrema, and equidistant nodes.
openaire   +1 more source

Hermite interpolation on Chebyshev nodes and Walsh equiconvergence. II

1998
For \(R>1\) let \(E_R\) be the ellipse with foci at \(\pm 1\) and axes \(R\pm 1/R\). The authors consider Hermite interpolation at the zeroes of the Chebyshev polynomials \(T_m(z)\) for functions \(f\) analytic in \(E_R\). In the first part of the paper [\textit{A. Jakimovski} and \textit{A. Sharma}, Pure Appl.
Jakimovski, A., Sharma, A.
openaire   +2 more sources

The Lebesgue function for Lagrange interpolation on the augmented Chebyshev nodes

Publicationes Mathematicae Debrecen, 2005
Summary: Given \(f\in C[-1,1]\) and \(n\) points (nodes) in \([-1,1]\), the well-known Lagrange interpolation polynomial is the polynomial of minimum degree which agrees with \(f\) at each of the nodes. Properties of the Lebesgue function and Lebesgue constant associated with Lagrange interpolation on the Chebyshev nodes (the zeros of the \(n\)th ...
openaire   +1 more source

Limitations of Chebyshev interpolation nodes : Counter examples and Insights

Journal of Interdisciplinary Mathematics
Interpolation using uniformly spaced nodes often encounters Runge’s phenomenon when applied to smooth functions. To mitigate this issue, Chebyshev roots are frequently recommended as better interpolation nodes. However, our study reveals the limitations of Chebyshev roots for interpolation by presenting a series of counterexamples.
Imane El-Malki, Mounia Alaoui, Hanaa Mtai, Amine Laghrib   +3 more
openaire   +1 more source

Generalizations of the constrained mock-Chebyshev least squares in two variables: Tensor product vs total degree polynomial interpolation

Applied Mathematics Letters, 2022
Filomena Di Tommaso, Francesco Dell'Accio, Federico Nudo   +2 more
exaly  

A new collocation method using near-minimal Chebyshev quadrature nodes on a square

Applied Numerical Mathematics, 2020
Huiyuan Li
exaly  

A new approach for constructing mock‐Chebyshev grids

Mathematical Methods in the Applied Sciences, 2021
B Ali Ibrahimoglu
exaly  

306 The MCV scheme with Chebyshev node collocation

The Proceedings of The Computational Mechanics Conference, 2009
Feng XIAO, Satoshi Ii
openaire   +1 more source