SparseMatrix

Source: tests/sparse/SparseMatrix.cpp

// ========================================================================= //
// This file is part of MyraMath, copyright (c) 2014-2019 by Ryan A Chilton  //
// and distributed by MyraCore, LLC. See LICENSE.txt for license terms.      //
// ========================================================================= //

// Containers.
#include <myramath/dense/Matrix.h>
#include <myramath/dense/MatrixRange.h>
#include <myramath/dense/DiagonalMatrix.h>
#include <myramath/sparse/SparseMatrix.h>
#include <myramath/sparse/SparseMatrixRange.h>
#include <myramath/sparse/PatternBuilder.h>

// Algorithms.
#include <myramath/utility/random.h>
#include <myramath/dense/frobenius.h>

// Reporting.
#include <tests/myratest.h>

using namespace myra;

namespace {

void test(int I, int J, int N)
  {
  // Make a random SparseMatrix.
  auto A = SparseMatrix<double>::random(I,J,N);  
  double tolerance = 1.0e-12;
  // Testing left()
  int l = random_int(J);
  double l_error = frobenius(A.left(l).make_Matrix()-A.make_Matrix().left(l));
  myra::out() << "  |A.left().make_Matrix() - A.make_Matrix().left()| = " << l_error << std::endl;
  REQUIRE(l_error < tolerance);
  // Testing right()
  int r = random_int(J);
  double r_error = frobenius(A.right(r).make_Matrix()-A.make_Matrix().right(r));
  myra::out() << "  |A.right().make_Matrix() - A.make_Matrix().right()| = " << r_error << std::endl;
  REQUIRE(r_error < tolerance);
  // Testing top()
  int t = random_int(I);
  double t_error = frobenius(A.top(t).make_Matrix()-A.make_Matrix().top(t));
  myra::out() << "  |A.top().make_Matrix() - A.make_Matrix().top()| = " << t_error << std::endl;
  REQUIRE(t_error < tolerance);
  // Testing bottom(1)
  int b = random_int(I);
  double b_error = frobenius(A.bottom(b).make_Matrix()-A.make_Matrix().bottom(b));
  myra::out() << "  |A.bottom().make_Matrix() - A.make_Matrix().bottom()| = " << b_error << std::endl;
  REQUIRE(b_error < tolerance);
  myra::out() << std::endl;
  }

} // namespace

ADD_TEST("SparseMatrix","[sparse]")
  {
  // Small test.
  test(5,5,10);
  // Big test.
  test(51,42,1000);
  // Test when sparsely populated.
  test(10,10,3);
  // Test when densely populated.
  test(12,13,100);
  // Test when empty.
  test(15,19,0);
  }

Results: [PASS]

  |A.left().make_Matrix() - A.make_Matrix().left()| = 0
  |A.right().make_Matrix() - A.make_Matrix().right()| = 0
  |A.top().make_Matrix() - A.make_Matrix().top()| = 0
  |A.bottom().make_Matrix() - A.make_Matrix().bottom()| = 0

  |A.left().make_Matrix() - A.make_Matrix().left()| = 0
  |A.right().make_Matrix() - A.make_Matrix().right()| = 0
  |A.top().make_Matrix() - A.make_Matrix().top()| = 0
  |A.bottom().make_Matrix() - A.make_Matrix().bottom()| = 0

  |A.left().make_Matrix() - A.make_Matrix().left()| = 0
  |A.right().make_Matrix() - A.make_Matrix().right()| = 0
  |A.top().make_Matrix() - A.make_Matrix().top()| = 0
  |A.bottom().make_Matrix() - A.make_Matrix().bottom()| = 0

  |A.left().make_Matrix() - A.make_Matrix().left()| = 0
  |A.right().make_Matrix() - A.make_Matrix().right()| = 0
  |A.top().make_Matrix() - A.make_Matrix().top()| = 0
  |A.bottom().make_Matrix() - A.make_Matrix().bottom()| = 0

  |A.left().make_Matrix() - A.make_Matrix().left()| = 0
  |A.right().make_Matrix() - A.make_Matrix().right()| = 0
  |A.top().make_Matrix() - A.make_Matrix().top()| = 0
  |A.bottom().make_Matrix() - A.make_Matrix().bottom()| = 0

Go back to Summary of /test programs.