HPL_pdgesv man page

HPL_pdgesv — Solve A x = b.


#include "hpl.h"
 void HPL_pdgesv( HPL_T_grid * GRID, HPL_T_palg * ALGO, HPL_T_pmat * A );


HPL_pdgesv factors a N+1-by-N matrix using LU factorization with row partial pivoting.  The main algorithm  is the "right looking" variant with  or  without look-ahead.  The  lower  triangular  factor is left unpivoted and the pivots are not returned. The right hand side is the N+1 column of the coefficient matrix.


GRID    (local input)           HPL_T_grid *

On entry,  GRID  points  to the data structure containing the process grid information.

ALGO    (global input)          HPL_T_palg *

On entry,  ALGO  points to  the data structure containing the algorithmic parameters.

A       (local input/output)    HPL_T_pmat *

On entry, A points to the data structure containing the local array information.

See Also

HPL_pdgesv0 (3), HPL_pdgesvK1 (3), HPL_pdgesvK2 (3), HPL_pdtrsv (3).


October 26, 2012 HPL 2.1 HPL Library Functions