Class EigenDecompositionJama

java.lang.Object
imagingbook.common.math.eigen.EigenDecompositionJama
All Implemented Interfaces:
RealEigenDecomposition

public class EigenDecompositionJama extends Object implements RealEigenDecomposition
Eigenvalues and eigenvectors of a real matrix. This code has been ported from https://math.nist.gov/javanumerics/jama/ (Version 1.0.3), with the public API (and some internals) adapted to Apache Commons Math. Most comments below were taken from the original sources.

This is intended as a temporary substitute for Apache Commons Math's implementation (EigenDecomposition, whose symmetry tolerance appears to be too low and thus returns complex eigenvalues for close-to-symmetric matrices although solutions with real eigenvalues exist.

If A is symmetric, then A = V*D*V' where the eigenvalue matrix D is diagonal and the eigenvector matrix V is orthogonal. I.e. A = V.times(D.times(V.transpose())) and V.times(V.transpose()) equals the identity matrix.

If A is not symmetric, then the eigenvalue matrix D is block diagonal with the real eigenvalues in 1-by-1 blocks and any complex eigenvalues, lambda + i*mu, in 2-by-2 blocks, [lambda, mu; -mu, lambda]. The columns of V represent the eigenvectors in the sense that A*V = V*D, i.e. A.times(V) equals V.times(D). The matrix V may be badly conditioned, or even singular, so the validity of the equation A = V*D*inverse(V) depends upon V.cond().

See Appendix Sec. B.5 of [1] for more details.

[1] W. Burger, M.J. Burge, Digital Image Processing – An Algorithmic Introduction, 3rd ed, Springer (2022).

Version:
2022/06/19
See Also: