Search Results for ""

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

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...

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