triu_Pattern

Source: tests/sparse/triu.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/sparse/Pattern.h>
#include <myramath/sparse/PatternRange.h>
#include <myramath/sparse/SparseMatrix.h>
#include <myramath/sparse/SparseMatrixRange.h>

// Algorithms.
#include <myramath/sparse/triu.h>
#include <myramath/dense/triu.h>
#include <myramath/dense/frobenius.h>

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

using namespace myra;

namespace {

template<class Number> void test(int I, int J, int N, typename ReflectPrecision<Number>::type tolerance)
  {
  myra::out() << typestring<Number>() << std::endl;    
  typedef typename ReflectPrecision<Number>::type Precision;
  // Make random SparseMatrix A.
  auto A = SparseMatrix<Number>::random(I,J,N);
  // Compare sparse triu() against dense triu()
  Precision error = frobenius( triu(A).make_Matrix() - triu(A.make_Matrix()) );
  myra::out() << "|triu(A)(sparse) - triu(A)(dense)| = " << error << std::endl;
  REQUIRE(error < tolerance);
  }

void test(int I, int J, int N)
  {
  auto A = Pattern::random(I,J,N);
  auto U = triu(A);
  bool ok = true;
  // Check all nonzeros in upper triangle of A are present in U.
  for (auto iterator = A.begin(); iterator != A.end(); ++iterator)
    {
    int i = iterator.i();
    int j = iterator.j();
    if (i <= j)
      if (!U.test(i,j))
        ok = false;
    }
  // Check that U contains no nonzeros in its lower triangle.
  for (auto iterator = U.begin(); iterator != U.end(); ++iterator)
    if (iterator.i() > iterator.j())
      ok = false;
  REQUIRE(ok);
  }

} // namespace

ADD_TEST("triu","[sparse]")
  {
  test<NumberS>(20,30,150,1.0e-4f);
  test<NumberD>(20,30,150,1.0e-12);
  test<NumberC>(20,30,150,1.0e-4f);
  test<NumberZ>(20,30,150,1.0e-12);

  test<NumberS>(30,20,150,1.0e-4f);
  test<NumberD>(30,20,150,1.0e-12);
  test<NumberC>(30,20,150,1.0e-4f);
  test<NumberZ>(30,20,150,1.0e-12);
  }

ADD_TEST("triu_Pattern","[sparse]")
  {
  test(20,30,150);
  test(30,20,150);
  }

Results: [PASS]

Go back to Summary of /test programs.