Abstract. The construction algorithm has a worst-case time complexity of ${\Theta}(mn)$ for an $n\times n$ unsymmetric matrix having $m$ off-diagonal nonzeros. We propose another algorithm that has a worst-case time complexity of ${\mathcal O}(m\log n)$. We compare the two algorithms experimentally and show that both algorithms are efficient in general. The algorithm of Eisenstat and Liu is faster in many practical cases, yet there are instances in which there is a significant difference between the running time of the two algorithms in favor of the proposed one.
Key words. Elimination tree, sparse matrix factorization