Need to exploit structure of the matrix to solve in ways that areThe MATLAB command $p=$colamd$(A)$ applied to an $nn$ matrix A calculates the column approximate minimum degree

permutation of $\{1,$dots,$n\}.$ Tick ALL of the following statements that are true:

$A(p,p)$ is a reordering of the rows and the columns of $A.$

The aim of the reordering is to produce a matrix for which there is less FILL$-$IN when the matrix is

factorized.

A $($p$,$ p$)$ tends to have a more sparse $LU$ or Cholesky factor than A$.$