Several good ordering algorithms (nested dissection and
minimum degree)
are available for computing \(P\)  [1]}, [2]}.
Since our interest here does not
focus directly on the ordering, we assume for convenience that \(P=I\) ,
or that \(A\)  has been preordered to reflect an appropriate choice of \(P\) .
