Download PARDISO manual

Parallel Sparse Direct Solver PARDISO — User Guide Version 5.0.0
50
int i ;
for ( i = 0; i < n +1; i ++)
{
ia [ i ] += value ;
}
for ( i = 0; i < nonzeros ; i ++)
{
ja [ i ] += value ;
}
}
int main ( void )
{
/* Matrix data .
*/
int
int
int
double
int
int
n =10;
ia [11] = { 0 ,
ja [34] = { 0 ,
9,
9,
6,
2,
3,
7,
a [34] = { 7.0 ,
nnz = ia [ n ];
mtype = -2;
11 , 15 , 19 , 22 , 26 , 29 , 32 , 33 , 34};
5, 6, 8, 9, 1, 2, 4, 8, 9, 2, 7, 8,
6, 8, 9, 4, 8, 9, 5, 7, 8, 9, 6, 8,
8 , 9 , 8 , 9};
1.0 ,
-4.0 , 8.0 ,
1.0 ,
2.0 , 7.0 ,
17.0 , 8.5 ,
6.0 , 3.0 ,
5.0 , 6.0 , 3.0 ,
7.0 ,
9.0 ,
16.0 , 8.0 ,
0.0 ,
-4.0 , -2.0 ,
3.0 ,
8.0 ,18.0 , 9.0 ,
11.0 ,
12.0 , 6.0 ,
5.0 , 4.0 , 2.0 ,
0.0 ,
0.0};
2.0 ,
/* Real unsymmetric matrix */
dumpCSR ( " m a t r i x _ s a m p l e _ m t y p e _ 2 . csr " , n , ia , ja , a );
printCSR (n , nnz , ia , ja , a );
/* Internal solver memory pointer pt ,
/* 32 - bit : int pt [64]; 64 - bit : long int pt [64]
/* or void * pt [64] should be OK on both architectures
void
* pt [64];
/* Pardiso control parameters . */
int
iparm [65];
double
dparm [64];
int
solver ;
int
maxfct , mnum , phase , error , msglvl ;
*/
*/
*/