If A is the (sparse) coefficient matrix of linear equality constraints, for what nonsingular T is A•TA as sparse as possible, and how can it be efficiently computed? An efficient algorithm for this á
