Results 181 to 190 of about 16,329 (217)

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 ...
null Janez Jeraj, null V. John Mathews
openaire   +1 more source

Preconditioning on high-order element methods using Chebyshev–Gauss–Lobatto nodes

Applied Numerical Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Seonhee, Kim, Sang Dong
openaire   +2 more sources

A fast algorithm for computing the mock-Chebyshev nodes

Journal of Computational and Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

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

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

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

A new fast algorithm for computing the mock-Chebyshev nodes

Applied Numerical Mathematics
Mock-Chebyshev points on an interval is a set of points asymptotically distributed like the Chebyshev weight of the first kind and therefore are better suited for polynomial interpolation since they result in a smaller Lebesgue constant. In a previous paper, [J. Comput. Appl. Math. 373, Article ID 112336, 9 p.
openaire   +2 more sources

Bearing fault diagnosis based on EMD and improved Chebyshev distance in SDP image

Measurement: Journal of the International Measurement Confederation, 2021
Yongjian Sun
exaly  

Hundred Point Langrange Interpolation Coefficients for Chebyshev Nodes

Mathematics of Computation, 1976
Herbert E. Salzer, Norman Levine, Saul Serben   +2 more
openaire   +1 more source

Comparison of Sequence of Physical Processes (SPP) and Fourier Transform Coupled with Chebyshev Polynomials (FTC) methods to Interpret Large Amplitude Oscillatory Shear (LAOS) Response of Viscoelastic Doughs and Viscous Pectin Solution

Food Hydrocolloids, 2022
Merve Yildirim Erturk, Simon A Rogers, Jozef L Kokini   +2 more
exaly