amge driver for triangular elements;
This commit is contained in:
panayot
parent
745965c480
commit
e0f384764b
774
seq_linear_solvers/amge/driver_amge_triangles.c
Normal file
774
seq_linear_solvers/amge/driver_amge_triangles.c
Normal file
@ -0,0 +1,774 @@
|
||||
#include "headers.h"
|
||||
|
||||
/*--------------------------------------------------------------------------
|
||||
* Test driver prepares files
|
||||
* for testing unstructured matrix topology interface (csr storage)
|
||||
*--------------------------------------------------------------------------*/
|
||||
|
||||
main( int argc,
|
||||
char *argv[] )
|
||||
{
|
||||
FILE *f;
|
||||
|
||||
int ierr;
|
||||
int i,j,k,l,m;
|
||||
|
||||
int level; /* number of actual levels used in V--cycle: */
|
||||
|
||||
|
||||
int num_elements, num_nodes, num_dofs;
|
||||
|
||||
int Max_level = 25;
|
||||
|
||||
int max_level;
|
||||
|
||||
/* nested dissection ILU(1) smoother: ---------------------------------- */
|
||||
/* internal format: ---------------------------------------------------- */
|
||||
|
||||
int **i_ILUdof_to_dof;
|
||||
int **i_ILUdof_ILUdof_t, **j_ILUdof_ILUdof_t,
|
||||
**i_ILUdof_ILUdof, **j_ILUdof_ILUdof;
|
||||
double **LD_data, **U_data;
|
||||
|
||||
|
||||
/* Interpolation P and stiffness matrices Matrix; ---------------------- */
|
||||
hypre_CSRMatrix **P;
|
||||
hypre_CSRMatrix **Matrix;
|
||||
|
||||
hypre_AMGeMatrixTopology **A;
|
||||
|
||||
|
||||
/* Dirichlet boundary conditions information: -------------------------- */
|
||||
int *i_node_on_boundary;
|
||||
int *i_dof_on_boundary;
|
||||
|
||||
/* auxiliary arrays for enforcing Dirichlet boundary conditions: -------- */
|
||||
int *i_dof_dof_a, *j_dof_dof_a;
|
||||
double *a_dof_dof;
|
||||
|
||||
|
||||
/* coarsenode information and coarsenode neighborhood information; ----- */
|
||||
int **i_node_coarsenode, **j_node_coarsenode;
|
||||
int **i_node_neighbor_coarsenode, **j_node_neighbor_coarsenode;
|
||||
|
||||
|
||||
/* dimensions of nodes, elements, dofs: -------------------------------- */
|
||||
int *Num_nodes, *Num_elements, *Num_dofs;
|
||||
|
||||
/* initial graphs: element_node, boundarysurface_node: ------------------ */
|
||||
int *i_element_node_0, *j_element_node_0;
|
||||
|
||||
/* not used: num_boundarysurfaces = 0; ---------------------------------- */
|
||||
int *i_boundarysurface_node, *j_boundarysurface_node;
|
||||
int num_boundarysurfaces;
|
||||
|
||||
|
||||
/* nested dissection blocks: -------------------------------------------- */
|
||||
int **i_block_node, **j_block_node;
|
||||
int *Num_blocks;
|
||||
|
||||
|
||||
/* PDEsystem information: ----------------------------------------------- */
|
||||
int system_size;
|
||||
|
||||
|
||||
int num_functions;
|
||||
|
||||
|
||||
int *i_dof_node_0, *j_dof_node_0;
|
||||
int *i_node_dof_0, *j_node_dof_0;
|
||||
|
||||
int *i_element_dof_0, *j_element_dof_0;
|
||||
double *element_data;
|
||||
|
||||
|
||||
int **i_node_dof, **j_node_dof;
|
||||
|
||||
|
||||
/* element matrices information: ---------------------------------------- */
|
||||
int *i_element_chord_0, *j_element_chord_0;
|
||||
double *a_element_chord_0;
|
||||
|
||||
int *i_chord_dof_0, *j_chord_dof_0;
|
||||
int *Num_chords;
|
||||
|
||||
/* ---------------------------------------------------------------------- */
|
||||
|
||||
|
||||
/* counters: ------------------------------------------------------------ */
|
||||
int dof_coarsedof_counter, dof_neighbor_coarsedof_counter;
|
||||
|
||||
|
||||
/* node coordinates: ---------------------------------------------------- */
|
||||
double *x_coord, *y_coord;
|
||||
|
||||
|
||||
/* ---------------------------------------------------------------------- */
|
||||
/* PCG & V_cycle arrays: */
|
||||
/* ---------------------------------------------------------------------- */
|
||||
|
||||
double *x, *rhs, *r, *v, **w, **d,
|
||||
*aux, *v_coarse, *w_coarse, *d_coarse, *v_fine, *w_fine, *d_fine;
|
||||
int max_iter = 1000;
|
||||
int coarse_level;
|
||||
int nu = 2;
|
||||
|
||||
double reduction_factor;
|
||||
|
||||
|
||||
|
||||
/*-----------------------------------------------------------
|
||||
* Set defaults
|
||||
*-----------------------------------------------------------*/
|
||||
int arg_index;
|
||||
int time_index;
|
||||
int print_usage;
|
||||
char *element_node_file = NULL,
|
||||
*element_matrix_file = NULL, *coordinates_file=NULL,
|
||||
*node_on_boundary_file=NULL;
|
||||
|
||||
int element_node_file_type = 0;
|
||||
int element_matrix_file_type = 0;
|
||||
int coordinates_file_type = 0;
|
||||
int node_on_boundary_file_type = 0;
|
||||
|
||||
|
||||
|
||||
|
||||
Max_level = 25;
|
||||
|
||||
|
||||
|
||||
element_node_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/el_node_4";
|
||||
element_matrix_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/el_matrix_4";
|
||||
/*
|
||||
coordinates_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/coord_4";
|
||||
*/
|
||||
node_on_boundary_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/node_on_bdr_4";
|
||||
|
||||
|
||||
/*-----------------------------------------------------------
|
||||
* Parse command line
|
||||
*-----------------------------------------------------------*/
|
||||
|
||||
print_usage = 0;
|
||||
arg_index = 1;
|
||||
|
||||
|
||||
while (arg_index < argc && (!print_usage))
|
||||
{
|
||||
if ( strcmp(argv[arg_index], "-fromfile") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
element_node_file_type = 1;
|
||||
|
||||
|
||||
element_node_file = argv[arg_index];
|
||||
printf("Element_node graph from file: %s\n", element_node_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-elmmat") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
element_matrix_file_type = 1;
|
||||
|
||||
|
||||
element_matrix_file = argv[arg_index];
|
||||
printf("Element matrices from file: %s\n", element_matrix_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-bc") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
node_on_boundary_file_type = 1;
|
||||
|
||||
|
||||
node_on_boundary_file = argv[arg_index];
|
||||
printf("Dirichlet b.c. nodes from file: %s\n", node_on_boundary_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-graphics") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
coordinates_file_type = 1;
|
||||
|
||||
|
||||
coordinates_file = argv[arg_index];
|
||||
printf("Node coordinates from file: %s\n", coordinates_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-help") == 0 )
|
||||
{
|
||||
print_usage = 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
arg_index++;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
if (element_node_file)
|
||||
printf("element_node from file: %s\n", element_node_file);
|
||||
if (element_matrix_file)
|
||||
printf("Element matrices from file: %s\n", element_matrix_file);
|
||||
if (coordinates_file)
|
||||
printf("Node coordinates from file: %s\n", coordinates_file);
|
||||
if (node_on_boundary_file)
|
||||
printf("Dirichlet b.c. nodes from file: %s\n", node_on_boundary_file);
|
||||
|
||||
|
||||
|
||||
/*-----------------------------------------------------------
|
||||
* Print usage info
|
||||
*-----------------------------------------------------------*/
|
||||
|
||||
if (print_usage)
|
||||
{
|
||||
printf("\n");
|
||||
printf("Usage: %s [<options>]\n", argv[0]);
|
||||
printf("\n");
|
||||
printf(" -fromfile <filename> : build graph element_node from file\n");
|
||||
printf("\n");
|
||||
printf(" -elmmat <filename> : read fine-grid element matrices from file\n");
|
||||
printf("\n");
|
||||
printf(" -graphics <filename> : read x_coord, y_coord from file\n");
|
||||
printf("\n");
|
||||
printf(" -bc <filename> : Dirichlet b.c. nodes from file\n");
|
||||
printf("\n");
|
||||
|
||||
exit(1);
|
||||
}
|
||||
/*------------------------------------------------------------------------
|
||||
* initializing
|
||||
*------------------------------------------------------------------------*/
|
||||
|
||||
|
||||
Num_chords = hypre_CTAlloc(int, Max_level);
|
||||
Num_elements = hypre_CTAlloc(int, Max_level);
|
||||
Num_nodes = hypre_CTAlloc(int, Max_level);
|
||||
Num_dofs = hypre_CTAlloc(int, Max_level);
|
||||
|
||||
Num_blocks = hypre_CTAlloc(int, Max_level);
|
||||
|
||||
for (l=0; l < Max_level; l++)
|
||||
{
|
||||
Num_dofs[l] = 0;
|
||||
Num_elements[l] = 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/* builds initial graph(s): element_node(_0) (and boundarysurface_node): */
|
||||
|
||||
ierr = hypre_AMGeTriangInitialGraphs(&i_element_node_0,
|
||||
&j_element_node_0,
|
||||
|
||||
|
||||
|
||||
&num_elements,
|
||||
&num_nodes,
|
||||
|
||||
&i_node_on_boundary,
|
||||
|
||||
element_node_file,
|
||||
node_on_boundary_file);
|
||||
|
||||
|
||||
num_boundarysurfaces = 0;
|
||||
i_boundarysurface_node = NULL;
|
||||
j_boundarysurface_node = NULL;
|
||||
|
||||
|
||||
Num_nodes[0] = num_nodes;
|
||||
Num_elements[0] = num_elements;
|
||||
|
||||
/* builds AMGeMatrixTopology: ------------------------------------------ */
|
||||
|
||||
|
||||
|
||||
ierr = hypre_AMGeMatrixTopologySetup(&A,
|
||||
&level,
|
||||
|
||||
i_element_node_0,
|
||||
j_element_node_0,
|
||||
|
||||
num_elements, num_nodes,
|
||||
|
||||
Max_level);
|
||||
|
||||
|
||||
if (coordinates_file != NULL)
|
||||
{
|
||||
ierr = hypre_AMGe2dGraphics(A,
|
||||
level,
|
||||
|
||||
i_element_node_0,
|
||||
j_element_node_0,
|
||||
|
||||
Num_elements,
|
||||
|
||||
coordinates_file);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
max_level = level;
|
||||
|
||||
printf("END AMGeMatrixTopologySetup; =================================\n");
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
ierr = hypre_AMGeCoarsenodeSetup(A,
|
||||
&level,
|
||||
|
||||
&i_node_neighbor_coarsenode,
|
||||
&j_node_neighbor_coarsenode,
|
||||
|
||||
&i_node_coarsenode,
|
||||
&j_node_coarsenode,
|
||||
|
||||
&i_block_node,
|
||||
&j_block_node,
|
||||
|
||||
Num_blocks,
|
||||
Num_elements,
|
||||
Num_nodes);
|
||||
|
||||
printf("END AMGeCoarsenodeSetup; =================================\n");
|
||||
|
||||
|
||||
|
||||
/* ELEMENT MATRICES READ: ============================================ */
|
||||
system_size = 1;
|
||||
|
||||
num_functions = 1;
|
||||
|
||||
ierr = compute_dof_node(&i_dof_node_0, &j_dof_node_0,
|
||||
Num_nodes[0], system_size, &num_dofs);
|
||||
|
||||
Num_dofs[0] = num_dofs;
|
||||
|
||||
if (system_size == 1)
|
||||
i_dof_on_boundary = i_node_on_boundary;
|
||||
else
|
||||
{
|
||||
ierr = compute_dof_on_boundary(&i_dof_on_boundary,
|
||||
i_node_on_boundary,
|
||||
|
||||
Num_nodes[0], system_size);
|
||||
free(i_node_on_boundary);
|
||||
}
|
||||
|
||||
|
||||
ierr = transpose_matrix_create(&i_node_dof_0,
|
||||
&j_node_dof_0,
|
||||
|
||||
i_dof_node_0, j_dof_node_0,
|
||||
|
||||
Num_dofs[0], Num_nodes[0]);
|
||||
|
||||
|
||||
if (system_size == 1)
|
||||
{
|
||||
i_element_dof_0 = i_element_node_0;
|
||||
j_element_dof_0 = j_element_node_0;
|
||||
}
|
||||
else
|
||||
ierr = matrix_matrix_product(&i_element_dof_0, &j_element_dof_0,
|
||||
|
||||
i_element_node_0, j_element_node_0,
|
||||
i_node_dof_0, j_node_dof_0,
|
||||
|
||||
Num_elements[0], Num_nodes[0], Num_dofs[0]);
|
||||
|
||||
|
||||
ierr = hypre_AMGeElmMatRead(&element_data,
|
||||
|
||||
i_element_dof_0,
|
||||
j_element_dof_0,
|
||||
Num_elements[0],
|
||||
|
||||
element_matrix_file);
|
||||
|
||||
|
||||
printf("store element matrices in element_chord format: ----------------\n");
|
||||
|
||||
ierr = hypre_AMGeElementMatrixDof(i_element_dof_0, j_element_dof_0,
|
||||
|
||||
element_data,
|
||||
|
||||
&i_element_chord_0,
|
||||
&j_element_chord_0,
|
||||
&a_element_chord_0,
|
||||
|
||||
&i_chord_dof_0,
|
||||
&j_chord_dof_0,
|
||||
|
||||
&Num_chords[0],
|
||||
|
||||
Num_elements[0], Num_dofs[0]);
|
||||
|
||||
|
||||
|
||||
ierr = hypre_AMGeInterpolationSetup(&P,
|
||||
|
||||
&Matrix,
|
||||
|
||||
A,
|
||||
|
||||
&level,
|
||||
|
||||
/* ------ fine-grid element matrices ----- */
|
||||
i_element_chord_0,
|
||||
j_element_chord_0,
|
||||
a_element_chord_0,
|
||||
|
||||
i_chord_dof_0,
|
||||
j_chord_dof_0,
|
||||
|
||||
/* nnz: of the assembled matrices -------*/
|
||||
Num_chords,
|
||||
|
||||
/* ----- coarse node information ------ */
|
||||
i_node_neighbor_coarsenode,
|
||||
j_node_neighbor_coarsenode,
|
||||
|
||||
i_node_coarsenode,
|
||||
j_node_coarsenode,
|
||||
|
||||
|
||||
/* --------- Dirichlet b.c. ----------- */
|
||||
i_dof_on_boundary,
|
||||
|
||||
/* -------- PDEsystem information -------- */
|
||||
system_size,
|
||||
num_functions,
|
||||
|
||||
i_dof_node_0, j_dof_node_0,
|
||||
i_node_dof_0, j_node_dof_0,
|
||||
|
||||
&i_node_dof,
|
||||
&j_node_dof,
|
||||
|
||||
/* --------------------------------------- */
|
||||
|
||||
Num_elements,
|
||||
Num_nodes,
|
||||
Num_dofs);
|
||||
|
||||
|
||||
hypre_TFree(i_dof_on_boundary);
|
||||
|
||||
|
||||
hypre_TFree(i_dof_node_0);
|
||||
hypre_TFree(j_dof_node_0);
|
||||
|
||||
printf("END AMGeInterpolationSetup; =================================\n");
|
||||
|
||||
|
||||
ierr = hypre_AMGeSmootherSetup(&i_ILUdof_to_dof,
|
||||
|
||||
&i_ILUdof_ILUdof,
|
||||
&j_ILUdof_ILUdof,
|
||||
&LD_data,
|
||||
|
||||
&i_ILUdof_ILUdof_t,
|
||||
&j_ILUdof_ILUdof_t,
|
||||
&U_data,
|
||||
|
||||
|
||||
Matrix,
|
||||
|
||||
&level,
|
||||
|
||||
i_block_node, j_block_node,
|
||||
|
||||
i_node_dof, j_node_dof,
|
||||
|
||||
Num_blocks,
|
||||
Num_nodes,
|
||||
Num_dofs);
|
||||
|
||||
printf("END AMGeSmootherSetup; =================================\n");
|
||||
|
||||
hypre_TFree(i_node_dof_0);
|
||||
hypre_TFree(j_node_dof_0);
|
||||
|
||||
|
||||
|
||||
for (l=0; l < level+1; l++)
|
||||
{
|
||||
hypre_TFree(i_block_node[l]);
|
||||
hypre_TFree(j_block_node[l]);
|
||||
}
|
||||
|
||||
|
||||
|
||||
for (l=1; l < level+1; l++)
|
||||
{
|
||||
hypre_TFree(i_node_dof[l]);
|
||||
hypre_TFree(j_node_dof[l]);
|
||||
}
|
||||
|
||||
hypre_TFree(i_node_dof);
|
||||
hypre_TFree(j_node_dof);
|
||||
|
||||
hypre_TFree(i_block_node);
|
||||
hypre_TFree(j_block_node);
|
||||
|
||||
|
||||
|
||||
|
||||
/* ========================================================================== */
|
||||
/* ======================== S O L U T I O N P A R T: ====================== */
|
||||
/* ========================================================================== */
|
||||
|
||||
/* one V(1,1) --cycle as preconditioner in PCG: ============================== */
|
||||
/* ILU solve pre--smoothing, ILU solve post--smoothing; ===================== */
|
||||
|
||||
|
||||
|
||||
w = hypre_CTAlloc(double*, level+1);
|
||||
d = hypre_CTAlloc(double*, level+1);
|
||||
|
||||
for (l=0; l < level+1; l++)
|
||||
{
|
||||
Num_dofs[l] = Num_nodes[l] * system_size;
|
||||
if (Num_dofs[l] > 0)
|
||||
{
|
||||
w[l] = hypre_CTAlloc(double, Num_dofs[l]);
|
||||
d[l] = hypre_CTAlloc(double, Num_dofs[l]);
|
||||
}
|
||||
else
|
||||
{
|
||||
level = l-1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
num_dofs = Num_dofs[0];
|
||||
|
||||
x = hypre_CTAlloc(double, num_dofs);
|
||||
rhs = hypre_CTAlloc(double, num_dofs);
|
||||
|
||||
r = hypre_CTAlloc(double, num_dofs);
|
||||
aux = hypre_CTAlloc(double, num_dofs);
|
||||
v_fine = hypre_CTAlloc(double, num_dofs);
|
||||
w_fine = hypre_CTAlloc(double, num_dofs);
|
||||
d_fine = hypre_CTAlloc(double, num_dofs);
|
||||
|
||||
coarse_level = level;
|
||||
v_coarse = hypre_CTAlloc(double, Num_dofs[coarse_level]);
|
||||
w_coarse = hypre_CTAlloc(double, Num_dofs[coarse_level]);
|
||||
d_coarse = hypre_CTAlloc(double, Num_dofs[coarse_level]);
|
||||
|
||||
for (l=0; l < level; l++)
|
||||
{
|
||||
printf("\n\n=======================================================\n");
|
||||
printf(" Testing level[%d] PCG solve: \n",l);
|
||||
printf("===========================================================\n");
|
||||
|
||||
for (i=0; i < Num_dofs[l]; i++)
|
||||
x[i] = 0.e0;
|
||||
|
||||
for (i=0; i < Num_dofs[l]; i++)
|
||||
rhs[i] = rand();
|
||||
|
||||
i_dof_dof_a = hypre_CSRMatrixI(Matrix[l]);
|
||||
j_dof_dof_a = hypre_CSRMatrixJ(Matrix[l]);
|
||||
a_dof_dof = hypre_CSRMatrixData(Matrix[l]);
|
||||
|
||||
|
||||
ierr = hypre_ILUsolve(x,
|
||||
|
||||
i_ILUdof_to_dof[l],
|
||||
|
||||
i_ILUdof_ILUdof[l],
|
||||
j_ILUdof_ILUdof[l],
|
||||
LD_data[l],
|
||||
|
||||
i_ILUdof_ILUdof_t[l],
|
||||
j_ILUdof_ILUdof_t[l],
|
||||
U_data[l],
|
||||
|
||||
rhs,
|
||||
|
||||
Num_dofs[l]);
|
||||
|
||||
|
||||
ierr = hypre_ILUpcg(x, rhs,
|
||||
a_dof_dof,
|
||||
i_dof_dof_a, j_dof_dof_a,
|
||||
|
||||
i_ILUdof_to_dof[l],
|
||||
|
||||
i_ILUdof_ILUdof[l],
|
||||
j_ILUdof_ILUdof[l],
|
||||
LD_data[l],
|
||||
|
||||
i_ILUdof_ILUdof_t[l],
|
||||
j_ILUdof_ILUdof_t[l],
|
||||
U_data[l],
|
||||
|
||||
v_fine, w_fine, d_fine, max_iter,
|
||||
|
||||
Num_dofs[l]);
|
||||
|
||||
|
||||
printf("\n\n=======================================================\n");
|
||||
printf(" END test PCG solve: \n");
|
||||
printf("===========================================================\n");
|
||||
|
||||
}
|
||||
|
||||
printf("\n\n===============================================================\n");
|
||||
printf(" ------- V_cycle & nested dissection ILU(1) smoothing: --------\n");
|
||||
printf("================================================================\n");
|
||||
|
||||
num_dofs = Num_dofs[0];
|
||||
|
||||
for (i=0; i < num_dofs; i++)
|
||||
rhs[i] = rand();
|
||||
|
||||
|
||||
ierr = hypre_VcycleILUpcg(x, rhs,
|
||||
w, d,
|
||||
|
||||
&reduction_factor,
|
||||
|
||||
Matrix,
|
||||
i_ILUdof_to_dof,
|
||||
|
||||
i_ILUdof_ILUdof,
|
||||
j_ILUdof_ILUdof,
|
||||
LD_data,
|
||||
|
||||
i_ILUdof_ILUdof_t,
|
||||
j_ILUdof_ILUdof_t,
|
||||
U_data,
|
||||
|
||||
P,
|
||||
|
||||
aux, r,
|
||||
v_fine, w_fine, d_fine, max_iter,
|
||||
|
||||
v_coarse, w_coarse, d_coarse,
|
||||
|
||||
nu,
|
||||
level, coarse_level,
|
||||
Num_dofs);
|
||||
|
||||
|
||||
|
||||
|
||||
hypre_TFree(x);
|
||||
hypre_TFree(rhs);
|
||||
|
||||
hypre_TFree(r);
|
||||
hypre_TFree(aux);
|
||||
for (l=0; l < level+1; l++)
|
||||
if (Num_dofs[l] > 0)
|
||||
{
|
||||
printf("\n------------ level: %d --------------\n", l);
|
||||
printf("num_dofs: %d, num_elements: %d, nnz: %d\n",
|
||||
Num_dofs[l], Num_elements[l], Num_chords[l]);
|
||||
}
|
||||
|
||||
for (l=0; l < level+1; l++)
|
||||
if (Num_dofs[l] > 0)
|
||||
{
|
||||
hypre_TFree(w[l]);
|
||||
hypre_TFree(d[l]);
|
||||
|
||||
hypre_CSRMatrixDestroy(Matrix[l]);
|
||||
|
||||
}
|
||||
|
||||
for (l=0; l < max_level; l++)
|
||||
{
|
||||
|
||||
hypre_TFree(i_node_coarsenode[l]);
|
||||
hypre_TFree(j_node_coarsenode[l]);
|
||||
|
||||
hypre_TFree(i_node_neighbor_coarsenode[l]);
|
||||
hypre_TFree(j_node_neighbor_coarsenode[l]);
|
||||
|
||||
if (system_size == 1 &&Num_dofs[l+1] > 0)
|
||||
{
|
||||
hypre_CSRMatrixI(P[l]) = NULL;
|
||||
hypre_CSRMatrixJ(P[l]) = NULL;
|
||||
}
|
||||
|
||||
}
|
||||
for (l=0; l < level; l++)
|
||||
{
|
||||
|
||||
hypre_TFree(i_ILUdof_to_dof[l]);
|
||||
hypre_TFree(i_ILUdof_ILUdof[l]);
|
||||
hypre_TFree(j_ILUdof_ILUdof[l]);
|
||||
hypre_TFree(LD_data[l]);
|
||||
|
||||
|
||||
hypre_TFree(i_ILUdof_ILUdof_t[l]);
|
||||
hypre_TFree(j_ILUdof_ILUdof_t[l]);
|
||||
|
||||
hypre_TFree(U_data[l]);
|
||||
|
||||
hypre_CSRMatrixDestroy(P[l]);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
hypre_TFree(v_fine);
|
||||
hypre_TFree(w_fine);
|
||||
hypre_TFree(d_fine);
|
||||
hypre_TFree(w);
|
||||
hypre_TFree(d);
|
||||
|
||||
|
||||
hypre_TFree(v_coarse);
|
||||
hypre_TFree(w_coarse);
|
||||
hypre_TFree(d_coarse);
|
||||
|
||||
for (l=0; l < max_level+1; l++)
|
||||
hypre_DestroyAMGeMatrixTopology(A[l]);
|
||||
|
||||
|
||||
hypre_TFree(Num_nodes);
|
||||
hypre_TFree(Num_elements);
|
||||
hypre_TFree(Num_dofs);
|
||||
hypre_TFree(Num_blocks);
|
||||
hypre_TFree(Num_chords);
|
||||
|
||||
hypre_TFree(i_chord_dof_0);
|
||||
hypre_TFree(j_chord_dof_0);
|
||||
|
||||
hypre_TFree(i_element_chord_0);
|
||||
hypre_TFree(j_element_chord_0);
|
||||
hypre_TFree(a_element_chord_0);
|
||||
|
||||
|
||||
hypre_TFree(P);
|
||||
hypre_TFree(Matrix);
|
||||
hypre_TFree(A);
|
||||
|
||||
hypre_TFree(i_ILUdof_to_dof);
|
||||
hypre_TFree(i_ILUdof_ILUdof);
|
||||
hypre_TFree(j_ILUdof_ILUdof);
|
||||
hypre_TFree(LD_data);
|
||||
|
||||
hypre_TFree(i_ILUdof_ILUdof_t);
|
||||
hypre_TFree(j_ILUdof_ILUdof_t);
|
||||
hypre_TFree(U_data);
|
||||
|
||||
hypre_TFree(i_node_coarsenode);
|
||||
hypre_TFree(j_node_coarsenode);
|
||||
|
||||
hypre_TFree(i_node_neighbor_coarsenode);
|
||||
hypre_TFree(j_node_neighbor_coarsenode);
|
||||
|
||||
}
|
||||
774
seq_ls/amge/driver_amge_triangles.c
Normal file
774
seq_ls/amge/driver_amge_triangles.c
Normal file
@ -0,0 +1,774 @@
|
||||
#include "headers.h"
|
||||
|
||||
/*--------------------------------------------------------------------------
|
||||
* Test driver prepares files
|
||||
* for testing unstructured matrix topology interface (csr storage)
|
||||
*--------------------------------------------------------------------------*/
|
||||
|
||||
main( int argc,
|
||||
char *argv[] )
|
||||
{
|
||||
FILE *f;
|
||||
|
||||
int ierr;
|
||||
int i,j,k,l,m;
|
||||
|
||||
int level; /* number of actual levels used in V--cycle: */
|
||||
|
||||
|
||||
int num_elements, num_nodes, num_dofs;
|
||||
|
||||
int Max_level = 25;
|
||||
|
||||
int max_level;
|
||||
|
||||
/* nested dissection ILU(1) smoother: ---------------------------------- */
|
||||
/* internal format: ---------------------------------------------------- */
|
||||
|
||||
int **i_ILUdof_to_dof;
|
||||
int **i_ILUdof_ILUdof_t, **j_ILUdof_ILUdof_t,
|
||||
**i_ILUdof_ILUdof, **j_ILUdof_ILUdof;
|
||||
double **LD_data, **U_data;
|
||||
|
||||
|
||||
/* Interpolation P and stiffness matrices Matrix; ---------------------- */
|
||||
hypre_CSRMatrix **P;
|
||||
hypre_CSRMatrix **Matrix;
|
||||
|
||||
hypre_AMGeMatrixTopology **A;
|
||||
|
||||
|
||||
/* Dirichlet boundary conditions information: -------------------------- */
|
||||
int *i_node_on_boundary;
|
||||
int *i_dof_on_boundary;
|
||||
|
||||
/* auxiliary arrays for enforcing Dirichlet boundary conditions: -------- */
|
||||
int *i_dof_dof_a, *j_dof_dof_a;
|
||||
double *a_dof_dof;
|
||||
|
||||
|
||||
/* coarsenode information and coarsenode neighborhood information; ----- */
|
||||
int **i_node_coarsenode, **j_node_coarsenode;
|
||||
int **i_node_neighbor_coarsenode, **j_node_neighbor_coarsenode;
|
||||
|
||||
|
||||
/* dimensions of nodes, elements, dofs: -------------------------------- */
|
||||
int *Num_nodes, *Num_elements, *Num_dofs;
|
||||
|
||||
/* initial graphs: element_node, boundarysurface_node: ------------------ */
|
||||
int *i_element_node_0, *j_element_node_0;
|
||||
|
||||
/* not used: num_boundarysurfaces = 0; ---------------------------------- */
|
||||
int *i_boundarysurface_node, *j_boundarysurface_node;
|
||||
int num_boundarysurfaces;
|
||||
|
||||
|
||||
/* nested dissection blocks: -------------------------------------------- */
|
||||
int **i_block_node, **j_block_node;
|
||||
int *Num_blocks;
|
||||
|
||||
|
||||
/* PDEsystem information: ----------------------------------------------- */
|
||||
int system_size;
|
||||
|
||||
|
||||
int num_functions;
|
||||
|
||||
|
||||
int *i_dof_node_0, *j_dof_node_0;
|
||||
int *i_node_dof_0, *j_node_dof_0;
|
||||
|
||||
int *i_element_dof_0, *j_element_dof_0;
|
||||
double *element_data;
|
||||
|
||||
|
||||
int **i_node_dof, **j_node_dof;
|
||||
|
||||
|
||||
/* element matrices information: ---------------------------------------- */
|
||||
int *i_element_chord_0, *j_element_chord_0;
|
||||
double *a_element_chord_0;
|
||||
|
||||
int *i_chord_dof_0, *j_chord_dof_0;
|
||||
int *Num_chords;
|
||||
|
||||
/* ---------------------------------------------------------------------- */
|
||||
|
||||
|
||||
/* counters: ------------------------------------------------------------ */
|
||||
int dof_coarsedof_counter, dof_neighbor_coarsedof_counter;
|
||||
|
||||
|
||||
/* node coordinates: ---------------------------------------------------- */
|
||||
double *x_coord, *y_coord;
|
||||
|
||||
|
||||
/* ---------------------------------------------------------------------- */
|
||||
/* PCG & V_cycle arrays: */
|
||||
/* ---------------------------------------------------------------------- */
|
||||
|
||||
double *x, *rhs, *r, *v, **w, **d,
|
||||
*aux, *v_coarse, *w_coarse, *d_coarse, *v_fine, *w_fine, *d_fine;
|
||||
int max_iter = 1000;
|
||||
int coarse_level;
|
||||
int nu = 2;
|
||||
|
||||
double reduction_factor;
|
||||
|
||||
|
||||
|
||||
/*-----------------------------------------------------------
|
||||
* Set defaults
|
||||
*-----------------------------------------------------------*/
|
||||
int arg_index;
|
||||
int time_index;
|
||||
int print_usage;
|
||||
char *element_node_file = NULL,
|
||||
*element_matrix_file = NULL, *coordinates_file=NULL,
|
||||
*node_on_boundary_file=NULL;
|
||||
|
||||
int element_node_file_type = 0;
|
||||
int element_matrix_file_type = 0;
|
||||
int coordinates_file_type = 0;
|
||||
int node_on_boundary_file_type = 0;
|
||||
|
||||
|
||||
|
||||
|
||||
Max_level = 25;
|
||||
|
||||
|
||||
|
||||
element_node_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/el_node_4";
|
||||
element_matrix_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/el_matrix_4";
|
||||
/*
|
||||
coordinates_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/coord_4";
|
||||
*/
|
||||
node_on_boundary_file = "/home/panayot/linear_solvers/seq_linear_solvers/amge/toni/node_on_bdr_4";
|
||||
|
||||
|
||||
/*-----------------------------------------------------------
|
||||
* Parse command line
|
||||
*-----------------------------------------------------------*/
|
||||
|
||||
print_usage = 0;
|
||||
arg_index = 1;
|
||||
|
||||
|
||||
while (arg_index < argc && (!print_usage))
|
||||
{
|
||||
if ( strcmp(argv[arg_index], "-fromfile") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
element_node_file_type = 1;
|
||||
|
||||
|
||||
element_node_file = argv[arg_index];
|
||||
printf("Element_node graph from file: %s\n", element_node_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-elmmat") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
element_matrix_file_type = 1;
|
||||
|
||||
|
||||
element_matrix_file = argv[arg_index];
|
||||
printf("Element matrices from file: %s\n", element_matrix_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-bc") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
node_on_boundary_file_type = 1;
|
||||
|
||||
|
||||
node_on_boundary_file = argv[arg_index];
|
||||
printf("Dirichlet b.c. nodes from file: %s\n", node_on_boundary_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-graphics") == 0 )
|
||||
{
|
||||
arg_index++;
|
||||
coordinates_file_type = 1;
|
||||
|
||||
|
||||
coordinates_file = argv[arg_index];
|
||||
printf("Node coordinates from file: %s\n", coordinates_file);
|
||||
}
|
||||
else if ( strcmp(argv[arg_index], "-help") == 0 )
|
||||
{
|
||||
print_usage = 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
arg_index++;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
if (element_node_file)
|
||||
printf("element_node from file: %s\n", element_node_file);
|
||||
if (element_matrix_file)
|
||||
printf("Element matrices from file: %s\n", element_matrix_file);
|
||||
if (coordinates_file)
|
||||
printf("Node coordinates from file: %s\n", coordinates_file);
|
||||
if (node_on_boundary_file)
|
||||
printf("Dirichlet b.c. nodes from file: %s\n", node_on_boundary_file);
|
||||
|
||||
|
||||
|
||||
/*-----------------------------------------------------------
|
||||
* Print usage info
|
||||
*-----------------------------------------------------------*/
|
||||
|
||||
if (print_usage)
|
||||
{
|
||||
printf("\n");
|
||||
printf("Usage: %s [<options>]\n", argv[0]);
|
||||
printf("\n");
|
||||
printf(" -fromfile <filename> : build graph element_node from file\n");
|
||||
printf("\n");
|
||||
printf(" -elmmat <filename> : read fine-grid element matrices from file\n");
|
||||
printf("\n");
|
||||
printf(" -graphics <filename> : read x_coord, y_coord from file\n");
|
||||
printf("\n");
|
||||
printf(" -bc <filename> : Dirichlet b.c. nodes from file\n");
|
||||
printf("\n");
|
||||
|
||||
exit(1);
|
||||
}
|
||||
/*------------------------------------------------------------------------
|
||||
* initializing
|
||||
*------------------------------------------------------------------------*/
|
||||
|
||||
|
||||
Num_chords = hypre_CTAlloc(int, Max_level);
|
||||
Num_elements = hypre_CTAlloc(int, Max_level);
|
||||
Num_nodes = hypre_CTAlloc(int, Max_level);
|
||||
Num_dofs = hypre_CTAlloc(int, Max_level);
|
||||
|
||||
Num_blocks = hypre_CTAlloc(int, Max_level);
|
||||
|
||||
for (l=0; l < Max_level; l++)
|
||||
{
|
||||
Num_dofs[l] = 0;
|
||||
Num_elements[l] = 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/* builds initial graph(s): element_node(_0) (and boundarysurface_node): */
|
||||
|
||||
ierr = hypre_AMGeTriangInitialGraphs(&i_element_node_0,
|
||||
&j_element_node_0,
|
||||
|
||||
|
||||
|
||||
&num_elements,
|
||||
&num_nodes,
|
||||
|
||||
&i_node_on_boundary,
|
||||
|
||||
element_node_file,
|
||||
node_on_boundary_file);
|
||||
|
||||
|
||||
num_boundarysurfaces = 0;
|
||||
i_boundarysurface_node = NULL;
|
||||
j_boundarysurface_node = NULL;
|
||||
|
||||
|
||||
Num_nodes[0] = num_nodes;
|
||||
Num_elements[0] = num_elements;
|
||||
|
||||
/* builds AMGeMatrixTopology: ------------------------------------------ */
|
||||
|
||||
|
||||
|
||||
ierr = hypre_AMGeMatrixTopologySetup(&A,
|
||||
&level,
|
||||
|
||||
i_element_node_0,
|
||||
j_element_node_0,
|
||||
|
||||
num_elements, num_nodes,
|
||||
|
||||
Max_level);
|
||||
|
||||
|
||||
if (coordinates_file != NULL)
|
||||
{
|
||||
ierr = hypre_AMGe2dGraphics(A,
|
||||
level,
|
||||
|
||||
i_element_node_0,
|
||||
j_element_node_0,
|
||||
|
||||
Num_elements,
|
||||
|
||||
coordinates_file);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
max_level = level;
|
||||
|
||||
printf("END AMGeMatrixTopologySetup; =================================\n");
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
ierr = hypre_AMGeCoarsenodeSetup(A,
|
||||
&level,
|
||||
|
||||
&i_node_neighbor_coarsenode,
|
||||
&j_node_neighbor_coarsenode,
|
||||
|
||||
&i_node_coarsenode,
|
||||
&j_node_coarsenode,
|
||||
|
||||
&i_block_node,
|
||||
&j_block_node,
|
||||
|
||||
Num_blocks,
|
||||
Num_elements,
|
||||
Num_nodes);
|
||||
|
||||
printf("END AMGeCoarsenodeSetup; =================================\n");
|
||||
|
||||
|
||||
|
||||
/* ELEMENT MATRICES READ: ============================================ */
|
||||
system_size = 1;
|
||||
|
||||
num_functions = 1;
|
||||
|
||||
ierr = compute_dof_node(&i_dof_node_0, &j_dof_node_0,
|
||||
Num_nodes[0], system_size, &num_dofs);
|
||||
|
||||
Num_dofs[0] = num_dofs;
|
||||
|
||||
if (system_size == 1)
|
||||
i_dof_on_boundary = i_node_on_boundary;
|
||||
else
|
||||
{
|
||||
ierr = compute_dof_on_boundary(&i_dof_on_boundary,
|
||||
i_node_on_boundary,
|
||||
|
||||
Num_nodes[0], system_size);
|
||||
free(i_node_on_boundary);
|
||||
}
|
||||
|
||||
|
||||
ierr = transpose_matrix_create(&i_node_dof_0,
|
||||
&j_node_dof_0,
|
||||
|
||||
i_dof_node_0, j_dof_node_0,
|
||||
|
||||
Num_dofs[0], Num_nodes[0]);
|
||||
|
||||
|
||||
if (system_size == 1)
|
||||
{
|
||||
i_element_dof_0 = i_element_node_0;
|
||||
j_element_dof_0 = j_element_node_0;
|
||||
}
|
||||
else
|
||||
ierr = matrix_matrix_product(&i_element_dof_0, &j_element_dof_0,
|
||||
|
||||
i_element_node_0, j_element_node_0,
|
||||
i_node_dof_0, j_node_dof_0,
|
||||
|
||||
Num_elements[0], Num_nodes[0], Num_dofs[0]);
|
||||
|
||||
|
||||
ierr = hypre_AMGeElmMatRead(&element_data,
|
||||
|
||||
i_element_dof_0,
|
||||
j_element_dof_0,
|
||||
Num_elements[0],
|
||||
|
||||
element_matrix_file);
|
||||
|
||||
|
||||
printf("store element matrices in element_chord format: ----------------\n");
|
||||
|
||||
ierr = hypre_AMGeElementMatrixDof(i_element_dof_0, j_element_dof_0,
|
||||
|
||||
element_data,
|
||||
|
||||
&i_element_chord_0,
|
||||
&j_element_chord_0,
|
||||
&a_element_chord_0,
|
||||
|
||||
&i_chord_dof_0,
|
||||
&j_chord_dof_0,
|
||||
|
||||
&Num_chords[0],
|
||||
|
||||
Num_elements[0], Num_dofs[0]);
|
||||
|
||||
|
||||
|
||||
ierr = hypre_AMGeInterpolationSetup(&P,
|
||||
|
||||
&Matrix,
|
||||
|
||||
A,
|
||||
|
||||
&level,
|
||||
|
||||
/* ------ fine-grid element matrices ----- */
|
||||
i_element_chord_0,
|
||||
j_element_chord_0,
|
||||
a_element_chord_0,
|
||||
|
||||
i_chord_dof_0,
|
||||
j_chord_dof_0,
|
||||
|
||||
/* nnz: of the assembled matrices -------*/
|
||||
Num_chords,
|
||||
|
||||
/* ----- coarse node information ------ */
|
||||
i_node_neighbor_coarsenode,
|
||||
j_node_neighbor_coarsenode,
|
||||
|
||||
i_node_coarsenode,
|
||||
j_node_coarsenode,
|
||||
|
||||
|
||||
/* --------- Dirichlet b.c. ----------- */
|
||||
i_dof_on_boundary,
|
||||
|
||||
/* -------- PDEsystem information -------- */
|
||||
system_size,
|
||||
num_functions,
|
||||
|
||||
i_dof_node_0, j_dof_node_0,
|
||||
i_node_dof_0, j_node_dof_0,
|
||||
|
||||
&i_node_dof,
|
||||
&j_node_dof,
|
||||
|
||||
/* --------------------------------------- */
|
||||
|
||||
Num_elements,
|
||||
Num_nodes,
|
||||
Num_dofs);
|
||||
|
||||
|
||||
hypre_TFree(i_dof_on_boundary);
|
||||
|
||||
|
||||
hypre_TFree(i_dof_node_0);
|
||||
hypre_TFree(j_dof_node_0);
|
||||
|
||||
printf("END AMGeInterpolationSetup; =================================\n");
|
||||
|
||||
|
||||
ierr = hypre_AMGeSmootherSetup(&i_ILUdof_to_dof,
|
||||
|
||||
&i_ILUdof_ILUdof,
|
||||
&j_ILUdof_ILUdof,
|
||||
&LD_data,
|
||||
|
||||
&i_ILUdof_ILUdof_t,
|
||||
&j_ILUdof_ILUdof_t,
|
||||
&U_data,
|
||||
|
||||
|
||||
Matrix,
|
||||
|
||||
&level,
|
||||
|
||||
i_block_node, j_block_node,
|
||||
|
||||
i_node_dof, j_node_dof,
|
||||
|
||||
Num_blocks,
|
||||
Num_nodes,
|
||||
Num_dofs);
|
||||
|
||||
printf("END AMGeSmootherSetup; =================================\n");
|
||||
|
||||
hypre_TFree(i_node_dof_0);
|
||||
hypre_TFree(j_node_dof_0);
|
||||
|
||||
|
||||
|
||||
for (l=0; l < level+1; l++)
|
||||
{
|
||||
hypre_TFree(i_block_node[l]);
|
||||
hypre_TFree(j_block_node[l]);
|
||||
}
|
||||
|
||||
|
||||
|
||||
for (l=1; l < level+1; l++)
|
||||
{
|
||||
hypre_TFree(i_node_dof[l]);
|
||||
hypre_TFree(j_node_dof[l]);
|
||||
}
|
||||
|
||||
hypre_TFree(i_node_dof);
|
||||
hypre_TFree(j_node_dof);
|
||||
|
||||
hypre_TFree(i_block_node);
|
||||
hypre_TFree(j_block_node);
|
||||
|
||||
|
||||
|
||||
|
||||
/* ========================================================================== */
|
||||
/* ======================== S O L U T I O N P A R T: ====================== */
|
||||
/* ========================================================================== */
|
||||
|
||||
/* one V(1,1) --cycle as preconditioner in PCG: ============================== */
|
||||
/* ILU solve pre--smoothing, ILU solve post--smoothing; ===================== */
|
||||
|
||||
|
||||
|
||||
w = hypre_CTAlloc(double*, level+1);
|
||||
d = hypre_CTAlloc(double*, level+1);
|
||||
|
||||
for (l=0; l < level+1; l++)
|
||||
{
|
||||
Num_dofs[l] = Num_nodes[l] * system_size;
|
||||
if (Num_dofs[l] > 0)
|
||||
{
|
||||
w[l] = hypre_CTAlloc(double, Num_dofs[l]);
|
||||
d[l] = hypre_CTAlloc(double, Num_dofs[l]);
|
||||
}
|
||||
else
|
||||
{
|
||||
level = l-1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
num_dofs = Num_dofs[0];
|
||||
|
||||
x = hypre_CTAlloc(double, num_dofs);
|
||||
rhs = hypre_CTAlloc(double, num_dofs);
|
||||
|
||||
r = hypre_CTAlloc(double, num_dofs);
|
||||
aux = hypre_CTAlloc(double, num_dofs);
|
||||
v_fine = hypre_CTAlloc(double, num_dofs);
|
||||
w_fine = hypre_CTAlloc(double, num_dofs);
|
||||
d_fine = hypre_CTAlloc(double, num_dofs);
|
||||
|
||||
coarse_level = level;
|
||||
v_coarse = hypre_CTAlloc(double, Num_dofs[coarse_level]);
|
||||
w_coarse = hypre_CTAlloc(double, Num_dofs[coarse_level]);
|
||||
d_coarse = hypre_CTAlloc(double, Num_dofs[coarse_level]);
|
||||
|
||||
for (l=0; l < level; l++)
|
||||
{
|
||||
printf("\n\n=======================================================\n");
|
||||
printf(" Testing level[%d] PCG solve: \n",l);
|
||||
printf("===========================================================\n");
|
||||
|
||||
for (i=0; i < Num_dofs[l]; i++)
|
||||
x[i] = 0.e0;
|
||||
|
||||
for (i=0; i < Num_dofs[l]; i++)
|
||||
rhs[i] = rand();
|
||||
|
||||
i_dof_dof_a = hypre_CSRMatrixI(Matrix[l]);
|
||||
j_dof_dof_a = hypre_CSRMatrixJ(Matrix[l]);
|
||||
a_dof_dof = hypre_CSRMatrixData(Matrix[l]);
|
||||
|
||||
|
||||
ierr = hypre_ILUsolve(x,
|
||||
|
||||
i_ILUdof_to_dof[l],
|
||||
|
||||
i_ILUdof_ILUdof[l],
|
||||
j_ILUdof_ILUdof[l],
|
||||
LD_data[l],
|
||||
|
||||
i_ILUdof_ILUdof_t[l],
|
||||
j_ILUdof_ILUdof_t[l],
|
||||
U_data[l],
|
||||
|
||||
rhs,
|
||||
|
||||
Num_dofs[l]);
|
||||
|
||||
|
||||
ierr = hypre_ILUpcg(x, rhs,
|
||||
a_dof_dof,
|
||||
i_dof_dof_a, j_dof_dof_a,
|
||||
|
||||
i_ILUdof_to_dof[l],
|
||||
|
||||
i_ILUdof_ILUdof[l],
|
||||
j_ILUdof_ILUdof[l],
|
||||
LD_data[l],
|
||||
|
||||
i_ILUdof_ILUdof_t[l],
|
||||
j_ILUdof_ILUdof_t[l],
|
||||
U_data[l],
|
||||
|
||||
v_fine, w_fine, d_fine, max_iter,
|
||||
|
||||
Num_dofs[l]);
|
||||
|
||||
|
||||
printf("\n\n=======================================================\n");
|
||||
printf(" END test PCG solve: \n");
|
||||
printf("===========================================================\n");
|
||||
|
||||
}
|
||||
|
||||
printf("\n\n===============================================================\n");
|
||||
printf(" ------- V_cycle & nested dissection ILU(1) smoothing: --------\n");
|
||||
printf("================================================================\n");
|
||||
|
||||
num_dofs = Num_dofs[0];
|
||||
|
||||
for (i=0; i < num_dofs; i++)
|
||||
rhs[i] = rand();
|
||||
|
||||
|
||||
ierr = hypre_VcycleILUpcg(x, rhs,
|
||||
w, d,
|
||||
|
||||
&reduction_factor,
|
||||
|
||||
Matrix,
|
||||
i_ILUdof_to_dof,
|
||||
|
||||
i_ILUdof_ILUdof,
|
||||
j_ILUdof_ILUdof,
|
||||
LD_data,
|
||||
|
||||
i_ILUdof_ILUdof_t,
|
||||
j_ILUdof_ILUdof_t,
|
||||
U_data,
|
||||
|
||||
P,
|
||||
|
||||
aux, r,
|
||||
v_fine, w_fine, d_fine, max_iter,
|
||||
|
||||
v_coarse, w_coarse, d_coarse,
|
||||
|
||||
nu,
|
||||
level, coarse_level,
|
||||
Num_dofs);
|
||||
|
||||
|
||||
|
||||
|
||||
hypre_TFree(x);
|
||||
hypre_TFree(rhs);
|
||||
|
||||
hypre_TFree(r);
|
||||
hypre_TFree(aux);
|
||||
for (l=0; l < level+1; l++)
|
||||
if (Num_dofs[l] > 0)
|
||||
{
|
||||
printf("\n------------ level: %d --------------\n", l);
|
||||
printf("num_dofs: %d, num_elements: %d, nnz: %d\n",
|
||||
Num_dofs[l], Num_elements[l], Num_chords[l]);
|
||||
}
|
||||
|
||||
for (l=0; l < level+1; l++)
|
||||
if (Num_dofs[l] > 0)
|
||||
{
|
||||
hypre_TFree(w[l]);
|
||||
hypre_TFree(d[l]);
|
||||
|
||||
hypre_CSRMatrixDestroy(Matrix[l]);
|
||||
|
||||
}
|
||||
|
||||
for (l=0; l < max_level; l++)
|
||||
{
|
||||
|
||||
hypre_TFree(i_node_coarsenode[l]);
|
||||
hypre_TFree(j_node_coarsenode[l]);
|
||||
|
||||
hypre_TFree(i_node_neighbor_coarsenode[l]);
|
||||
hypre_TFree(j_node_neighbor_coarsenode[l]);
|
||||
|
||||
if (system_size == 1 &&Num_dofs[l+1] > 0)
|
||||
{
|
||||
hypre_CSRMatrixI(P[l]) = NULL;
|
||||
hypre_CSRMatrixJ(P[l]) = NULL;
|
||||
}
|
||||
|
||||
}
|
||||
for (l=0; l < level; l++)
|
||||
{
|
||||
|
||||
hypre_TFree(i_ILUdof_to_dof[l]);
|
||||
hypre_TFree(i_ILUdof_ILUdof[l]);
|
||||
hypre_TFree(j_ILUdof_ILUdof[l]);
|
||||
hypre_TFree(LD_data[l]);
|
||||
|
||||
|
||||
hypre_TFree(i_ILUdof_ILUdof_t[l]);
|
||||
hypre_TFree(j_ILUdof_ILUdof_t[l]);
|
||||
|
||||
hypre_TFree(U_data[l]);
|
||||
|
||||
hypre_CSRMatrixDestroy(P[l]);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
hypre_TFree(v_fine);
|
||||
hypre_TFree(w_fine);
|
||||
hypre_TFree(d_fine);
|
||||
hypre_TFree(w);
|
||||
hypre_TFree(d);
|
||||
|
||||
|
||||
hypre_TFree(v_coarse);
|
||||
hypre_TFree(w_coarse);
|
||||
hypre_TFree(d_coarse);
|
||||
|
||||
for (l=0; l < max_level+1; l++)
|
||||
hypre_DestroyAMGeMatrixTopology(A[l]);
|
||||
|
||||
|
||||
hypre_TFree(Num_nodes);
|
||||
hypre_TFree(Num_elements);
|
||||
hypre_TFree(Num_dofs);
|
||||
hypre_TFree(Num_blocks);
|
||||
hypre_TFree(Num_chords);
|
||||
|
||||
hypre_TFree(i_chord_dof_0);
|
||||
hypre_TFree(j_chord_dof_0);
|
||||
|
||||
hypre_TFree(i_element_chord_0);
|
||||
hypre_TFree(j_element_chord_0);
|
||||
hypre_TFree(a_element_chord_0);
|
||||
|
||||
|
||||
hypre_TFree(P);
|
||||
hypre_TFree(Matrix);
|
||||
hypre_TFree(A);
|
||||
|
||||
hypre_TFree(i_ILUdof_to_dof);
|
||||
hypre_TFree(i_ILUdof_ILUdof);
|
||||
hypre_TFree(j_ILUdof_ILUdof);
|
||||
hypre_TFree(LD_data);
|
||||
|
||||
hypre_TFree(i_ILUdof_ILUdof_t);
|
||||
hypre_TFree(j_ILUdof_ILUdof_t);
|
||||
hypre_TFree(U_data);
|
||||
|
||||
hypre_TFree(i_node_coarsenode);
|
||||
hypre_TFree(j_node_coarsenode);
|
||||
|
||||
hypre_TFree(i_node_neighbor_coarsenode);
|
||||
hypre_TFree(j_node_neighbor_coarsenode);
|
||||
|
||||
}
|
||||
Loading…
Reference in New Issue
Block a user