Skip to content

Commit

Permalink
Decomposed SA tests into multiple files
Browse files Browse the repository at this point in the history
  • Loading branch information
@sdalton1
sdalton1 committed May 6, 2016
1 parent 8e8d8c3 commit b373e9d
Show file tree
Hide file tree
Showing 6 changed files with 450 additions and 402 deletions.
42 changes: 42 additions & 0 deletions testing/aggregate.cu
View file
@@ -0,0 +1,42 @@
#include <unittest/unittest.h>

#include <cusp/precond/aggregation/aggregate.h>
#include <cusp/precond/aggregation/detail/sa_view_traits.h>

#include <cusp/array1d.h>
#include <cusp/array2d.h>
#include <cusp/coo_matrix.h>
#include <cusp/csr_matrix.h>

#include <cusp/gallery/poisson.h>

template <class MemorySpace>
void TestStandardAggregate(void)
{
// TODO make this test something, possibly disjoint things that must aggregate

typedef typename cusp::precond::aggregation::detail::select_sa_matrix_type<int,float,MemorySpace>::type SetupMatrixType;

SetupMatrixType A;
cusp::gallery::poisson5pt(A, 10, 10);

cusp::array1d<int,MemorySpace> aggregates(A.num_rows);
cusp::precond::aggregation::standard_aggregate(A, aggregates);
}
DECLARE_HOST_DEVICE_UNITTEST(TestStandardAggregate);

template <class MemorySpace>
void TestMISAggregate(void)
{
// TODO make this test something, possibly disjoint things that must aggregate

typedef typename cusp::precond::aggregation::detail::select_sa_matrix_type<int,float,MemorySpace>::type SetupMatrixType;

SetupMatrixType A;
cusp::gallery::poisson5pt(A, 10, 10);

cusp::array1d<int,MemorySpace> aggregates(A.num_rows);
cusp::precond::aggregation::mis_aggregate(A, aggregates);
}
DECLARE_HOST_DEVICE_UNITTEST(TestMISAggregate);

153 changes: 153 additions & 0 deletions testing/smooth_prolongator.cu
View file
@@ -0,0 +1,153 @@
#include <unittest/unittest.h>

#include <cusp/precond/aggregation/smooth_prolongator.h>
#include <cusp/precond/aggregation/detail/sa_view_traits.h>

#include <cusp/coo_matrix.h>

