combinatorics, linear algebra, and dynamical systems), a linear recurrence with constant coefficients: ch. 17 : ch. 10 (also known as a linear recurrence relation...
25 KB (4,667 words) - 13:18, 19 October 2024
the linear function merely adds the two previous terms. This example is a linear recurrence with constant coefficients, because the coefficients of the...
26 KB (4,205 words) - 15:56, 2 August 2025
Fibonacci sequence (redirect from Tetranacci constant)
Lucas. Like every sequence defined by a homogeneous linear recurrence with constant coefficients, the Fibonacci numbers have a closed-form expression...
85 KB (12,946 words) - 22:47, 28 July 2025
Characteristic equation (calculus) (category Articles with short description)
the differential equation is linear and homogeneous, and has constant coefficients. Such a differential equation, with y as the dependent variable, superscript...
13 KB (1,989 words) - 03:37, 18 May 2025
true for a linear equation of order one, with non-constant coefficients. An equation of order two or higher with non-constant coefficients cannot, in...
30 KB (4,754 words) - 18:32, 3 July 2025
Skolem problem (category Recurrence relations)
sequence satisfying a linear recurrence with constant coefficients. This theorem states that, if such a sequence has zeros, then with finitely many exceptions...
5 KB (578 words) - 00:35, 20 June 2025
Geometric progression (category Articles with short description)
first order, homogeneous linear recurrence with constant coefficients. Geometric sequences also satisfy the nonlinear recurrence relation a n = a n − 1...
9 KB (1,594 words) - 09:00, 1 June 2025
Rate of convergence (redirect from Linear convergence)
{y_{n+1}-y_{n}}{h}}=-\kappa y_{n},} which implies the first-order linear recurrence with constant coefficients y n + 1 = y n ( 1 − h κ ) . {\displaystyle y_{n+1}=y_{n}(1-h\kappa...
34 KB (5,628 words) - 01:46, 27 June 2025
numbers, or complex numbers). The equation is called a linear recurrence with constant coefficients of order d. The order of the sequence is the smallest...
38 KB (5,035 words) - 16:31, 7 July 2025
Sequence (category Articles with short description)
{\text{otherwise}},\end{cases}}} with initial term a 0 = 0. {\displaystyle a_{0}=0.} A linear recurrence with constant coefficients is a recurrence relation of the form...
40 KB (6,176 words) - 14:32, 15 July 2025
the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by...
62 KB (10,790 words) - 17:37, 29 July 2025
Generating function (category Articles with short description)
of polynomials satisfies a linear recurrence with constant coefficients; these coefficients are identical to the coefficients of the fraction denominator...
87 KB (14,462 words) - 22:42, 3 May 2025
undetermined coefficients is an approach to finding a particular solution to certain nonhomogeneous ordinary differential equations and recurrence relations...
10 KB (1,812 words) - 07:52, 23 October 2022
{\displaystyle \{b_{n}\}} are constant and independent of the step index n, then the TTRR is a Linear recurrence with constant coefficients of order 2. Arguably...
3 KB (435 words) - 18:24, 31 July 2025
Arithmetico-geometric sequence (category Articles with short description)
solutions to a special class of linear difference equation: inhomogeneous first order linear recurrences with constant coefficients. The elements of an arithmetico-geometric...
10 KB (2,160 words) - 00:46, 21 June 2025
Partial differential equation (redirect from Linear partial differential equation)
the discussion of linearity.) If the ai are constants (independent of x and y) then the PDE is called linear with constant coefficients. If f is zero everywhere...
49 KB (6,800 words) - 08:09, 10 June 2025
Differential equation (category Articles with short description)
constant coefficient ordinary differential equation: d u d x = c u + x 2 . {\displaystyle {\frac {du}{dx}}=cu+x^{2}.} Homogeneous second-order linear...
29 KB (3,631 words) - 15:23, 23 April 2025
Holonomic function (category Articles with short description)
satisfies a linear homogeneous recurrence relation with polynomial coefficients, or equivalently a linear homogeneous difference equation with polynomial...
13 KB (1,977 words) - 15:37, 19 June 2025
applied to this differential equation with step size h yields a linear recurrence relation with characteristic polynomial π ( z ; h λ ) = ( 1 − h λ β s ) z...
23 KB (4,869 words) - 10:00, 15 April 2025
Frobenius method (category Articles with short description)
zero), the coefficients of all series involved in second linearly independent solutions can be calculated straightforwardly from tandem recurrence relations...
13 KB (2,956 words) - 21:09, 3 June 2025
Equation (category Articles with short description)
other terms, which are assumed to be known, are usually called constants, coefficients or parameters. An example of an equation involving x and y as unknowns...
32 KB (4,256 words) - 16:48, 30 July 2025
Tausworthe, Robert C. (April 1965). "Random Numbers Generated by Linear Recurrence Modulo Two" (PDF). Mathematics of Computation. 19 (90): 201–209. doi:10...
38 KB (4,725 words) - 03:54, 18 July 2025
Reed–Solomon error correction (category Articles with short description)
{\displaystyle s(x)} such that the coefficients of the k {\displaystyle k} largest monomials are equal to the corresponding coefficients of p ( x ) {\displaystyle...
76 KB (12,405 words) - 14:36, 1 August 2025
Clenshaw algorithm (redirect from Clenshaw recurrence)
_{k},\;k=0,1,\ldots } is a sequence of functions that satisfy the linear recurrence relation ϕ k + 1 ( x ) = α k ( x ) ϕ k ( x ) + β k ( x ) ϕ k − 1 (...
10 KB (2,163 words) - 10:27, 24 March 2025
Biconjugate gradient stabilized method (category Numerical linear algebra)
one wishes to have recurrence relations for r̃i = Qi(A)Pi(A)r0 where Qi(A) = (I − ω1A)(I − ω2A)⋯(I − ωiA) with suitable constants ωj instead of ri = Pi(A)r0...
24 KB (1,473 words) - 17:57, 29 July 2025
Mersenne Twister (category Articles with short description)
[0,2^{w}-1]} . The Mersenne Twister algorithm is based on a matrix linear recurrence over a finite binary field F 2 {\displaystyle {\textbf {F}}_{2}} ...
32 KB (4,028 words) - 01:12, 30 July 2025
P-recursive equation (category Articles with short description)
linear recurrence equations (or linear recurrence relations or linear difference equations) with polynomial coefficients. These equations play an important...
14 KB (2,216 words) - 18:58, 31 July 2025
Bernoulli's method (category Articles with short description)
sequence defined by a linear recurrence whose coefficients are those of the polynomial. Since the method converges with a linear order only, it is less...
30 KB (3,557 words) - 13:43, 6 June 2025
Skolem–Mahler–Lech theorem (category Recurrence relations)
the linear recurrence relation F ( i ) = F ( i − 2 ) + F ( i − 4 ) {\displaystyle F(i)=F(i-2)+F(i-4)} (a modified form of the Fibonacci recurrence), starting...
5 KB (708 words) - 19:14, 23 June 2025
Autoregressive model (category Articles with short description)
stochastic difference equation (or recurrence relation) which should not be confused with a differential equation. Together with the moving-average (MA) model...
38 KB (5,837 words) - 19:46, 1 August 2025