Results 271 to 280 of about 21,263 (317)
Some of the next articles are maybe not open access.
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
Algorithmica, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Probabilistic recurrence relations
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991Summary: This paper is concerned with recurrence relations that arise frequently in the analysis of divide-and-conquer algorithms. In order to solve a problem instance of size \(x\), such an algorithm invests an amount of work \(a(x)\) to break the problem into subproblems of sizes \(h_1(x),h_2(x),\dots, h_k(x)\), and then proceeds to solve the ...
openaire +3 more sources
2016
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
openaire +2 more sources
In the following chapter we address the techniques for the resolution of some celebrated recurrence relations. We will discuss in detail the linear recurrences with constant coefficients. Our emphasis goes to the application of the theory: the proofs, though elementary, are relegated to the end of the chapter.
Mariconda C., Tonolo A.
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
Mathematical Proceedings of the Cambridge Philosophical Society, 1968
Slater ((5), p. 27) and Bose ((1), p. 202) have obtained certain recurrence relations about Whittaker and hypergeometric functions. In this note an attempt has been made to obtain generalizations of these recurrence relations.
openaire +3 more sources
Slater ((5), p. 27) and Bose ((1), p. 202) have obtained certain recurrence relations about Whittaker and hypergeometric functions. In this note an attempt has been made to obtain generalizations of these recurrence relations.
openaire +3 more sources
On the limit of a recurrence relation
Journal of Difference Equations and Applications, 1999In this paper we study the asymptotic properties of the sequence of integers g(n), defined by the following recurrence relation: where ∞>0 and [x] denotes the largest not greater than x. For any ∞>0, the limit g(n)/n ∞ exists. We prove that for ∞=2, this limit is always rational.
Ron Graham, Catherine H. Yan
openaire +2 more sources
The use of recurrence relations in computing [PDF]
, 1980 The theme of this paper is that recurrence relations play an important part in computing science. Several examples are given in enumeration, systematic ordering, and the analysis of algorithms to illustrate this contention.
openaire +2 more sources
Introduction to Recurrence Relations
2020In this chapter we present fundamental concepts and motivating examples of recurrent sequences, and show connections of recurrence relations to mathematical modeling, algebra, combinatorics, and analysis. There are numerous sources presenting the classical theory.
Ovidiu Bagdasar, Dorin Andrica
openaire +2 more sources