Statistiques
| Révision :

root / man / man3 / HPL_pdgesvK2.3

Historique | Voir | Annoter | Télécharger (1,3 ko)

1
.TH HPL_pdgesvK2 3 "September 10, 2008" "HPL 2.0" "HPL Library Functions"
2
.SH NAME
3
HPL_pdgesvK2 \- Factor an N x N+1 matrix.
4
.SH SYNOPSIS
5
\fB\&#include "hpl.h"\fR
6
 
7
\fB\&void\fR
8
\fB\&HPL_pdgesvK2(\fR
9
\fB\&HPL_T_grid *\fR
10
\fI\&GRID\fR,
11
\fB\&HPL_T_palg *\fR
12
\fI\&ALGO\fR,
13
\fB\&HPL_T_pmat *\fR
14
\fI\&A\fR
15
\fB\&);\fR
16
.SH DESCRIPTION
17
\fB\&HPL_pdgesvK2\fR
18
factors a N+1-by-N matrix using LU factorization with row
19
partial pivoting.  The main algorithm  is the "right looking" variant
20
with look-ahead.  The  lower  triangular factor is left unpivoted and
21
the pivots are not returned. The right hand side is the N+1 column of
22
the coefficient matrix.
23
.SH ARGUMENTS
24
.TP 8
25
GRID    (local input)           HPL_T_grid *
26
On entry,  GRID  points  to the data structure containing the
27
process grid information.
28
.TP 8
29
ALGO    (global input)          HPL_T_palg *
30
On entry,  ALGO  points to  the data structure containing the
31
algorithmic parameters.
32
.TP 8
33
A       (local input/output)    HPL_T_pmat *
34
On entry, A points to the data structure containing the local
35
array information.
36
.SH SEE ALSO
37
.BR HPL_pdgesv \ (3),
38
.BR HPL_pdgesv0 \ (3),
39
.BR HPL_pdgesvK1 \ (3),
40
.BR HPL_pdfact \ (3),
41
.BR HPL_binit \ (3),
42
.BR HPL_bcast \ (3),
43
.BR HPL_bwait \ (3),
44
.BR HPL_pdupdateNN \ (3),
45
.BR HPL_pdupdateNT \ (3),
46
.BR HPL_pdupdateTN \ (3),
47
.BR HPL_pdupdateTT \ (3).