paso/src/Pattern_coupling.c


/*******************************************************
*
* Copyright (c) 2003-2008 by University of Queensland
* Earth Systems Science Computational Center (ESSCC)
* http://www.uq.edu.au/esscc
*
* Primary Business: Queensland, Australia
* Licensed under the Open Software License version 3.0
* http://www.opensource.org/licenses/osl-3.0.php
*
*******************************************************/


/**********************************************************************/

/* Paso: Pattern: Paso_Pattern_coupling 

   searches for a maximal independent set MIS in the matrix pattern 
   vertices in the maximal independent set are marked in mis_marker
   nodes to be considered are marked by -1 on the input in mis_marker

*/
/**********************************************************************/

/* Copyrights by ACcESS Australia 2003,2004,2005              */
/* Author: artak@uq.edu.au                                */

/**************************************************************/

#include "PasoUtil.h"
#include "Pattern_coupling.h"


/***************************************************************/
 
#define IS_AVAILABLE -1
#define IS_IN_MIS_NOW -2
#define IS_IN_MIS -3
#define IS_CONNECTED_TO_MIS -4


void Paso_Pattern_coup(Paso_SparseMatrix* A, index_t* mis_marker) {

  index_t index_offset=(A->pattern->type & PATTERN_FORMAT_OFFSET1 ? 1:0);
  dim_t i,j;
  double threshold=0.05;
  index_t iptr,*index,*where_p,diagptr;
  bool_t flag;
  dim_t n=A->pattern->numOutput;
  if (A->pattern->type & PATTERN_FORMAT_SYM) {
    Paso_setError(TYPE_ERROR,"Paso_Pattern_mis: symmetric matrix pattern is not supported yet");
    return;
  }
   
     /* is there any vertex available ?*/
     while (Paso_Util_isAny(n,mis_marker,IS_AVAILABLE)) {

           #pragma omp parallel for private(i,iptr,flag) schedule(static) 
           for (i=0;i<n;++i) {
              if (mis_marker[i]==IS_AVAILABLE) {
                 flag=IS_IN_MIS;
                 diagptr=A->pattern->ptr[i];
                 index=&(A->pattern->index[diagptr]);
                 where_p=(index_t*)bsearch(&i,
                                        index,
                                        A->pattern->ptr[i + 1]-A->pattern->ptr[i],
                                        sizeof(index_t),
                                        Paso_comparIndex);
                if (where_p==NULL) {
                    Paso_setError(VALUE_ERROR, "Paso_Solver_getAMG: main diagonal element missing.");
                } else {
                    diagptr+=(index_t)(where_p-index);
                }
                 for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
                     j=A->pattern->index[iptr]-index_offset;
                     if (j!=i && A->val[iptr]>=threshold*A->val[diagptr]) {
                        flag=IS_AVAILABLE;
                        break;
                     }
                 }
                 mis_marker[i]=flag;
                }
            }
           
              #pragma omp parallel for private(i,iptr) schedule(static)
              for (i=0;i<n;i++) {
               if (mis_marker[i]==IS_AVAILABLE) {
                 diagptr=A->pattern->ptr[i];
                 index=&(A->pattern->index[diagptr]);
                 where_p=(index_t*)bsearch(&i,
                                        index,
                                        A->pattern->ptr[i + 1]-A->pattern->ptr[i],
                                        sizeof(index_t),
                                        Paso_comparIndex);
                if (where_p==NULL) {
                    Paso_setError(VALUE_ERROR, "Paso_Solver_getAMG: main diagonal element missing.");
                } else {
                    diagptr+=(index_t)(where_p-index);
                }
                 for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
                     j=A->pattern->index[iptr]-index_offset;
                     if (j!=i && mis_marker[j]==IS_IN_MIS && (A->val[iptr]/A->val[diagptr])>=-threshold){
                         mis_marker[i]=IS_IN_MIS;
                     }
                     else {
                         mis_marker[i]=IS_CONNECTED_TO_MIS;
                     }
                 }
               }
              } 
        }
     /* swap to TRUE/FALSE in mis_marker */
     #pragma omp parallel for private(i) schedule(static)
     for (i=0;i<n;i++) mis_marker[i]=(mis_marker[i]==IS_IN_MIS);
}

/*
 *
 * Return a strength of connection mask using the classical 
 * strength of connection measure by Ruge and Stuben.
 *
 * Specifically, an off-diagonal entry A[i.j] is a strong 
 * connection if:
 *  
 *      -A[i,j] >= theta * max( -A[i,k] )   where k != i
 * 
 * Otherwise, the connection is weak.
 *  
 */  
