TOPICS
Search

Search Results for ""


361 - 370 of 1562 for Matrix RootSearch Results
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 ...
A cyclotomic field Q(zeta) is obtained by adjoining a primitive root of unity zeta, say zeta^n=1, to the rational numbers Q. Since zeta is primitive, zeta^k is also an nth ...
The Sendov conjecture, proposed by Blagovest Sendov circa 1958, that for a polynomial f(z)=(z-r_1)(z-r_2)...(z-r_n) with n>=2 and each root r_k located inside the closed unit ...
A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...
The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...
A univariate distribution proportional to the F-distribution. If the vector d is Gaussian multivariate-distributed with zero mean and unit covariance matrix N_p(0,I) and M is ...
A generalized eigenvector for an n×n matrix A is a vector v for which (A-lambdaI)^kv=0 for some positive integer k in Z^+. Here, I denotes the n×n identity matrix. The ...
The polynomials in the diagonal of the Smith normal form or rational canonical form of a matrix are called its invariant factors.
If the matrices A, X, B, and C satisfy AX-XB=C, then [I X; 0 I][A C; 0 B][I -X; 0 I]=[A 0; 0 B], where I is the identity matrix.
The superdiagonal of a square matrix is the set of elements directly above the elements comprising the diagonal. For example, in the following matrix, the diagonal elements ...
1 ... 34|35|36|37|38|39|40 ... 157 Previous Next

...