The algorithm which estimates the condition number of a symmetric positive definite matrix is similar to the algorithm which evaluates condition number of a general matrix, the only difference is that, during the evaluation, LDLT-decomposition is used instead of LU-decomposition. Therefore, we will not examine the principles of the algorithm here, since it can be found by following the link above.
This module consists of two subroutines: SMatrixLDLTRCond and SMatrixRCond. The first subroutine estimates the condition number of a matrix given by LDLT-decomposition, and the second one estimates the condition number of a matrix whose LDLT-decomposition hasn't been generated yet. Because 1-norm and ∞-norm of symmetric matrices are equal, there is no individual subroutine for each type of norm.
This algorithm is transferred from the LAPACK library.
This article is licensed for personal use only.
ALGLIB Project offers you two editions of ALGLIB:
ALGLIB Free Edition:
+delivered for free
+offers full set of numerical functionality
+extensive algorithmic optimizations
-no multithreading
-non-commercial license
ALGLIB Commercial Edition:
+flexible pricing
+offers full set of numerical functionality
+extensive algorithmic optimizations
+high performance (SMP, SIMD)
+commercial license with support plan
Links to download sections for Free and Commercial editions can be found below: