Search Results for ""

If a matrix A has a matrix of eigenvectors P that is not invertible (for example, the matrix [1 1; 0 1] has the noninvertible system of eigenvectors [1 0; 0 0]), then A does ...

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...

The natural norm induced by the L-infty-norm is called the maximum absolute row sum norm and is defined by ||A||_infty=max_(i)sum_(j=1)^n|a_(ij)| for a matrix A. This matrix ...

A complex vector space is a vector space whose field of scalars is the complex numbers. A linear transformation between complex vector spaces is given by a matrix with ...

A real vector space is a vector space whose field of scalars is the field of reals. A linear transformation between real vector spaces is given by a matrix with real entries ...

A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...

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