Search Results for ""

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

The main diagonal of a square matrix can be extracted in the Wolfram Language using Tr[m, List].

Given a matrix A, a Jordan basis satisfies Ab_(i,1)=lambda_ib_(i,1) and Ab_(i,j)=lambda_ib_(i,j)+b_(i,j-1), and provides the means by which any complex matrix A can be ...

A linear algebraic group is a matrix group that is also an affine variety. In particular, its elements satisfy polynomial equations. The group operations are required to be ...

Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...

The idiosyncratic polynomial is the bivariate graph polynomial defined as the characteristic polynomial in x of A+y(J-I-A), where A is the adjacency matrix, J is the unit ...

Stationary iterative methods are methods for solving a linear system of equations Ax=b, where A is a given matrix and b is a given vector. Stationary iterative methods can be ...

The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, the ...

To solve the system of differential equations (dx)/(dt)=Ax(t)+p(t), (1) where A is a matrix and x and p are vectors, first consider the homogeneous case with p=0. The ...

A rewriting of a given quantity (e.g., a matrix) in terms of a combination of "simpler" quantities.