Search Results for ""

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

An integer matrix whose entries satisfy a_(ij)={0 if j>i+1; -1 if j=i+1; 0 or 1 if j<=i. (1) There are 2^(n-1) special minimal matrices of size n×n.

The matrix direct sum of n matrices constructs a block diagonal matrix from a set of square matrices, i.e., direct sum _(i=1)^nA_i = diag(A_1,A_2,...,A_n) (1) = [A_1 ; A_2 ; ...

A matrix H with elements H_(ij)=(i+j-1)^(-1) (1) for i,j=1, 2, ..., n. Hilbert matrices are implemented in the Wolfram Language by HilbertMatrix[m, n]. The figure above shows ...

The trace of an n×n square matrix A is defined to be Tr(A)=sum_(i=1)^na_(ii), (1) i.e., the sum of the diagonal elements. The matrix trace is implemented in the Wolfram ...

A square matrix with nonzero elements only on the diagonal and slots horizontally or vertically adjacent the diagonal (i.e., along the subdiagonal and superdiagonal), [a_(11) ...

Denote the sum of two matrices A and B (of the same dimensions) by C=A+B. The sum is defined by adding entries with the same indices c_(ij)=a_(ij)+b_(ij) over all i and j. ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...

The Fibonacci Q-matrix is the matrix defined by Q=[F_2 F_1; F_1 F_0]=[1 1; 1 0], (1) where F_n is a Fibonacci number. Then Q^n=[F_(n+1) F_n; F_n F_(n-1)] (2) (Honsberger ...