Rank and null space calculations using matrix decomposition without column interchanges
With this paper two stable algorithms are presented which do not require column interchanges for determining the rank and nullity of a matrix. Potential applications to sparse matrix rank determination and more specifically rank determination when sequentially adding columns are discussed.
scientific article; zbMATH DE number 3947521
scientific article