TOPICS
Search

Search Results for ""


10081 - 10090 of 13135 for Computational GeometrySearch Results
y^('')-mu(1-1/3y^('2))y^'+y=0, where mu>0. Differentiating and setting y=y^' gives the van der Pol equation. The equation y^('')-mu(1-y^('2))y^'+y=0 with the 1/3 replaced by ...
The distribution with probability density function and distribution function P(r) = (re^(-r^2/(2s^2)))/(s^2) (1) D(r) = 1-e^(-r^2/(2s^2)) (2) for r in [0,infty) and parameter ...
The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...
The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...
A real normed algebra, also called a composition algebra, is a multiplication * on R^n that respects the length of vectors, i.e., |x*y|=|x|*|y| for x,y in R^n. The only real ...
The real part R[z] of a complex number z=x+iy is the real number not multiplying i, so R[x+iy]=x. In terms of z itself, R[z]=1/2(z+z^_), where z^_ is the complex conjugate of ...
There are at least two sequences attributed to B. Recamán. One is the sequence a_n formed by taking a_1=1 and letting a_n={a_(n-1)-n if a_(n-1)-n>0 and is new; a_(n-1)+n ...
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 ...
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 ...
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 ...

...