characteristic polynomial

Also found in: Wikipedia.

characteristic polynomial

[‚kar·ik·tə′ris·tik ‚päl·ə′nō·mē·əl]

(mathematics)

The polynomial whose roots are the eigenvalues of a given linear transformation on a finite dimensional vector space.

Mentioned in ?

References in periodicals archive ?

Then the dynamic model of the spindle is established and the characteristic polynomial is obtained.

An efficient method for calculating damped critical speeds of a build-in motorized spindle

0] is a pair of conjugate purely imaginary characteristic roots and substituting [lambda] = i[omega] into the characteristic polynomial as well as letting f([omega]) = 0, we obtain

Stability and Hopf Bifurcation Analysis on a Nonlinear Business Cycle Model

A final section describes physical visualizations of eigenvectors--for mirror reflections, rotations, row reductions, and circulant matrices--before turning to the issue of their calculation through the characteristic polynomial.

Fundamentals of Matrix Analysis With Applications

The characteristic polynomial of G is a polynomial of degree n , defined as (G, ) = det (In Eqs.

INERTIA, NULLITY AND SIGNATURE OF CNC4 [n] NANOCONEi

m](1/t) is the characteristic polynomial which determines the recurrence relation that [h.

A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs

1)--in particular the characteristic polynomial [gamma]N of A itself--in less than 6N additions (subtractions) and less than 4N multiplications (divisions), it is entirely feasible to find the roots of this polynomial (the eigenvalues of A) by Sturm plus bisection.

The fast bisection eigenvalue method for Hermitian order one quasiseparable matrices and computations of norms

Then [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is the characteristic polynomial which determines the recurrence relation that [h.

A conjecture on the number of hamiltonian cycles on thin grid cylinder graphs

Thus, the closed loop characteristic polynomial is (for simplicity, the operator [q.

Self tuning regulators for a liquid level process

S]([lambda]) is the characteristic polynomial of the shape operator of M, then we have

Timelike parallel [p.sub.i]-equidistant ruled surfaces with a spacelike base curve in the Minkowski 3-space [R.sup.1.sub.3]

The Factorization Theorem [9] states that, for any free arrangement A, the characteristic polynomial of A factors completely over the integers.

The Shi arrangement of the type [D.sub.l]

2] (say) and the characteristic polynomial can be written as

A stage structured fishery model with reserve area

i](f) are reflection vectors of the characteristic polynomial f(z) of the nominal closed-loop system (3).

Robust state controller via reflection coefficient assignment/Robustse olekuregulaatori suntees peegelduskoefitsientide kaudu