Search Results for ""

A recurrence plot is defined as a plot of the quantity R(t,tau)=H(epsilon-||f(t)-f(tau)||), where H(x) is the Heaviside step function and ||f|| denotes a norm. A recurrence ...

A mathematical relationship expressing f_n as some combination of f_i with i<n. When formulated as an equation to be solved, recurrence relations are known as recurrence ...

Let a sequence be defined by A_(-1) = s (1) A_0 = 3 (2) A_1 = r (3) A_n = rA_(n-1)-sA_(n-2)+A_(n-3). (4) Also define the associated polynomial f(x)=x^3-rx^2+sx+1, (5) and let ...

To define a recurring digital invariant of order k, compute the sum of the kth powers of the digits of a number n. If this number n^' is equal to the original number n, then ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

A quadrature (numerical integration) algorithm which has a number of desirable properties.

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...