Results 91 to 100 of about 1,315 (192)
Design of Micro-strip Symmetrical Dual-band Filter Based on Wireless Sensor Network Nodes
The micro-strip antenna filter design of wireless sensor network nodes is usually used to improve the out-of-band suppression and frequency selectivity by increasing the order of the filters, but the filters are usually single band, not only the size is ...
Wenbo Cheng, Kai Deng, Wei Cheng
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
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
New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
Let \(A=\{\cos((2k+1)/(2n+2))\pi \}_{k=0,\ldots,n}\), the author proves the following results: interpolation to a polynomial of a degree at most \(n\) on the node set \(A\) can be performed by using \(O(n\log n)\) arithmetic operations; a polynomial of degree at most \(n\) can be evaluated on the node set \(A\) at the cost of \(O(n\log n)\) arithmetic ...
openaire +2 more sources
On the filtered polynomial interpolation at Chebyshev nodes
Donatella Occorsio, Woula Themistoclakis
openalex +2 more sources
For a fixed integer \(m\geq 0\) and \(1\leq K\leq n\), let \(A_{k,2m,n} (T,x)\) denote the \(k\)th fundamental polynomial for \((0,1, \dots, 2m)\) Hermite-Fejér interpolation on the Chebyshev nodes \(\{x_{j,n}= \cos[(2j-1)\pi/ (2n)]\): \(1\leq j\leq n\}\). So \(A_{k,2m,n} (T,x)\) is the unique polynomial of degree at most \((2m+1)n-1\) which satisfies \
openaire +2 more sources
Electronic Moment Tensor Potentials include both electronic and vibrational degrees of freedom
We present the electronic moment tensor potentials (eMTPs), a class of machine-learning interatomic models and a generalization of the classical MTPs, reproducing both the electronic and vibrational degrees of freedom, up to the accuracy of ab initio ...
Prashanth Srinivasan +3 more
doaj +1 more source
Matrix method and the suppression of Runge's phenomenon
Higher-degree polynomial interpolations carried out on uniformly distributed nodes are often plagued by overfitting, known as Runge's phenomenon. This work investigates Runge's phenomenon and its suppression in various versions of the matrix method for ...
Shui-Fa Shen, Wei-Liang Qian, Jie Zhang, Yu Pan, Yu-Peng Yan, Cheng-Gang Shao
doaj +1 more source

