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 [AB]∼⋯∼[IX], then X = A-1B. If A is larger than 2×2, then row reduction of [A B] is much faster than computing both A-1 and A-1B.
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 [AB]∼⋯∼[IX], then X = A-1B. If A is larger than 2×2, then row reduction of [A B] is much faster than computing both A-1 and A-1B.