Name | Description | Type | Package | Framework |
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 |
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 |
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 |
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 |