Search Results for ""

A matrix for which horizontal and vertical dimensions are the same (i.e., an n×n matrix). A matrix m may be tested to determine if it is square in Wolfram Language using ...

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) ...

A determinant used to determine in which coordinate systems the Helmholtz differential equation is separable (Morse and Feshbach 1953). A determinant S=|Phi_(mn)|=|Phi_(11) ...

A standard basis, also called a natural basis, is a special orthonormal vector basis in which each basis vector has a single nonzero entry with value 1. In n-dimensional ...

Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...

Given 2n-1 numbers a_k, where k=-n+1, ..., -1, 0, 1, ..., n-1, a Toeplitz matrix is a matrix which has constant values along negative-sloping diagonals, i.e., a matrix of the ...

A square matrix is said to be totally positive if the determinant of any square submatrix, including the minors, is positive. For instance, any 2×2 matrix whose determinant ...

A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...

An upper triangular matrix U is defined by U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... ...