Then two new Algorithms to compute the Drazin inverse 𝐴𝑑 are presented based on elementary row operations on two partitioned matrices. The computational complexities of the two Algorithms are ...

We describe an algorithm which converts a linear program ${\rm min}\{cx|Ax=b,x\geq 0\}$ to a network flow problem, using elementary row operations and nonzero variable-scaling, or shows that such a ...