Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen Classes and Interfaces - 31 results found.
NameDescriptionTypePackageFramework
BlockSplitPointSearchComputes the splitting points with the given threshold.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
CharacteristicPolynomialThe characteristic polynomial of a square matrix is the function The zeros of this polynomial are the eigenvalues of A.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
DefaultDeflationCriterion .MatrixNormComputes the norm of a given matrix.Interfacecom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
DeflationA deflation found in a Hessenberg (or tridiagonal in symmetric case) matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
DeflationCriterionDetermines whether a sub-diagonal entry is sufficiently small to be neglected.Interfacecom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
DQDSComputes all the eigenvalues of the symmetric positive definite tridiagonal matrix associated with the qd-array Z to high relative accuracy.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.dqdsSuanShu
EigenClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
Eigen .Methodthe available methods to compute eigenvalues and eigenvectorsFor a matrix of dimension 4 or smaller.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
EigenBoundUtilsUtility methods for computing bounds of eigenvalues.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
EigenCountCounts the number of eigenvalues in a symmetric tridiagonal matrix T that are less than aSee Also:"W.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
EigenCountInRangeClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
EigenDecompositionClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
EigenPropertyEigenProperty is a read-only structure that contains the information about a particular eigenvalue,Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
EigenvalueByDQDSComputes all the eigenvalues of a symmetric tridiagonal matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.dqdsSuanShu
GetvecClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3.getvecSuanShu
HessenbergAn upper Hessenberg matrix is a square matrix which has zero entries below the first 0 & 9 & 10 & 11 & \Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
HessenbergDecompositionGiven a square matrix A, we find Q such that Q' * A * Q = H where H is a Hessenberg matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
HessenbergDeflationSearchGiven a Hessenberg matrix, this class searches the largest unreduced Hessenberg sub-matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
InverseIterationInverse iteration is an iterative eigenvalue algorithm.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
InverseIteration .StoppingCriterionThis interface defines the convergence criterion.Interfacecom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
LDDecompositionRepresents a L D LT decomposition of a shifted symmetric tridiagonal matrix where T is a symmetric tridiagonal matrix,Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
LDFactorizationFromRootClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
MR3Computes eigenvalues and eigenvectors of a given symmetric tridiagonal matrix T using "Algorithm of Multiple Relatively Robust Representations" (MRRR).Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
QRAlgorithmThe 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.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
SingularValueByDQDSComputes all the singular values of a bidiagonal matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.dqdsSuanShu
SpectrumA spectrum is the set of eigenvalues of a matrix.Interfacecom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigenSuanShu
SturmCountClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
SymmetricEigenByMR3Computes eigen decomposition for a symmetric matrix using "Algorithm of Multiple Relatively Robust Representations" (MRRR).Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
SymmetricEigenFor2x2MatrixClasscom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.mr3SuanShu
SymmetricQRAlgorithmThe symmetric QR algorithm is an eigenvalue algorithm by computing the real Schur canonical form of a square, symmetric matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu
TridiagonalDeflationSearchThis class locates deflation in a tridiagonal matrix.Classcom.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.eigen.qrSuanShu