Triangular Factorization of Strongly Row (Column) Full Rank Linear Equations

First, the paper gives the definition of the strongly row (column) full rank matrix, the quasi-upper triangular matrix and the quasi-lower triangular matrix of the m × n matrix. Then the triangular factorization is generalized to the m × n matrix, and some factorization theorems are obtained. By using the triangular factorization, the linear equations with strongly row (column) full rank coefficient matrix are solved procedurally and the corresponding computer algorithm is obtained. Finally, a numerical example is solved by the algorithm.