Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Lavault, Christian"'
Integral representations and asymptotic behaviour of a Mittag-Leffler type function of two variables
Autor:
Lavault, Christian
Publikováno v:
Adv. Oper. Theory, Tusi Mathematical Research Group, A Para\^itre, 3 (2), pp.40--48
Integral representations play a prominent role in the analysis of entire functions. The representations of generalized Mittag-Leffler type functions and their asymptotics have been (and still are) investigated by plenty of authors in various conditio
Externí odkaz:
http://arxiv.org/abs/1710.10839
Integral representations and asymptotic behaviours of Mittag-Leffler type functions of two variables
Autor:
Lavault, Christian
The paper explores various special functions which generalize the two-parametric Mittag-Leffler type function of two variables. Integral representations for these functions in different domains of variation of arguments for certain values of the para
Externí odkaz:
http://arxiv.org/abs/1705.05562
Autor:
Lavault, Christian
In this paper, the generalized fractional integral operators of two generalized Mittag-Leffler type functions are investigated. The special cases of interest involve the generalized Fox--Wright function and the generalized M-series and K-function. In
Externí odkaz:
http://arxiv.org/abs/1703.01912
Autor:
Goodenough, Silvia, Lavault, Christian
In a first part, we are concerned with the relationships between polynomials in the two generators of the algebra of Heisenberg--Weyl, its Bargmann--Fock representation with differential operators and the associated one-parameter group.Upon this basi
Externí odkaz:
http://arxiv.org/abs/1404.1894
Publikováno v:
Information Processing Letters 61, 1 (1997) 31--36
The present paper analyses and presents several improvements to the algorithm for finding the $(a,b)$-pairs of integers used in the $k$-ary reduction of the right-shift $k$-ary integer GCD algorithm. While the worst-case complexity of Weber's "Accele
Externí odkaz:
http://arxiv.org/abs/1402.2266
This paper presents a new distributed approach for generating all prime numbers in a given interval of integers. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the current generation of parallel computers, whic
Externí odkaz:
http://arxiv.org/abs/1312.4508
We present a uniform self-stabilizing algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. Our algorithm consists in two stages of stabilizing protocols. The fi
Externí odkaz:
http://arxiv.org/abs/1312.3303
Publikováno v:
International Conference on Theoretical Computer Science (ICTCS98), Pisa : Italy (1998)
The present paper proposes a new parallel algorithm for the modular division $u/v\bmod \beta^s$, where $u,\; v,\; \beta$ and $s$ are positive integers $(\beta\ge 2)$. The algorithm combines the classical add-and-shift multiplication scheme with a new
Externí odkaz:
http://arxiv.org/abs/1312.2570
Publikováno v:
Journal of Parallel and Distributed Computing 64, 5 (2004) 571-577
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph $G = (V,E,\omega)$. As an intermediate step, we use a new, fast, linear-time all-pairs shortes
Externí odkaz:
http://arxiv.org/abs/1312.1961
Publikováno v:
Information Processing Letters 72, 3-4 (1999) 125-130
Recently, Ken Weber introduced an algorithm for finding the $(a,b)$-pairs satisfying $au+bv\equiv 0\pmod{k}$, with $0<|a|,|b|<\sqrt{k}$, where $(u,k)$ and $(v,k)$ are coprime. It is based on Sorenson's and Jebelean's "$k$-ary reduction" algorithms. W
Externí odkaz:
http://arxiv.org/abs/1311.7369