The eigen decomposition of matrix A is a set of two matrices: V and D such that A = V D VT. A, V and D are all m × m matrices.
As of 2.0, this class supports only symmetric matrices, and hence computes only real realEigenvalues. This implies the D matrix returned by {@link #getD()} is always diagonal and the imaginary values returned{@link #getImagEigenvalue(int)} and {@link #getImagEigenvalues()} are alwaysnull.
When called with a {@link RealMatrix} argument, this implementation only usesthe upper part of the matrix, the part below the diagonal is not accessed at all.
This implementation is based on the paper by A. Drubrulle, R.S. Martin and J.H. Wilkinson 'The Implicit QL Algorithm' in Wilksinson and Reinsch (1971) Handbook for automatic computation, vol. 2, Linear algebra, Springer-Verlag, New-York
@version $Revision: 1002040 $ $Date: 2010-09-28 09:18:31 +0200 (mar. 28 sept. 2010) $ @since 2.0
|
|