Results 101 to 110 of about 21,657 (246)
Проблемы анализа, 2020 In this paper, we give the generating functions of binary product between 2-orthogonal Chebyshev polynomials and kFibonacci, k-Pell, k-Jacobsthal numbers and the other orthogonal Chebyshev polynomials.
H. Merzouk, B. Aloui, A. Boussayoud
doaj +1 more source
ANPGT: Towards Adaptive Node Property Extraction and Integration
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Graph transformers (GTs) with elaborate positional/structural encodings (PEs/SEs) have excelled in graph representation learning, especially in graph‐level tasks. However, their potential in large‐scale node classification remains untapped for several reasons: (i) Current PEs/SEs are insufficient in modelling large‐scale real‐world graphs ...
Qin Chen +4 more
wiley +1 more source
Generalized Chebyshev polynomials
Discussiones Mathematicae - General Algebra and Applications, 2018 Summary: Let \(h(x)\) be a non constant polynomial with rational coefficients. Our aim is to introduce the \(h(x)\)-Chebyshev polynomials of the first and second kind \(T_n\) and \(U_n\). We show that they are in a \(\mathbb{Q}\)-vectorial subspace \(E_n(x)\) of \(\mathbb{Q}[x]\) of dimension \(n\). We establish that the polynomial sequences \((h^kT_{n-
Abchiche Mourad, Belbachir Hacéne
openaire +3 more sources
Extended Chebyshev spaces in rationality [PDF]
, 2013 International audienceOn a closed bounded interval, a given Extended Chebyshev space can be defined by means of generalised derivatives associated with systems of weight functions. Only recently we could identify all such systems, describing an iterative
Mazure, Marie-Laurence
core +1 more source
General convergence of the methods from Chebyshev-Halley family
Journal of Numerical Analysis and Approximation Theory, 2008 In this paper we study the Chebyshev-Halley family (which contains, as particular cases, the Chebyshev method, Halley method, super-Halley method and the C-method). For Chebyshev and super-Halley methods we give a global theorem of convergence.
Raluca Anamaria Pomian
doaj +2 more sources
Chebyshev Approximations by Least Squares Method
Известия Иркутского государственного университета: Серия "Математика", 2020 We consider the problem of linear approximation in the form of the minimization problem of the weighted Chebyshev norm, and that in the form of the minimization problem of the weighted Euclidean norm of the residual vector.
V.I. Zorkaltsev, E. V. Gubiy
doaj +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
Computer Graphics Forum, EarlyView.Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid +4 more
wiley +1 more source
A note on some extremal problems for trigonometric polynomials [PDF]
n.a.
Dette, Holger, Melas, Viatcheslav B.
core
Lines on the surface in the quasi-hiperbolic space 11^S1/3
Дифференциальная геометрия многообразий фигур, 2020 Quasi-hyperbolic spaces are projective spaces with decaying absolute. This work is a continuation of the author's work [7], in which surfaces in one of these spaces are examined by methods of external forms and a moving frame.
V.B. Tsyrenova
doaj +1 more source
Parallel Vectors Extraction using Bézier Clipping
Computer Graphics Forum, EarlyView.Abstract In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing‐based root finding method that is commonly‐used in computer‐aided geometric design.
Nico Daßler, Tobias Günther
wiley +1 more source