Results 161 to 170 of about 1,315 (192)
Some of the next articles are maybe not open access.
Uniform weighted approximation on the square by polynomial interpolation at Chebyshev nodes
Applied Mathematics and Computation, 2020The paper deals with de la Vallee Poussin type interpolation on the square at tensor product Chebyshev zeros of the first kind. The approximation is studied in the space of locally continuous functions with possible algebraic singularities on the boundary, equipped with weighted uniform norms.
Donatella Occorsio +2 more
openaire +4 more sources
Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes
Numerical Algorithms, 2018The polynomial interpolation problem with distinct interpolation points and the polynomial represented in the power basis gives rise to a linear system of equations with a Vandermonde matrix. This system can be solved efficiently by exploiting the structure of the Vandermonde matrix with the aid of the Bjorck–Peyrera algorithm.
Mykhailo Kuian +2 more
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., 2006The 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 ...
J. Jeraj, V.J. Mathews
openaire +2 more sources
Generalization of Polynomial Interpolation at Chebyshev Nodes
2011Previously, 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 +2 more sources
On the asymptotic constant for the rate of Hermite–Fejér convergence on Chebyshev nodes
Acta Mathematica Hungarica, 2015We obtain the asymptotic constant for the error of Hermite–Fejer interpolants based on Chebyshev nodes when we interpolate polynomials or analytic functions.
Alicia Cachafeiro, Elías Berriochoa
openaire +2 more sources
The optimal 3-node preconditioner of the Fourier and Chebyshev spectral operators
Journal of Computational Physics, 2011It is shown in [G. Labrosse, The piecewise-linear Finite Volume scheme: the best known lowest-order preconditioner for the d^2dx^2 Chebyshev spectral operator, J. Comput. Phys. 228 (2009) 4491-4509] that the piecewise-linear Finite Volume (FV) approximation is the best preconditioner of the L[u]=d^2udx^2=f Fourier and Chebyshev solvers compared to the ...
G. Labrosse, A. Redondo
openaire +2 more sources
Hermite interpolation on Chebyshev nodes and Walsh equiconvergence. II
1998For \(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 MathematicsInterpolation by polynomials on equispaced points is not always convergent due to the Runge phenomenon, and also, the interpolation process is exponentially ill-conditioned. By taking advantage of the optimality of the interpolation processes on the Chebyshev-Lobatto nodes, one of the best strategies to defeat the Runge phenomenon is to use the mock ...
openaire +2 more sources
Bearing fault diagnosis based on EMD and improved Chebyshev distance in SDP image
Measurement: Journal of the International Measurement Confederation, 2021Yongjian Sun
exaly