Search Results for ""
351 - 360 of 2130 for Matrix polynomialSearch Results
Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...
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 ...
A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...
If A=(a_(ij)) is a diagonal matrix, then Q(v)=v^(T)Av=suma_(ii)v_i^2 (1) is a diagonal quadratic form, and Q(v,w)=v^(T)Aw is its associated diagonal symmetric bilinear form. ...
The order ideal in Lambda, the ring of integral laurent polynomials, associated with an Alexander matrix for a knot K. Any generator of a principal Alexander ideal is called ...
If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...
Every complex matrix A can be broken into a Hermitian part A_H=1/2(A+A^(H)) (i.e., A_H is a Hermitian matrix) and an antihermitian part A_(AH)=1/2(A-A^(H)) (i.e., A_(AH) is ...
Every complex matrix can be broken into a Hermitian part A_H=1/2(A+A^(H)) (i.e., A_H is a Hermitian matrix) and an antihermitian part A_(AH)=1/2(A-A^(H)) (i.e., A_(AH) is an ...
The Sombor index of a graph is defined as half the sum of the matrix elements of its Sombor matrix.
Let P be a matrix of eigenvectors of a given square matrix A and D be a diagonal matrix with the corresponding eigenvalues on the diagonal. Then, as long as P is a square ...
...
View search results from all Wolfram sites (23669 matches)

