C# Class Accord.Math.Decompositions.JaggedEigenvalueDecompositionF

Determines the eigenvalues and eigenvectors of a real square matrix.

In the mathematical discipline of linear algebra, eigendecomposition or sometimes spectral decomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors.

If A is symmetric, then A = V * D * V' and A = V * V' where the eigenvalue matrix D is diagonal and the eigenvector matrix V is orthogonal. If A is not symmetric, 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. The matrix V may be badly conditioned, or even singular, so the validity of the equation A = V * D * inverse(V) depends upon the condition of V.

Inheritance: ICloneable
Afficher le fichier Open project: accord-net/framework Class Usage Examples

Méthodes publiques

Méthode Description
Clone ( ) : object

Creates a new object that is a copy of the current instance.

JaggedEigenvalueDecompositionF ( System.Single value, bool inPlace = false, bool sort = false ) : System

Construct an eigenvalue decomposition.

JaggedEigenvalueDecompositionF ( System.Single value, bool assumeSymmetric, bool inPlace = false, bool sort = false ) : System

Construct an eigenvalue decomposition.

Reverse ( ) : System.Single[][]

Reverses the decomposition, reconstructing the original matrix X.

Private Methods

Méthode Description
JaggedEigenvalueDecompositionF ( ) : System
cdiv ( System.Single xr, System.Single xi, System.Single yr, System.Single yi, System.Single &cdivr, System.Single &cdivi ) : void
hqr2 ( ) : void
orthes ( ) : void
tql2 ( ) : void
tred2 ( ) : void

Method Details

Clone() public méthode

Creates a new object that is a copy of the current instance.
public Clone ( ) : object
Résultat object

JaggedEigenvalueDecompositionF() public méthode

Construct an eigenvalue decomposition.
public JaggedEigenvalueDecompositionF ( System.Single value, bool inPlace = false, bool sort = false ) : System
value System.Single /// The matrix to be decomposed.
inPlace bool /// Pass to perform the decomposition in place. The matrix /// will be destroyed in the process, resulting in less /// memory comsumption.
sort bool /// Pass to sort the eigenvalues and eigenvectors at the end /// of the decomposition.
Résultat System

JaggedEigenvalueDecompositionF() public méthode

Construct an eigenvalue decomposition.
public JaggedEigenvalueDecompositionF ( System.Single value, bool assumeSymmetric, bool inPlace = false, bool sort = false ) : System
value System.Single /// The matrix to be decomposed.
assumeSymmetric bool /// Defines if the matrix should be assumed as being symmetric /// regardless if it is or not. Default is .
inPlace bool /// Pass to perform the decomposition in place. The matrix /// will be destroyed in the process, resulting in less /// memory comsumption.
sort bool /// Pass to sort the eigenvalues and eigenvectors at the end /// of the decomposition.
Résultat System

Reverse() public méthode

Reverses the decomposition, reconstructing the original matrix X.
public Reverse ( ) : System.Single[][]
Résultat System.Single[][]