Can I read Recurrence Relations on EtoBox?

Recurrence Relations by Sergei Kurgalin; Sergei Borzunov is a book available to read on EtoBox.

What is Recurrence Relations about?

Recurrence relation (from Latin recurrere-to return) is the method of specifying the function f (n), n ∈ N, for which [52,65]: 1) values of the function f (n) for some subset 2) values of the function for the arguments k ∈ N\N m are expressed by the values f (i), where i = 1, 2, . . . , k -1, in accordance with a specified rule. The functions constructed this way is called recursive or recursively defined, and it is the solution of the recurrence relation. The set of values of the function f (n) is also referred to as the recursive sequence. Let the recursive sequence {a n } be defined. The sequence {a n } is called the finite history sequence, if each subsequent term of the sequence explicitly depends on some fixed number of previous terms. If a n depends on all a i , 1 i n -1, then it is referred to as the full history sequence. When analyzing algorithms, one quite often has to study the recursively defined sequences. Let us consider the main methods for analyzing the recurrence relations [19] 1) method of substitution; 2) method based on the solution of a characteristic equation; 3) method of generating functions.

Author

Sergei Kurgalin; Sergei Borzunov

Publisher

Springer International Publishing : Imprint: Springer

Published

2020

Language

EN

ISBN

9783030422202

Subjects

Computer Science, Business, Programming