Search Results for ""

The Frobenius norm, sometimes also called the Euclidean norm (a term unfortunately also used for the vector L^2-norm), is matrix norm of an m×n matrix A defined as the square ...

Let p and q be partitions of a positive integer, then there exists a (0,1)-matrix A such that c(A)=p, r(A)=q iff q is dominated by p^*.

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

A (2n)×(2n) complex matrix A in C^(2n×2n) is said to be Hamiltonian if J_nA=(J_nA)^(H), (1) where J_n in R^(2n×2n) is the matrix of the form J_n=[0 I_n; I_n 0], (2) I_n is ...

Let F(m,n) be the number of m×n (0,1)-matrices with no adjacent 1s (in either columns or rows). For n=1, 2, ..., F(n,n) is given by 2, 7, 63, 1234, ... (OEIS A006506). The ...

A Hessenberg decomposition is a matrix decomposition of a matrix A into a unitary matrix P and a Hessenberg matrix H such that PHP^(H)=A, where P^(H) denotes the conjugate ...

A heterosquare is an n×n array of the integers from 1 to n^2 such that the rows, columns, and diagonals have different sums. (By contrast, in a magic square, they have the ...

Let X={x_1>=x_2>=...>=x_n|x_i in R} (1) and Y={y_1>=y_2>=...>=y_n|y_i in R}. (2) Then there exists an n×n Hermitian matrix with eigenvalues X and diagonal elements Y iff ...

For an n×n matrix, let S denote any permutation e_1, e_2, ..., e_n of the set of numbers 1, 2, ..., n, and let chi^((lambda))(S) be the character of the symmetric group ...