Here is a question from the web that shows the type of problem you might encounter inreal life: I am trying to solve the following partitioned linear system, where each letter represents a block -H AT In dx rd (2396-8) A 01 02 ZD Where: XD dy dz His nxn, non-invertible, but dense and structured H = B - CCT A is cx n, and can be sparse I is square n x n identity O is square cxc, 02 is cxn ZD is diag(z), and xp diag(x) where both z and x are column vectors Middle and RHS terms are partitioned column vectors The entire matrix on LHS is full-rank and all numbers are real. I tried solving the inverse symbolically, but had H-1 appear. Likewise, when using Mathematica to show element-wise solution I couldn't see a pattern. Discuss the possible solution process? If you cannot find a solution discuss the attemptsyou have made towards a solution. If you did not solve the problem can you find a condition that allows you to solve it?