Name | Description | Type | Package | Framework |
BlockSplitPointSearch | Computes the splitting points with the given threshold. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu |
CharacteristicPolynomial | The characteristic polynomial of a square matrix is the function The zeros of this polynomial are the eigenvalues of A. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu |
DefaultDeflationCriterion .MatrixNorm | Computes the norm of a given matrix. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
Deflation | A deflation found in a Hessenberg (or tridiagonal in symmetric case) matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
DeflationCriterion | Determines whether a sub-diagonal entry is sufficiently small to be neglected. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
DQDS | Computes all the eigenvalues of the symmetric positive definite tridiagonal matrix associated with the qd-array Z to high relative accuracy. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.dqds | SuanShu |
Eigen | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu | |
Eigen .Method | the available methods to compute eigenvalues and eigenvectorsFor a matrix of dimension 4 or smaller. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu |
EigenBoundUtils | Utility methods for computing bounds of eigenvalues. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu |
EigenCount | Counts the number of eigenvalues in a symmetric tridiagonal matrix T that are less than aSee Also:"W. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu |
EigenCountInRange | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu | |
EigenDecomposition | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu | |
EigenProperty | EigenProperty is a read-only structure that contains the information about a particular eigenvalue, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu |
EigenvalueByDQDS | Computes all the eigenvalues of a symmetric tridiagonal matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.dqds | SuanShu |
Getvec | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3.getvec | SuanShu | |
Hessenberg | An upper Hessenberg matrix is a square matrix which has zero entries below the first 0 & 9 & 10 & 11 & \ | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
HessenbergDecomposition | Given a square matrix A, we find Q such that Q' * A * Q = H where H is a Hessenberg matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
HessenbergDeflationSearch | Given a Hessenberg matrix, this class searches the largest unreduced Hessenberg sub-matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
InverseIteration | Inverse iteration is an iterative eigenvalue algorithm. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu |
InverseIteration .StoppingCriterion | This interface defines the convergence criterion. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu |
LDDecomposition | Represents a L D LT decomposition of a shifted symmetric tridiagonal matrix where T is a symmetric tridiagonal matrix, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu |
LDFactorizationFromRoot | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu | |
MR3 | Computes eigenvalues and eigenvectors of a given symmetric tridiagonal matrix T using "Algorithm of Multiple Relatively Robust Representations" (MRRR). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu |
QRAlgorithm | The QR algorithm is an eigenvalue algorithm by computing the real Schur canonical form of a That is, Q'AQ = T where Q is orthogonal, and T is quasi-triangular. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
SingularValueByDQDS | Computes all the singular values of a bidiagonal matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.dqds | SuanShu |
Spectrum | A spectrum is the set of eigenvalues of a matrix. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen | SuanShu |
SturmCount | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu | |
SymmetricEigenByMR3 | Computes eigen decomposition for a symmetric matrix using "Algorithm of Multiple Relatively Robust Representations" (MRRR). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu |
SymmetricEigenFor2x2Matrix | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3 | SuanShu | |
SymmetricQRAlgorithm | The symmetric QR algorithm is an eigenvalue algorithm by computing the real Schur canonical form of a square, symmetric matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |
TridiagonalDeflationSearch | This class locates deflation in a tridiagonal matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qr | SuanShu |