Suppose you encounter a zero on the diagonal of an upper tri

Suppose you encounter a zero on the diagonal of an upper triangular matrix U on which you are using backward substitution to solve Ux=b. What happens?

Solution

the algorithm completes as designed and finds a solution x of Ux=b at the end we ge x₁=K then we can express x₂ and x₃ can express in terms of K