TOPICS
Search

Search Results for ""


661 - 670 of 4429 for Sum of squares functionSearch Results
A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...
The nth order Bernstein expansion of a function f(x) in terms of a variable x is given by B_n(f,x)=sum_(j=0)^n(n; j)x^j(1-x)^(n-j)f(j/n), (1) (Gzyl and Palacios 1997, Mathé ...
sum_(k=0)^m(phi_k(x)phi_k(y))/(gamma_k)=(phi_(m+1)(x)phi_m(y)-phi_m(x)phi_(m+1)(y))/(a_mgamma_m(x-y),) (1) where phi_k(x) are orthogonal polynomials with weighting function ...
Let B={b_1,b_2,...} be an infinite Abelian semigroup with linear order b_1<b_2<... such that b_1 is the unit element and a<b implies ac<bc for a,b,c in B. Define a Möbius ...
The Lerch transcendent is generalization of the Hurwitz zeta function and polylogarithm function. Many sums of reciprocal powers can be expressed in terms of it. It is ...
An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.
The second solution Q_l(x) to the Legendre differential equation. The Legendre functions of the second kind satisfy the same recurrence relation as the Legendre polynomials. ...
A "visual representation" number which is a sum of some simple function of its digits. For example, 1233 = 12^2+33^2 (1) 2661653 = 1653^2-266^2 (2) 221859 = 22^3+18^3+59^3 ...
A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...
Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then every even function h(rho) analytic in ...
1 ... 64|65|66|67|68|69|70 ... 443 Previous Next

...