public class SortedEigenPairs extends Object
Modifier and Type | Field and Description |
---|---|
private EigenPair[] |
eigenPairs
The array of eigenpairs.
|
Modifier | Constructor and Description |
---|---|
private |
SortedEigenPairs()
Creates a new empty SortedEigenPairs object.
|
|
SortedEigenPairs(EigenvalueDecomposition evd,
boolean ascending)
Creates a new SortedEigenPairs object from the specified eigenvalue
decomposition.
|
|
SortedEigenPairs(List<EigenPair> eigenPairs)
Creates a new SortedEigenPairs object from the specified list.
|
Modifier and Type | Method and Description |
---|---|
SortedEigenPairs |
copy()
Returns a deep copy of this object
|
double[] |
eigenValues()
Returns the sorted eigenvalues.
|
Matrix |
eigenVectors()
Returns the sorted eigenvectors.
|
Matrix |
eigenVectors(int n)
Returns the first
n sorted eigenvectors as a matrix. |
EigenPair |
getEigenPair(int index)
Returns the eigenpair at the specified index.
|
Matrix |
reverseEigenVectors(int n)
Returns the last
n sorted eigenvectors as a matrix. |
int |
size()
Returns the number of the eigenpairs.
|
String |
toString()
Returns a string representation of this EigenPair.
|
private EigenPair[] eigenPairs
private SortedEigenPairs()
public SortedEigenPairs(EigenvalueDecomposition evd, boolean ascending)
evd
- the underlying eigenvalue decompositionascending
- a boolean that indicates ascending orderpublic double[] eigenValues()
public Matrix eigenVectors()
public Matrix eigenVectors(int n)
n
sorted eigenvectors as a matrix.n
- the number of eigenvectors (columns) to be returnedn
sorted eigenvectorspublic Matrix reverseEigenVectors(int n)
n
sorted eigenvectors as a matrix.n
- the number of eigenvectors (columns) to be returnedn
sorted eigenvectorspublic EigenPair getEigenPair(int index)
index
- the index of the eigenpair to be returnedpublic int size()
public String toString()
public SortedEigenPairs copy()
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.