public class SymmetricQRAlgorithmDecomposition extends Object
Computes the eigenvalues and eigenvectors of a real symmetric matrix using the symmetric implicit QR algorithm. Inside each iteration a QR decomposition of Ai-piI is implicitly computed.
This implementation is based on the algorithm is sketched out in:
David S. Watkins, "Fundamentals of Matrix Computations," Second Edition. page 377-385
| Constructor and Description |
|---|
SymmetricQRAlgorithmDecomposition(boolean computeVectors) |
SymmetricQRAlgorithmDecomposition(TridiagonalDecompositionHouseholder decomp,
boolean computeVectors) |
| Modifier and Type | Method and Description |
|---|---|
EigenResult |
decompose(AMatrix orig)
Decomposes the matrix using the QR algorithm.
|
Vector2 |
getEigenvalue(int index) |
AVector |
getEigenVector(int index) |
int |
getNumberOfEigenvalues() |
void |
setComputeVectorsWithValues(boolean computeVectorsWithValues) |
void |
setMaxIterations(int max)
Used to limit the number of internal QR iterations that the QR algorithm performs.
|
public SymmetricQRAlgorithmDecomposition(TridiagonalDecompositionHouseholder decomp, boolean computeVectors)
public SymmetricQRAlgorithmDecomposition(boolean computeVectors)
public void setComputeVectorsWithValues(boolean computeVectorsWithValues)
public void setMaxIterations(int max)
max - The maximum number of QR iterations it will perform.public int getNumberOfEigenvalues()
public Vector2 getEigenvalue(int index)
public AVector getEigenVector(int index)
public EigenResult decompose(AMatrix orig)
orig - The matrix which is being decomposed. Not modified.Copyright © 2016. All rights reserved.