Computes the norm of a given matrix.
Determines whether a sub-diagonal entry is sufficiently small to be neglected.
The default deflation criterion is to use eq.
A deflation found in a Hessenberg (or tridiagonal in symmetric case) matrix.
An upper Hessenberg matrix is a square matrix which has zero entries below the first sub-diagonal.
Given a square matrix A, we find Q such that Q' * A * Q = H where H is a Hessenberg matrix.
Given a Hessenberg matrix, this class searches the largest unreduced Hessenberg sub-matrix.
The QR algorithm is an eigenvalue algorithm by computing the real Schur canonical form of a matrix.
The symmetric QR algorithm is an eigenvalue algorithm by computing the real Schur canonical form of a square, symmetric matrix.
This class locates deflation in a tridiagonal matrix.
Copyright © 2010-2017 Numerical Method Incorporation Limited. All Rights Reserved.