void Paso_Pattern_RS(Paso_SparseMatrix* A, index_t* mis_marker, double theta) 
{
  index_t index_offset=(A->pattern->type & PATTERN_FORMAT_OFFSET1 ? 1:0);
  dim_t i,j;
  index_t iptr;
  double threshold,min_offdiagonal;
  bool_t flag;
  dim_t n=A->pattern->numOutput;
  if (A->pattern->type & PATTERN_FORMAT_SYM) {
    Paso_setError(TYPE_ERROR,"Paso_Pattern_RS: symmetric matrix pattern is not supported yet");
    return;
  }

/* is there any vertex available ?*/
     if (Paso_Util_isAny(n,mis_marker,IS_AVAILABLE)) {

     #pragma omp parallel for private(i,iptr,min_offdiagonal,threshold) schedule(static) 
      for (i=0;i<n;++i) {
        min_offdiagonal = A->val[A->pattern->ptr[i]-index_offset];
        for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
            if(A->pattern->index[iptr] != i){
                min_offdiagonal = MIN(min_offdiagonal,A->val[iptr-index_offset]);
            }
        }

        threshold = theta*min_offdiagonal;
        mis_marker[i]=IS_CONNECTED_TO_MIS;
        #pragma omp parallel for private(iptr) schedule(static) 
        for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
            if(-1.*(A->val[iptr-index_offset]) <= threshold){
                    mis_marker[i]=IS_IN_MIS;
            }
        }
      }
    }
     /* swap to TRUE/FALSE in mis_marker */
     #pragma omp parallel for private(i) schedule(static)
     for (i=0;i<n;i++) mis_marker[i]=(mis_marker[i]==IS_IN_MIS);
}
#undef IS_AVAILABLE 
#undef IS_IN_MIS_NOW 
#undef IS_IN_MIS 
#undef IS_CONNECTED_TO_MIS 
1	jfenwick	1851
2			/*******************************************************
3			*
4			* Copyright (c) 2003-2008 by University of Queensland
5			* Earth Systems Science Computational Center (ESSCC)
6			* http://www.uq.edu.au/esscc
7			*
8			* Primary Business: Queensland, Australia
9			* Licensed under the Open Software License version 3.0
10			* http://www.opensource.org/licenses/osl-3.0.php
11			*
12			*******************************************************/
13
14
15			/**********************************************************************/
16
17			/* Paso: Pattern: Paso_Pattern_coupling
18
19			searches for a maximal independent set MIS in the matrix pattern
20			vertices in the maximal independent set are marked in mis_marker
21			nodes to be considered are marked by -1 on the input in mis_marker
22
23			*/
24			/**********************************************************************/
25
26			/* Copyrights by ACcESS Australia 2003,2004,2005 */
27			/* Author: artak@uq.edu.au */
28
29			/**************************************************************/
30
31	phornby	1914	#include "PasoUtil.h"
32	phornby	1913	#include "Pattern_coupling.h"
33	jfenwick	1851
34
35			/***************************************************************/
36
37			#define IS_AVAILABLE -1
38			#define IS_IN_MIS_NOW -2
39			#define IS_IN_MIS -3
40			#define IS_CONNECTED_TO_MIS -4
41
42	artak	1890
43
44	artak	1882	void Paso_Pattern_coup(Paso_SparseMatrix* A, index_t* mis_marker) {
45	jfenwick	1851
46			index_t index_offset=(A->pattern->type & PATTERN_FORMAT_OFFSET1 ? 1:0);
47	artak	1881	dim_t i,j;
48	jfenwick	1851	double threshold=0.05;
49	artak	1902	index_t iptr,index,where_p,diagptr;
50	jfenwick	1851	bool_t flag;
51			dim_t n=A->pattern->numOutput;
52			if (A->pattern->type & PATTERN_FORMAT_SYM) {
53			Paso_setError(TYPE_ERROR,"Paso_Pattern_mis: symmetric matrix pattern is not supported yet");
54			return;
55			}
56
57			/* is there any vertex available ?*/
58			while (Paso_Util_isAny(n,mis_marker,IS_AVAILABLE)) {
59
60	phornby	1907	#pragma omp parallel for private(i,iptr,flag) schedule(static)
61	jfenwick	1851	for (i=0;i<n;++i) {
62			if (mis_marker[i]==IS_AVAILABLE) {
63	artak	1902	flag=IS_IN_MIS;
64			diagptr=A->pattern->ptr[i];
65			index=&(A->pattern->index[diagptr]);
66			where_p=(index_t*)bsearch(&i,
67			index,
68			A->pattern->ptr[i + 1]-A->pattern->ptr[i],
69			sizeof(index_t),
70			Paso_comparIndex);
71			if (where_p==NULL) {
72			Paso_setError(VALUE_ERROR, "Paso_Solver_getAMG: main diagonal element missing.");
73			} else {
74			diagptr+=(index_t)(where_p-index);
75			}
76	jfenwick	1851	for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
77	artak	1902	j=A->pattern->index[iptr]-index_offset;
78			if (j!=i && A->val[iptr]>=threshold*A->val[diagptr]) {
79			flag=IS_AVAILABLE;
80	jfenwick	1851	break;
81			}
82			}
83			mis_marker[i]=flag;
84	artak	1902	}
85			}
86
87	phornby	1907	#pragma omp parallel for private(i,iptr) schedule(static)
88	artak	1902	for (i=0;i<n;i++) {
89			if (mis_marker[i]==IS_AVAILABLE) {
90			diagptr=A->pattern->ptr[i];
91			index=&(A->pattern->index[diagptr]);
92			where_p=(index_t*)bsearch(&i,
93			index,
94			A->pattern->ptr[i + 1]-A->pattern->ptr[i],
95			sizeof(index_t),
96			Paso_comparIndex);
97			if (where_p==NULL) {
98			Paso_setError(VALUE_ERROR, "Paso_Solver_getAMG: main diagonal element missing.");
99			} else {
100			diagptr+=(index_t)(where_p-index);
101			}
102	jfenwick	1851	for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
103	artak	1902	j=A->pattern->index[iptr]-index_offset;
104			if (j!=i && mis_marker[j]==IS_IN_MIS && (A->val[iptr]/A->val[diagptr])>=-threshold){
105	artak	1881	mis_marker[i]=IS_IN_MIS;
106	artak	1883	}
107			else {
108	artak	1881	mis_marker[i]=IS_CONNECTED_TO_MIS;
109	artak	1883	}
110	jfenwick	1851	}
111	artak	1902	}
112			}
113			}
114	jfenwick	1851	/* swap to TRUE/FALSE in mis_marker */
115			#pragma omp parallel for private(i) schedule(static)
116			for (i=0;i<n;i++) mis_marker[i]=(mis_marker[i]==IS_IN_MIS);
117			}
118	artak	1890
119			/*
120			*
121			* Return a strength of connection mask using the classical
122			* strength of connection measure by Ruge and Stuben.
123			*
124			* Specifically, an off-diagonal entry A[i.j] is a strong
125			* connection if:
126			*
127			* -A[i,j] >= theta * max( -A[i,k] ) where k != i
128			*
129			* Otherwise, the connection is weak.
130			*
131			*/
132			void Paso_Pattern_RS(Paso_SparseMatrix* A, index_t* mis_marker, double theta)
133			{
134			index_t index_offset=(A->pattern->type & PATTERN_FORMAT_OFFSET1 ? 1:0);
135			dim_t i,j;
136	phornby	1907	index_t iptr;
137	artak	1890	double threshold,min_offdiagonal;
138			bool_t flag;
139			dim_t n=A->pattern->numOutput;
140			if (A->pattern->type & PATTERN_FORMAT_SYM) {
141	artak	1902	Paso_setError(TYPE_ERROR,"Paso_Pattern_RS: symmetric matrix pattern is not supported yet");
142	artak	1890	return;
143			}
144
145			/* is there any vertex available ?*/
146	artak	1902	if (Paso_Util_isAny(n,mis_marker,IS_AVAILABLE)) {
147	artak	1890
148	artak	1902	#pragma omp parallel for private(i,iptr,min_offdiagonal,threshold) schedule(static)
149	artak	1890	for (i=0;i<n;++i) {
150	artak	1902	min_offdiagonal = A->val[A->pattern->ptr[i]-index_offset];
151	artak	1890	for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
152			if(A->pattern->index[iptr] != i){
153	artak	1902	min_offdiagonal = MIN(min_offdiagonal,A->val[iptr-index_offset]);
154	artak	1890	}
155			}
156
157			threshold = theta*min_offdiagonal;
158	artak	1902	mis_marker[i]=IS_CONNECTED_TO_MIS;
159	artak	1890	#pragma omp parallel for private(iptr) schedule(static)
160			for (iptr=A->pattern->ptr[i]-index_offset;iptr<A->pattern->ptr[i+1]-index_offset; ++iptr) {
161	artak	1902	if(-1.*(A->val[iptr-index_offset]) <= threshold){
162	artak	1890	mis_marker[i]=IS_IN_MIS;
163			}
164			}
165			}
166			}
167			/* swap to TRUE/FALSE in mis_marker */
168			#pragma omp parallel for private(i) schedule(static)
169			for (i=0;i<n;i++) mis_marker[i]=(mis_marker[i]==IS_IN_MIS);
170			}
171	jfenwick	1851	#undef IS_AVAILABLE
172			#undef IS_IN_MIS_NOW
173			#undef IS_IN_MIS
174			#undef IS_CONNECTED_TO_MIS