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