recurrence relation
51Clenshaw algorithm — In numerical analysis, the Clenshaw algorithm[1] is a recursive method to evaluate a linear combination of Chebyshev polynomials. In general it applies to any class of functions that can be defined by a three term recurrence relation.[2] Contents …
52Pell number — In mathematics, the Pell numbers and companion Pell numbers (Pell Lucas numbers) are both sequences of integers that have been known since ancient times. They are defined by a recurrence relation similar to that for the Fibonacci numbers, and… …
53Padovan sequence — The Padovan sequence is the sequence of integers P ( n ) defined by the initial values :P(0)=P(1)=P(2)=1,and the recurrence relation:P(n)=P(n 2)+P(n 3).The first few values of P ( n ) are:1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65,… …
54Stirling numbers of the second kind — In mathematics, Stirling numbers of the second kind, together with Stirling numbers of the first kind, are one of the two types of Stirling numbers. They commonly occur in the study of combinatorics, where they count the number of permutations.… …
55Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique …
56Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… …
57List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …
58Müller's method — is a root finding algorithm, a numerical method for solving equations of the form f(x) = 0. It is first presented by D. E. Müller in 1956. Müller s method is based on the secant method, which constructs at every iteration a line through two… …
59Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… …
60Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …
