multifrontal_schur_rankk1

Source: tests/multifrontal/detail/multifrontal_schur_rankk.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/sparse/Permutation.h>
#include <myramath/sparse/Pattern.h>
#include <myramath/sparse/PatternRange.h>
#include <myramath/sparse/PatternBuilder.h>
#include <myramath/multifrontal/symbolic/AssemblyTree.h>
#include <myramath/multifrontal/symbolic/SchurTree.h>

// Algorithms.
#include <myramath/sparse/laplacian3.h>

// JobGraph under test.
#include <myramath/jobgraph/verify.h>
#include <myramath/jobgraph/graphviz.h>
#include <myramath/multifrontal/detail/schurrankk.h>

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

using namespace myra;
typedef multifrontal::Options Options;

ADD_TEST("multifrontal_schur_rankk1","[multifrontal][jobgraph]")
  {
  // Construct AssemblyTree of a 3D laplacian.
  int I = 21;
  int J = 21;
  int K = 21;
  int N = I*J*K;
  Pattern A_pattern = stencil3(I,J,K);
  Permutation perm = bisect3(I,J,K);
  AssemblyTree atree(A_pattern,perm);
  // Construct SchurTree for k=0 plane.  
  Natural3D n(I,J,K);
  PatternBuilder B_builder(N,I*J);
  int next = 0;
  for (int i = 0; i < I; ++i)
    for (int j = 0; j < J; ++j)
      B_builder.insert(n(i,j,0),next++);
  Pattern B_pattern = B_builder.make_Pattern();
  SchurTree stree(atree,B_pattern);
  // Verify the JobGraph.
  typedef ::multifrontal::detail::schurrankk::JobGraphBase1 Graph;
  Graph graph(&stree);
  REQUIRE( verify(graph) );
  // Save .dot file to disk?
  graphviz(graph,"graph2.dot");
  }

ADD_TEST("multifrontal_schur_rankk2","[multifrontal]")
  {
  // Make diagonal Pattern for A.
  int N = 10;
  PatternBuilder A_builder(N,N);
  for (int n = 0; n < N; ++n)
    A_builder.insert(n,n);
  Pattern A_pattern = A_builder.make_Pattern();
  auto perm = Permutation::identity(N);
  typedef multifrontal::Options Options;
  Options options = Options::create().set_blocksize(1).set_globsize(1);
  AssemblyTree atree(A_pattern,perm,options);
  // Construct SchurTree for single-column SparseMatrix, containing [1 0 1 0 1 0 .. ]
  PatternBuilder B_builder(N,1);
  int next = 0;
  for (int n = 0; n < N; n+=2)
    B_builder.insert(n,0);
  Pattern B_pattern = B_builder.make_Pattern();
  SchurTree stree(atree,B_pattern,options);
  // Verify the JobGraph.
  typedef ::multifrontal::detail::schurrankk::JobGraphBase1 Graph;
  Graph graph(&stree);
  REQUIRE( verify(graph) );
  // Save .dot file to disk?
  graphviz(graph,"graph2.dot");
  }

Results: [PASS]

Go back to Summary of /test programs.