Search Results for ""

A bilinear basis is a basis, which satisfies the conditions (ax+by)·z=a(x·z)+b(y·z) z·(ax+by)=a(z·x)+b(z·y).

A matrix whose eigenvectors are not complete.

A square matrix which is not reducible is said to be irreducible.

The (n+1)×(n+1) tridiagonal matrix (also called the Clement matrix) defined by S_n=[0 n 0 0 ... 0; 1 0 n-1 0 ... 0; 0 2 0 n-2 ... 0; | | ... ... ... |; 0 0 0 n-1 0 1; 0 0 0 0 ...

A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.

A matrix for which horizontal and vertical dimensions are not the same (i.e., an m×n matrix with m!=n).

A p×q submatrix of an m×n matrix (with p<=m, q<=n) is a p×q matrix formed by taking a block of the entries of this size from the original matrix.

The tangent function is defined by tanx=(sinx)/(cosx), (1) where sinx is the sine function and cosx is the cosine function. The notation tgx is sometimes also used ...

The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...

A cubic polynomial is a polynomial of degree 3. A univariate cubic polynomial has the form f(x)=a_3x^3+a_2x^2+a_1x+a_0. An equation involving a cubic polynomial is called a ...