root / www / HPL_pdgesv.html
Historique | Voir | Annoter | Télécharger (1,53 ko)
| 1 |
<HTML>
|
|---|---|
| 2 |
<HEAD>
|
| 3 |
<TITLE>HPL_pdgesv HPL 2.0 Library Functions September 10, 2008</TITLE> |
| 4 |
</HEAD>
|
| 5 |
|
| 6 |
<BODY BGCOLOR="WHITE" TEXT = "#000000" LINK = "#0000ff" VLINK = "#000099" |
| 7 |
ALINK = "#ffff00"> |
| 8 |
|
| 9 |
<H1>Name</H1> |
| 10 |
<B>HPL_pdgesv</B> Solve A x = b. |
| 11 |
|
| 12 |
<H1>Synopsis</H1> |
| 13 |
<CODE>#include "hpl.h"</CODE><BR><BR> |
| 14 |
<CODE>void</CODE> |
| 15 |
<CODE>HPL_pdgesv(</CODE> |
| 16 |
<CODE>HPL_T_grid *</CODE> |
| 17 |
<CODE>GRID</CODE>, |
| 18 |
<CODE>HPL_T_palg *</CODE> |
| 19 |
<CODE>ALGO</CODE>, |
| 20 |
<CODE>HPL_T_pmat *</CODE> |
| 21 |
<CODE>A</CODE> |
| 22 |
<CODE>);</CODE> |
| 23 |
|
| 24 |
<H1>Description</H1> |
| 25 |
<B>HPL_pdgesv</B> |
| 26 |
factors a N+1-by-N matrix using LU factorization with row |
| 27 |
partial pivoting. The main algorithm is the "right looking" variant |
| 28 |
with or without look-ahead. The lower triangular factor is left |
| 29 |
unpivoted and the pivots are not returned. The right hand side is the |
| 30 |
N+1 column of the coefficient matrix. |
| 31 |
|
| 32 |
<H1>Arguments</H1> |
| 33 |
<PRE>
|
| 34 |
GRID (local input) HPL_T_grid * |
| 35 |
On entry, GRID points to the data structure containing the |
| 36 |
process grid information. |
| 37 |
</PRE>
|
| 38 |
<PRE>
|
| 39 |
ALGO (global input) HPL_T_palg * |
| 40 |
On entry, ALGO points to the data structure containing the |
| 41 |
algorithmic parameters. |
| 42 |
</PRE>
|
| 43 |
<PRE>
|
| 44 |
A (local input/output) HPL_T_pmat * |
| 45 |
On entry, A points to the data structure containing the local |
| 46 |
array information. |
| 47 |
</PRE>
|
| 48 |
|
| 49 |
<H1>See Also</H1> |
| 50 |
<A HREF="HPL_pdgesv0.html">HPL_pdgesv0</A>, |
| 51 |
<A HREF="HPL_pdgesvK1.html">HPL_pdgesvK1</A>, |
| 52 |
<A HREF="HPL_pdgesvK2.html">HPL_pdgesvK2</A>, |
| 53 |
<A HREF="HPL_pdtrsv.html">HPL_pdtrsv</A>. |
| 54 |
|
| 55 |
</BODY>
|
| 56 |
</HTML>
|