TOPICS
Search

Search Results for ""


121 - 130 of 396 for Jordan DecompositionSearch Results
Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...
An algebra which does not satisfy a(bc)=(ab)c is called a nonassociative algebra.
The Paley class of a positive integer m=0 (mod 4) is defined as the set of all possible quadruples (k,e,q,n) where m=2^e(q^n+1), (1) q is an odd prime, and k={0 if q=0; 1 if ...
A topological space X is pathwise-connected iff for every two points x,y in X, there is a continuous function f from [0,1] to X such that f(0)=x and f(1)=y. Roughly speaking, ...
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 ...
A probabilistic experiment is an occurrence such as the tossing of a coin, rolling of a die, etc. in which the complexity of the underlying system leads to an outcome that ...
The second Neuberg circle is the circumcircle of the second Neuberg triangle. The center has center function which is not a Kimberling center. Its radius is slightly ...
A curve is simple if it does not cross itself.
The subdiagonal of a square matrix is the set of elements directly under the elements comprising the diagonal. For example, in the following matrix, the diagonal elements are ...
The set of rules for manipulating and calculating with tensors.
1 ... 10|11|12|13|14|15|16 ... 40 Previous Next

...