Results 311 to 320 of about 2,433,680 (345)
Some of the next articles are maybe not open access.
Parametric direction-of-arrival estimation with three recurrence relations of spherical harmonics.
Journal of the Acoustical Society of America, 2019The eigenbeam estimation of signal parameters via the rotational invariance technique (EB-ESPRIT) is a well-known subspace-based beamforming algorithm for a spherical microphone array. EB-ESPRIT uses a recurrence relation to directly estimate directional
Byeongho Jo, Jung-Woo Choi
semanticscholar +1 more source
Integral transforms and special functions, 2018
In this paper the set of general polynomial sequences is considered. An elementary systematic approach is proposed. In fact a structure of group is given and for every element of this group recurrence relations and determinant forms are derived ...
F. Costabile, M. I. Gualtieri, A. Napoli
semanticscholar +1 more source
In this paper the set of general polynomial sequences is considered. An elementary systematic approach is proposed. In fact a structure of group is given and for every element of this group recurrence relations and determinant forms are derived ...
F. Costabile, M. I. Gualtieri, A. Napoli
semanticscholar +1 more source
2016
In the upcoming chapter we introduce recurrence relations. These are equations that define in recursive fashion, via suitable functions, the terms appearing in a real or complex sequence. The first section deals with some well-known examples that show how these relations may arise in real life, e.g., the Lucas Tower game problem or the death or life ...
Mariconda C., Tonolo A.
openaire +2 more sources
In the upcoming chapter we introduce recurrence relations. These are equations that define in recursive fashion, via suitable functions, the terms appearing in a real or complex sequence. The first section deals with some well-known examples that show how these relations may arise in real life, e.g., the Lucas Tower game problem or the death or life ...
Mariconda C., Tonolo A.
openaire +2 more sources
Enumerative Combinatorics, 2018
an = an–1 + nan–2 is a linear recurrence of order 2 but with a non-constant coefficient. LRRCs are important in subjects including pseudo-random number generation, circuit design, and cryptography, and they have been studied extensively.
Prof. Lyn Turbak
semanticscholar +1 more source
an = an–1 + nan–2 is a linear recurrence of order 2 but with a non-constant coefficient. LRRCs are important in subjects including pseudo-random number generation, circuit design, and cryptography, and they have been studied extensively.
Prof. Lyn Turbak
semanticscholar +1 more source
Proceedings of the Edinburgh Mathematical Society, 1938
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +2 more sources
It is proposed here to consider the sequence un determined by the relationwhere, in particular,and initially u1 = θ1. The following is the main result to be proved.
openaire +2 more sources
Civil–Military Relations and Civil War Recurrence: Security Forces in Postwar Politics
, 2020Does restructuring security forces reduce the risk of civil war recurrence? Prior research has examined effects of military integration in alleviating commitment problems, but the evidence has been inconclusive.
Louis-Alexandre Berg
semanticscholar +1 more source
On Certain Recurrence Relations
Mathematische Nachrichten, 1970AbstractIn this paper first we establish six recurrence relations for the H‐function with the help of certain formulae concerning generalized BESSEL function. Later on, we obtain recurrence relations for MEIJER'S G‐function, GAUSS'S hypergeometric function and BESSEL function.
K. C. Gupta, Aruna Srivastava
openaire +2 more sources
Algorithmica, 1996
We examine three quantities related to heaps: the number of heaps withn nodes, the number of permutations generating the same heap, and the average number of exchange operations necessary for generating a heap from a given permutation. We find recurrence relations for these quantities, and are thus able to compute them in timeO(lnn). We also obtain the
openaire +2 more sources
We examine three quantities related to heaps: the number of heaps withn nodes, the number of permutations generating the same heap, and the average number of exchange operations necessary for generating a heap from a given permutation. We find recurrence relations for these quantities, and are thus able to compute them in timeO(lnn). We also obtain the
openaire +2 more sources
1972
Publisher Summary This chapter presents the theory of recurrence relations. The tower of Hanoi puzzle, for example, involved the recurrence relation Sn+1 = 2Sn + 1. In this situation, the recurrence relation related the minimum number of moves required to transfer a tower of n + 1 rings in the puzzle to the minimum number of moves required to transfer
K.D. Fryer, Gerald Berman
openaire +2 more sources
Publisher Summary This chapter presents the theory of recurrence relations. The tower of Hanoi puzzle, for example, involved the recurrence relation Sn+1 = 2Sn + 1. In this situation, the recurrence relation related the minimum number of moves required to transfer a tower of n + 1 rings in the puzzle to the minimum number of moves required to transfer
K.D. Fryer, Gerald Berman
openaire +2 more sources
Probabilistic Recurrence Relations [PDF]
, 2010 A sampling of discrete probability problems, some of them coming from consulting work, is presented. We demonstrate how a probabilistic recurrence relation arises from the pit of the problem and present ways and means of solving the recurrence relation.
S. Kasala +2 more
openaire +1 more source