template <class MemorySpace>
void TestSmoothProlongator(void)
{
typedef typename cusp::precond::aggregation::detail::select_sa_matrix_type<int,float,MemorySpace>::type SetupMatrixType;

// simple example with diagonal S
{
cusp::coo_matrix<int,float,MemorySpace> _S(4,4,4);
_S.row_indices[0] = 0;
_S.column_indices[0] = 0;
_S.values[0] = 1;
_S.row_indices[1] = 1;
_S.column_indices[1] = 1;
_S.values[1] = 2;
_S.row_indices[2] = 2;
_S.column_indices[2] = 2;
_S.values[2] = 3;
_S.row_indices[3] = 3;
_S.column_indices[3] = 3;
_S.values[3] = 4;
SetupMatrixType S(_S);

cusp::coo_matrix<int,float,MemorySpace> _T(4,2,4);
_T.row_indices[0] = 0;
_T.column_indices[0] = 0;
_T.values[0] = 0.5;
_T.row_indices[1] = 1;
_T.column_indices[1] = 0;
_T.values[1] = 0.5;
_T.row_indices[2] = 2;
_T.column_indices[2] = 1;
_T.values[2] = 0.5;
_T.row_indices[3] = 3;
_T.column_indices[3] = 1;
_T.values[3] = 0.5;
SetupMatrixType T(_T);

SetupMatrixType _P;

cusp::precond::aggregation::smooth_prolongator(S, T, _P, 2.0f, 4.0f);

cusp::coo_matrix<int,float,MemorySpace> P(_P);

ASSERT_EQUAL(P.num_rows, 4);
ASSERT_EQUAL(P.num_cols, 2);
ASSERT_EQUAL(P.num_entries, 4);

ASSERT_EQUAL(P.row_indices[0], 0);
ASSERT_EQUAL(P.column_indices[0], 0);
ASSERT_EQUAL(P.row_indices[1], 1);
ASSERT_EQUAL(P.column_indices[1], 0);
ASSERT_EQUAL(P.row_indices[2], 2);
ASSERT_EQUAL(P.column_indices[2], 1);
ASSERT_EQUAL(P.row_indices[3], 3);
ASSERT_EQUAL(P.column_indices[3], 1);

ASSERT_EQUAL(P.values[0], -0.5);
ASSERT_EQUAL(P.values[1], -0.5);
ASSERT_EQUAL(P.values[2], -0.5);
ASSERT_EQUAL(P.values[3], -0.5);
}

// 1D Poisson problem w/ 4 points and 2 aggregates
{
cusp::coo_matrix<int,float,MemorySpace> _S(4,4,10);
_S.row_indices[0] = 0;
_S.column_indices[0] = 0;
_S.values[0] = 2;
_S.row_indices[1] = 0;
_S.column_indices[1] = 1;
_S.values[1] =-1;
_S.row_indices[2] = 1;
_S.column_indices[2] = 0;
_S.values[2] =-1;
_S.row_indices[3] = 1;
_S.column_indices[3] = 1;
_S.values[3] = 2;
_S.row_indices[4] = 1;
_S.column_indices[4] = 2;
_S.values[4] =-1;
_S.row_indices[5] = 2;
_S.column_indices[5] = 1;
_S.values[5] =-1;
_S.row_indices[6] = 2;
_S.column_indices[6] = 2;
_S.values[6] = 2;
_S.row_indices[7] = 2;
_S.column_indices[7] = 3;
_S.values[7] =-1;
_S.row_indices[8] = 3;
_S.column_indices[8] = 2;
_S.values[8] =-1;
_S.row_indices[9] = 3;
_S.column_indices[9] = 3;
_S.values[9] = 2;
SetupMatrixType S(_S);

cusp::coo_matrix<int,float,MemorySpace> _T(4,2,4);
_T.row_indices[0] = 0;
_T.column_indices[0] = 0;
_T.values[0] = 0.5;
_T.row_indices[1] = 1;
_T.column_indices[1] = 0;
_T.values[1] = 0.5;
_T.row_indices[2] = 2;
_T.column_indices[2] = 1;
_T.values[2] = 0.5;
_T.row_indices[3] = 3;
_T.column_indices[3] = 1;
_T.values[3] = 0.5;
SetupMatrixType T(_T);

SetupMatrixType _P;

cusp::precond::aggregation::smooth_prolongator(S, T, _P, 1.8090169943749472f, 4.0f/3.0f);

cusp::coo_matrix<int,float,MemorySpace> P(_P);
P.sort_by_row_and_column();

ASSERT_EQUAL(P.num_rows, 4);
ASSERT_EQUAL(P.num_cols, 2);
ASSERT_EQUAL(P.num_entries, 6);

ASSERT_EQUAL(P.row_indices[0], 0);
ASSERT_EQUAL(P.column_indices[0], 0);
ASSERT_EQUAL(P.row_indices[1], 1);
ASSERT_EQUAL(P.column_indices[1], 0);
ASSERT_EQUAL(P.row_indices[2], 1);
ASSERT_EQUAL(P.column_indices[2], 1);
ASSERT_EQUAL(P.row_indices[3], 2);
ASSERT_EQUAL(P.column_indices[3], 0);
ASSERT_EQUAL(P.row_indices[4], 2);
ASSERT_EQUAL(P.column_indices[4], 1);
ASSERT_EQUAL(P.row_indices[5], 3);
ASSERT_EQUAL(P.column_indices[5], 1);

ASSERT_ALMOST_EQUAL(P.values[0], 0.31573787f);
ASSERT_ALMOST_EQUAL(P.values[1], 0.31573787f);
ASSERT_ALMOST_EQUAL(P.values[2], 0.18426213f);
ASSERT_ALMOST_EQUAL(P.values[3], 0.18426213f);
ASSERT_ALMOST_EQUAL(P.values[4], 0.31573787f);
ASSERT_ALMOST_EQUAL(P.values[5], 0.31573787f);
}
}
DECLARE_HOST_DEVICE_UNITTEST(TestSmoothProlongator);

0 comments on commit b373e9d

Please sign in to comment.