Question: Assume that F is n-by-n upper triangular, G is n-by-n upper bidiagonal, and B is n-by-n and full. [Recall that G = (9ij) is upper bidiagonal if 9ij = 0 whenever i > j or j > i + 1.] Assume that no diagonal entry of F is a diagonal entry of G. This problem is about finding an n-by-n matrix X so that FX - XG = B.
(1) Show how X{:l) can be computed by solving an upper triangular system with right hand side B{:, 1).
(2) For k ~ 2, show how X(:, k) solves an upper triangular system with a right hand side that involves B(:, k) and X(:, k - 1).
(3) Give a complete MATLAB script for computing X. You may use UTriSol (A, b).