Singular AX = B

[Sid Andal]

Solving the singular linear system AX = B, where the first column of the square matrix, A, is identically zero (if the particular solution exists) can be achieved with the usual method X := solve(A, B) along with the nontrivial nullspace.

Is there a computationally more efficient method to solve the system that can take advantage of the fact that column one of A is identically zero?

Thanks,

SWA

[Waldek Hebisch]

'solve' automatically takes advantage of zero columns, no need
to do anything special.

--
Waldek Hebisch