By providing a completely extensible set of vertex and edge properties, you can make graphs represent much more than the structural information embodied in their topology. ...

CharacteristicPolynomial[m, x] gives the characteristic polynomial for the matrix m. CharacteristicPolynomial[{m, a}, x] gives the generalized characteristic polynomial with ...

SingularValueList[m] gives a list of the nonzero singular values of a matrix m. SingularValueList[{m, a}] gives the generalized singular values of m with respect to a. ...

RealBlockDiagonalForm is an option for SchurDecomposition and related functions which specifies whether 2*2 blocks of real values should be used on matrix diagonals in place ...

Eigensystem[m] gives a list {values, vectors} of the eigenvalues and eigenvectors of the square matrix m. Eigensystem[{m, a}] gives the generalized eigenvalues and ...

Spectrum[g] gives the eigenvalues of graph g.

SchurDecomposition[m] yields the Schur decomposition for a numerical matrix m, given as a list {q, t} where q is an orthonormal matrix and t is a block upper-triangular ...

DiscreteLyapunovSolve[a, c] finds the numeric solution x of the discrete matrix equation a.x.a\[ConjugateTranspose] - x == c.DiscreteLyapunovSolve[a, b, c] solves a.x.b - x ...

DiscreteRiccatiSolve[{a, b}, {q, r}] gives the matrix x that is the stabilizing solution of the discrete algebraic Riccati equation ConjugateTranspose[a].x.a - x - ...

RiccatiSolve[{a, b}, {q, r}] gives the matrix x that is the stabilizing solution of the continuous algebraic Riccati equation ConjugateTranspose[a].x + x.a - ...