Massive coalescence of nodes in optimal Chebyshev-type quadrature on [−1,1]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Korevaar, J.L.H. Meyers
openalex +4 more sources
The main result of the present article is the non-negativity on \([-1,1]\) of the fundamental polynomials for \((0,1, \dots , 2m+1)\) Hermite-Fejér interpolation on the zeros of the Chebyshev polynomials of the first kind. Using this result and Korovkin's theorem, a new proof of the uniform convergence of the corresponding interpolation polynomials is ...
Simon J. Smith
openalex +4 more sources
A numerical approach to fractional Volterra–Fredholm integro-differential problems using shifted Chebyshev spectral collocation [PDF]
This study presents an innovative numerical framework for addressing initial value problems (IVPs) in linear fractional Volterra–Fredholm integro-differential equations (FVFIDEs).
Maha M. Hamood +2 more
doaj +2 more sources
Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
AbstractIn this paper we propose an explicit solution to the polynomial least squares approximation problem on Chebyshev extrema nodes. We also show that the inverse of the normal matrix on this set of nodes can be represented as the sum of two symmetric matrices: a full rank matrix which admits a Cholesky factorization and a 2-rank matrix.
A. Eisinberg, Giuseppe Fedele
openalex +4 more sources
Lebesgue constants for polyhedral sets and polynomial interpolation on Lissajous–Chebyshev nodes
29 pages, 1 ...
Peter Dencker +3 more
openalex +4 more sources
A unifying theory for multivariate polynomial interpolation on general Lissajous-Chebyshev nodes
The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a single unified theory.
Peter Dencker, Wolfgang Erb
openalex +4 more sources
On Berman's phenomenon for (0,1,2) Hermite-Fejér interpolation
Given \(f\in C[-1,1]\) and \(n\) points (nodes) in \([-1,1]\), the Hermite-Fejer interpolation (HFI) polynomial is the polynomial of degree at most \(2n-1\) which agrees with \(f\) and has zero derivative at each of the nodes. In 1916, L.
Graeme J Byrne, Simon Jeffrey Smith
doaj +7 more sources
Function correction and Lagrange – Jacobi type interpolation [PDF]
It is well-known that the Lagrange interpolation based on the Chebyshev nodes may be divergent everywhere (for arbitrary nodes, almost everywhere), like the Fourier series of a summable function.
Novikov, Vladimir Vasil’evich
doaj +1 more source
Chebyshev Interpolation Using Almost Equally Spaced Points and Applications in Emission Tomography
Since their introduction, Chebyshev polynomials of the first kind have been extensively investigated, especially in the context of approximation and interpolation.
Vangelis Marinakis +3 more
doaj +1 more source
Dynamic multi‐objective optimisation of complex networks based on evolutionary computation
Abstract As the problems concerning the number of information to be optimised is increasing, the optimisation level is getting higher, the target information is more diversified, and the algorithms are becoming more complex; the traditional algorithms such as particle swarm and differential evolution are far from being able to deal with this situation ...
Linfeng Huang
wiley +1 more source

