Search Results for ""

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...

An m×1 matrix [a_(11); a_(21); |; a_(m1)].

A 1×n matrix [a_(11) a_(12) ... a_(1n)].

Given an m×n matrix A and a p×q matrix B, their Kronecker product C=A tensor B, also called their matrix direct product, is an (mp)×(nq) matrix with elements defined by ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...

The matrix decomposition of a square matrix A into so-called eigenvalues and eigenvectors is an extremely important one. This decomposition generally goes under the name ...

Given a matrix A, its QR-decomposition is a matrix decomposition of the form A=QR, where R is an upper triangular matrix and Q is an orthogonal matrix, i.e., one satisfying ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...