Results 1 to 10 of about 3,263,791 (91)
Recurrence Relations for Orthogonal Functions [PDF]
When µ is a finite (positive) Borel measure with infinite support on T or R (with suitable restrictions), positive definite functionals M (and thereby positive definite inner products) are defined through M(f)=∫_{-π..π}f(e^{it})dµ(t) in the circle-disk situation, and M(f)=∑_{-∞..∞}f(t)dµ(t) in the line-plane situation.
Bultheel, Adhemar +3 more
openaire +2 more sources
Recurrence techniques for the calculation of bessel functions [PDF]
where Fv(x) may be either J,(x) or Y,(x). If one is given Y,(x) and Yv+?(x) then Eq. (1) may be used to generate the functions Yv+,(x). For ? >> (x/2) the function Y,(x) increases extremely rapidly with increasing order, i.e., Y,(x) -(2,u/x) and the functions Y,+n(x) calculated from Eq. (1) yield good accuracy for large n. However, if one is given JA(x)
M. Goldstein, R. M. Thaler
openaire +3 more sources
Despite recent successes in Reinforcement Learning, value-based methods often suffer from high variance hindering performance. In this paper, we illustrate this in a continuous control setting where state of the art methods perform poorly whenever sensor noise is introduced.
Pierre Thodoroff +4 more
openaire +2 more sources
ON THE GROWTH OF LINEAR RECURRENCES IN FUNCTION FIELDS [PDF]
AbstractLet $ (G_n)_{n=0}^{\infty } $ be a nondegenerate linear recurrence sequence whose power sum representation is given by $ G_n = a_1(n) \alpha _1^n + \cdots + a_t(n) \alpha _t^n $ . We prove a function field analogue of the well-known result in the number field case that, under some nonrestrictive conditions, $ |{G_n}| \geq ( \max _{j=1 ...
CLEMENS FUCHS, SEBASTIAN HEINTZE
openaire +3 more sources
Recurrent sequences and Schur functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing-Hu Hou, Yan-Ping Mu
openaire +3 more sources
-FUNCTIONS OF ELLIPTIC CURVES AND BINARY RECURRENCES [PDF]
AbstractLet$L(s, E)= {\mathop{\sum }\nolimits}_{n\geq 1} {a}_{n} {n}^{- s} $be the$L$-series corresponding to an elliptic curve$E$defined over$ \mathbb{Q} $and$\mathbf{u} = \mathop{\{ {u}_{m} \} }\nolimits_{m\geq 0} $be a nondegenerate binary recurrence sequence.
Luca, Florian +2 more
openaire +2 more sources
Delta-functions on recurrent random walks
If a random walk on a countable infinite state space is reversible, there are known necessary and sufficient conditions for the walk to be recurrent. When the condition of reversibility is dropped, by using discrete Dirichlet solutions and balayage (concepts familiar in potential theory) one could partially retrieve some of the above results concerning
Manivannan, Varadha Raj +1 more
openaire +1 more source
Nonparametric Estimation of a Recurrent Survival Function [PDF]
Recurrent event data are frequently encountered in studies with longitudinal designs. Let the recurrence time be the time between two successive recurrent events. Recurrence times can be treated as a type of correlated survival data in statistical analysis.
Wang, Mei-Cheng, Chang, Shu-Hui
openaire +2 more sources
MuFuRU: The Multi-Function Recurrent Unit
Recurrent neural networks such as the GRU and LSTM found wide adoption in natural language processing and achieve state-of-the-art results for many tasks. These models are characterized by a memory state that can be written to and read from by applying gated composition operations to the current input and the previous state.
Dirk Weissenborn, Tim Rocktäschel
openaire +3 more sources
The recurrence function of a random Sturmian word [PDF]
Submitted to ANALCO ...
Rotondo, Pablo, Vallée, Brigitte
openaire +3 more sources

