\subsection{Description}

Numerical factorisation
(\hyperref[factorization]{\ref{factorization}})of the given matrix.\\ 
Can be $LU$, $LL^t$, or $LDL^t$ factorisation.

\subsection{Parameters}

\begin{description}
\item[\dparm{DPARM\_EPSILON\_MAGN\_CTRL}~:] value which will be used
  for static pivoting. Diagonal values smaller than it will be
  replaced by it.
\end{description}
\subsection{Ouputs}

After factorisation, \iparm{IPARM\_STATIC\_PIVOTING}~: will be
set to the number of static pivoting performed.\\
A static pivoting is performed when a diagonal value is smaller than
\dparm{DPARM\_EPSILON\_MAGN\_CTRL}.

\begin{description}
\item[\iparm{IPARM\_ALLOCATED\_TERMS}~:] Number of non zeros allocated in the final matrix,
\item[\dparm{DPARM\_FACT\_TIME}~:] contains the time spent
  computing factorisation step in seconds, in real time, not cpu time,
\item[\dparm{DPARM\_SOLV\_FLOPS}~:] contains the number of operation
  per second during factorisation step.
\end{description}
