Let A be an invertible n × n matrix, and let B be an n × p matrix. Explain why A^-1B can be computed by row reduction:

If A is larger than 2 x 2, then row reduction of [A B] is much faster than computing both A^-1 and A^-1 B.

Transcribed Image Text:

If [A B]~~ [IX], then X = A¹B.