testSparseMatrixVectorOp.cc

Go to the documentation of this file.

#include <iostream>

#include <utl/SparseVector.h>
#include <utl/SparseMatrix.h>

#include <tst/Verify.h>
#include <cppunit/extensions/HelperMacros.h>

using namespace std;
using namespace utl;
using namespace tst;

#define ASSERT_CLOSE(x, y) CPPUNIT_ASSERT(Verify<CloseTo>(x, y))
#define ASSERT_CLOSE_EPS(x, y, eps) CPPUNIT_ASSERT(Verify<CloseTo>(x, y, eps))
#define ASSERT_EQUAL(x, y) CPPUNIT_ASSERT(Verify<Equal>(x, y))
#define ASSERT_ITERATOR_EQUAL(it, e, i, v) \
  CPPUNIT_ASSERT(it != e); \
  ASSERT_EQUAL(it.GetIndex(), i); \
  ASSERT_EQUAL(it(), v)


class TestSparseMatrixVectorOp : public CppUnit::TestFixture {

  CPPUNIT_TEST_SUITE(TestSparseMatrixVectorOp);
  CPPUNIT_TEST(TestMultiply);
  CPPUNIT_TEST(TestMultiply2);
  CPPUNIT_TEST_SUITE_END();

public:
  void
  TestMultiply()
  {
    SparseMatrix<> m;
    for (int i = 0; i < 10; ++i)
      for (int j = 0; j < 5; ++j) {
        const int s = i + j + 1;
        if (s%2)
          m(i, j) = s;
      }

    SparseVector<> a;
    a(0) = 1; a(2) = -1; a(4) = 1;

    SparseVector<> b = m * a;

    int i = 0;
    for (SparseVector<>::Iterator it = b.SparseBegin();
         it != b.SparseEnd(); ++it, ++i) {
      ASSERT_ITERATOR_EQUAL(it, b.SparseEnd(), 2*i, 2*i + 3.);
    }
  }

  void
  TestMultiply2()
  {
    const int n = 100;
    const int m = 50;

    SparseMatrix<> a;

    for (int i = 0; i < n; ++i)
      for (int j = 0; j < m; ++j)
        a(i, j) = int(i) - 3*int(j);

    SparseVector<> x;

    for (int i = 0; i < m; ++i)
      x(i) = i;

    const SparseVector<> y = a * x;

    for (int i = 0; i < n; ++i)
      ASSERT_EQUAL(y[i],
                   double((i-(2*m-1))*(m-1)*m/2));
  }

};


CPPUNIT_TEST_SUITE_REGISTRATION(TestSparseMatrixVectorOp);


// Configure (x)emacs for this file ...
// Local Variables:
// mode: c++
// End: