Solving (LU)x = b
Definition
Given the LU Decomposition , solving reduces to two triangular solves, which is efficient for multiple right-hand sides.
Intuition
Introduce an intermediate vector so that . Solving top-to-bottom (forward substitution) and then bottom-to-top (back substitution) each cost only , because every triangular system has a direct formula for each unknown.
Formal Description
Write . Set , then:
- Forward substitution: Solve for (starting from the first equation).
- Back substitution: Solve for (starting from the last equation).
Example. With
forward substitution on gives:
Back substitution on gives:
Hence .
Each triangular solve costs , far cheaper than re-running Gaussian elimination () for each new .
Applications
Standard computational method for solving Systems of Linear Equations with a fixed coefficient matrix and multiple right-hand sides (e.g., finite-element solvers, iterative refinement).
Trade-offs
- Requires the LU factorisation to already be computed; if changes, the factorisation must be redone.
- Numerical accuracy depends on whether pivoting was used during the LU phase; without pivoting, forward/back substitution can amplify errors.
- Not applicable directly if is singular; the system must be analysed for consistency first.