TOPICS
Search

Search Results for ""


361 - 370 of 2130 for Matrix polynomialSearch Results
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, ...
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 ...
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 ...
A pseudoinverse is a matrix inverse-like object that may be defined for a complex matrix, even if it is not necessarily square. For any given complex matrix, it is possible ...
Eigenvalues are a special set of scalars associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic roots, ...
The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.
1 ... 34|35|36|37|38|39|40 ... 213 Previous Next

...