Results 281 to 290 of about 2,496,823 (351)
Application of the adaptive sparrow search algorithm in medical supply engineering. [PDF]
Sci RepLi Y, Song Z, Xia L, Sun J, Wang Z.
europepmc +1 more source
Linear Recurrence Relations Satisfied by the General Conditional Sequences
Emre Güday, Murat Sahin
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Enumerative Combinatorics, 1992
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 +3 more sources
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 +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
Mathematical Foundation of Computer Science, 2019
Bhavanari Satyanarayana +2 more
openaire +2 more sources
Bhavanari Satyanarayana +2 more
openaire +2 more sources
2013
Walter Gautschi is a giant in the field of linear recurrence relations. His concern is with stability in computing solutions \( \{y_{n}\}_{n=0}^{\infty} \) of such equations. Suppose the recurrence relation is of the form $$\displaystyle{ y_{n+1} + a_{n}y_{n} + b_{n}y_{n-1} = 0\qquad \mbox{ for}\quad n = 1,2,3,\ldots.}$$ (21.1) It seems so ...
L. Lorentzen
openaire +2 more sources
Walter Gautschi is a giant in the field of linear recurrence relations. His concern is with stability in computing solutions \( \{y_{n}\}_{n=0}^{\infty} \) of such equations. Suppose the recurrence relation is of the form $$\displaystyle{ y_{n+1} + a_{n}y_{n} + b_{n}y_{n-1} = 0\qquad \mbox{ for}\quad n = 1,2,3,\ldots.}$$ (21.1) It seems so ...
L. Lorentzen
openaire +2 more sources