Results 81 to 90 of about 183 (122)
Gaussian quadrature rules are commonly used to approximate integrals with respect to a non-negative measure dσ^. It is important to be able to estimate the quadrature error in the Gaussian rule used.
Dušan Lj. Djukić +5 more
doaj +1 more source
The shifted Jacobi-Gauss-Lobatto pseudospectral (SJGLP) method is applied to neutral functional-differential equations (NFDEs) with proportional delays.
A. H. Bhrawy, M. A. Alghamdi, D. Baleanu
doaj +1 more source
The paper proposes a matrix implementation of the collocation method for constructing a solution to Volterra integral equations of the second kind using systems of orthogonal Chebyshev polynomials of the first kind and Legendre polynomials. The integrand
O.V. Germider, V. N. Popov
doaj +1 more source
For a fixed integer and , let denote the th fundamental polynomial for Hermite–Fejér interpolation on the Chebyshev nodes . (So is the unique polynomial of degree at most which satisfies , and whose first derivatives vanish at each ...
Smith Simon J
doaj
A spatiotemporal chebyshev graph attention network model for sea surface salinity prediction
Fluctuations in sea surface salinity (SSS) have significant impacts on marine ecosystems and global climate change. However, most existing SSS prediction models predominantly emphasized temporal dependencies while insufficiently accounting for spatial ...
Yingbing Liu +6 more
doaj +1 more source
Enabling Space-Air integration: A Satellite-UAV networking authentication scheme
One of the goals of sixth-generation mobile networks (6G) is to achieve a larger network coverage area. Satellite networks enable global coverage and aerial nodes such as Unmanned Aerial Vehicle (UAV) can serve as a supplement to ground networks in ...
Li Sheng, Cao Jin, Shi Xiaoping, Li Hui
doaj +1 more source
Robot path planning based on obstacle avoidance optimization and improved ant colony algorithm
Aimed at the problems of slow convergence speed and redundant planning paths in the processing of path planning by ant colony algorithm, an improved ant colony algorithm based on obstacle avoidance information and fast optimization search strategy was ...
HE Xingshi, CHEN Huiyuan
doaj +1 more source
On some examples and counterexamples of the Runge phenomena and Chebyshev nodes
Runge's phenomenon appears in the interpolation process using uniformly placed nodes for some smooth function. An effective solution to this problem is the use of Chebychev roots as interpolation nodes. In this paper, we discuss the efficiency of these nodes and give many illustrated counterexamples of some differentiable and non-differentiable ...
Amine Laghrib +3 more
openaire +1 more source
The minimal number of nodes in Chebyshev type quadrature formulas
The authors abstract is accurate: We study Chebyshev type quadrature formulas of degree \(n\) with respect to a weight function on \(\langle - 1,+1 \rangle\), i.e. formulas \[ {1 \over {\int_{-1}^{+1} w(t)dt}}\cdot \int_{-1}^{+1} f(t) w(t) dt={1\over N} \sum_{i=1}^ N f(x_ i)+ R(f) \] with nodes \(x_ i\in \langle -1,+1\rangle\) such that \(R(f)=0\) for ...
openaire +2 more sources
Non-local fractional boundary value problems with applications to predator-prey models
Michal Feckan, Kateryna Marynets
doaj

