Orthogonality and its approximation in the analysis of asymmetry Original Research Article

Given a square matrix A, we discuss the problem of seeking some constrained matrix C which satisfies (i) A + C = M and (ii) AC = M where M is symmetric, or nearly so. Typical constraints on C include low rank, orthogonality and low-rank departures from a unit matrix. Graphical representation is discussed.