multifrontal_solve_Right_Lower

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

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

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

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

using namespace myra;

ADD_TEST("multifrontal_solve_Right_Lower","[multifrontal][jobgraph]")
  {
  // Construct AssemblyTree of a 3D laplacian.
  int I = 32;
  int J = 32;
  int K = 32;
  Pattern pattern = stencil3(I,J,K);
  Permutation perm = bisect3(I,J,K);
  AssemblyTree tree(pattern,perm);
  // Presume two right hand sides, blocksize 1.
  int B = 2;
  int blocksize = 1;
  // Verify the JobGraph.
  typedef ::multifrontal::detail::solvel_right::JobGraphBase1 Graph;
  Graph graph(&tree,B,blocksize);
  REQUIRE( verify(graph) );
  // Save .dot file to disk?
  graphviz(graph,"graph2.dot");  
  }

Results: [PASS]

Go back to Summary of /test programs.