Search Results for ""

A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...

The vector space generated by the rows of a matrix viewed as vectors. The row space of a n×m matrix A with real entries is a subspace generated by n elements of R^m, hence ...

The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...

Given a Seifert form f(x,y), choose a basis e_1, ..., e_(2g) for H_1(M^^) as a Z-module so every element is uniquely expressible as n_1e_1+...+n_(2g)e_(2g) (1) with n_i ...

The Sherman-Morrison formula is a formula that allows a perturbed matrix to be computed for a change to a given matrix A. If the change can be written in the form u tensor v ...

A Lie algebra g is solvable when its Lie algebra commutator series, or derived series, g^k vanishes for some k. Any nilpotent Lie algebra is solvable. The basic example is ...

Let A be an n×n matrix with complex or real elements with eigenvalues lambda_1, ..., lambda_n. Then the spectral radius rho(A) of A is rho(A)=max_(1<=i<=n)|lambda_i|, i.e., ...

The Lie derivative of a spinor psi is defined by L_Xpsi(x)=lim_(t->0)(psi^~_t(x)-psi(x))/t, where psi^~_t is the image of psi by a one-parameter group of isometries with X ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...

Given a system of two ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y), (2) let x_0 and y_0 denote fixed points with x^.=y^.=0, so f(x_0,y_0) = 0 (3) g(x_0,y_0) ...