I need to compute numerically the determinant of $M^T M$ where $M$ is a large (non-square) sparse matrix. Is there any sensible way to compute it? More generally, is there any mathematical property of determinants for expressions like $M^T M$?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Assuming that M has more rows than columns (or else the determinant is 0), you could do a rank revealing qr decomposition; if M is rank deficient the determinant is zero, and otherwise we have
where R is square upper triangular and so det(R) is the product of its diagonal elements.