Results 41 to 50 of about 3,674,543 (358)
On fourth-order jacobsthal quaternions
Journal of Mathematical Sciences and Modelling, 2018 In this paper, we present for the first time a sequence of quaternions of order 4 that we will call the fourth-order Jacobsthal and the fourth-order Jacobsthal-Lucas quaternions. In particular, we are interested in the generating function, Binet formula,
Gamaliel Cerda-morales
doaj +1 more source
Fibonacci and Lucas Polynomials in n-gon
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 In this paper, we bring into light, study the polygonal structure of Fibonacci polynomials that are placed clockwise on these by a number corresponding to each vertex. Also, we find the relation between the numbers with such vertices.
Kuloğlu Bahar +2 more
doaj +1 more source
Orthogonal polynomials of dimension –1 in the non-definite case [PDF]
Rendiconti di Matematica e delle Sue Applicazioni, 1994 : Orthogonal polynomials of dimension d = −1 are a particular case of vector orthogonal polynomials which are, themselves, a particular case of biorthogonal polynomials.
C. BREZINSKI , M. REDIVO-ZAGLIA
doaj
Probabilistic recurrence relations revisited
Theoretical Computer Science, 1995 AbstractThe performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x) + T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x.
Chaudhuri, S., Dubhashi, D.
openaire +5 more sources
Two Nice Determinantal Expressions and A Recurrence Relation for the Apostol--Bernoulli Polynomials
, 2017 In the paper, the authors establish two nice determinantal expressions and a recurrence relation for the Apostol--Bernoulli polynomials.
Feng Qi (祁锋), Bai-Ni Guo (郭白妮)
semanticscholar +1 more source
Computing recurrence coefficients of multiple orthogonal polynomials
, 2015 Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a $(r+2)$-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence relation) and
Filipuk, Galina +2 more
core +1 more source
Fast calculation of computer-generated hologram using run-length encoding based recurrence relation.
Optics Express, 2015 Computer-Generated Holograms (CGHs) can be generated by superimposing zoneplates. A zoneplate is a grating that can concentrate an incident light into a point.
Takashi Nishitsuji +3 more
semanticscholar +1 more source
Complexity of Some Duplicating Networks
IEEE Access, 2021 There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source
A Determinantal Expression and a Recurrence Relation for the Euler Polynomials
, 2016 In the paper, by a very simple approach, the author establishes an expression in terms of a lower Hessenberg determinant for the Euler polynomials. By the determinantal expression, the author finds a recurrence relation for the Euler polynomials.
Feng Qi (祁锋), Bai-Ni Guo (郭白妮)
semanticscholar +1 more source
Semilocal convergence analysis of an eighth order iterative method for solving nonlinear systems
AIMS Mathematics, 2023 In this paper, the semilocal convergence of the eighth order iterative method is proved in Banach space by using the recursive relation, and the proof process does not need high order derivative.
Xiaofeng Wang, Yufan Yang, Yuping Qin
doaj +1 more source