TOPICS
Search

Search Results for ""


361 - 370 of 1392 for linear programmingSearch Results
A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...
The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...
The delta function is a generalized function that can be defined as the limit of a class of delta sequences. The delta function is sometimes called "Dirac's delta function" ...
An Eisenstein series with half-period ratio tau and index r is defined by G_r(tau)=sum^'_(m=-infty)^inftysum^'_(n=-infty)^infty1/((m+ntau)^r), (1) where the sum sum^(') ...
An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...
Probability is the branch of mathematics that studies the possible outcomes of given events together with the outcomes' relative likelihoods and distributions. In common ...
Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...
An n-step Lucas sequence {L_k^((n))}_(k=1)^infty is defined by letting L_k^((n))=-1 for k<0, L_0^((n))=n, and other terms according to the linear recurrence equation ...
A piecewise linear, one-dimensional map on the interval [0,1] exhibiting chaotic dynamics and given by x_(n+1)=mu(1-2|x_n-1/2|). (1) The first few iterations of (1) give x_1 ...
The Lucas numbers are the sequence of integers {L_n}_(n=1)^infty defined by the linear recurrence equation L_n=L_(n-1)+L_(n-2) (1) with L_1=1 and L_2=3. The nth Lucas number ...
1 ... 34|35|36|37|38|39|40 ... 140 Previous Next

...