A numerical method of detecting singularity

Abstract

A numerical method is reported which determines a value C for the degree of conditioning of a matrix. This value is C = 0 for a singular matrix and has progressively larger values for matrices which are increasingly well-conditioned. This value is C sub = C max sub max (C defined by the precision of the computer) when the matrix is perfectly well conditioned.