doc/html/test_multifrontal_partialsolve_Left_Upper.html

 // ========================================================================= //
 // 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/sparse/PatternBuilder.h>
 #include <myramath/multifrontal/symbolic/AssemblyTree.h>
 #include <myramath/multifrontal/symbolic/SchurTree.h>

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

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

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

 using namespace myra;
 typedef multifrontal::Options Options;

 ADD_TEST("multifrontal_partialsolve_Left_Upper","[multifrontal][jobgraph]")
   {
   // Construct AssemblyTree of a 3D laplacian.
   int I = 32;
   int J = 32;
   int K = 32;
   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,1);
   for (int i = 0; i < I; ++i)
     for (int j = 0; j < J; ++j)
       B_builder.insert(n(i,j,0),0);
   Pattern B_pattern = B_builder.make_Pattern();
   SchurTree stree(atree,B_pattern,Options::create());
   // Presume three right hand sides, blocksize 1.
   std::vector<int> blocking(3,1);
   std::vector<int> striding = cumsum(blocking);
   // Verify the JobGraph.
   typedef ::multifrontal::detail::partialsolveu::JobGraphBase1 Graph;
   Graph graph(&stree,blocking,striding);
   REQUIRE( verify(graph) );
   // Save .dot file to disk?
   graphviz(graph,"graph2.dot");
   }
myra::multifrontal::Options
Options pack for routines in /multifrontal.
Definition: Options.h:24

verify.h
Given a JobGraph G, verifies it has valid topology.

myra::Permutation
Represents a Permutation matrix, used to reorder rows/columns/etc of various numeric containers...
Definition: Permutation.h:34

myra::AssemblyTree
Symbolic analysis data structure for all multifrontal solvers.
Definition: AssemblyTree.h:38

myra::Natural3D
A helper class that generates a natural ordering on a 3D structured grid of size IxJxK.
Definition: laplacian3.h:28

myra::cumsum
std::vector< T > cumsum(const std::vector< T > &v)
Returns cumulative sum. For example, cumsum({4,8,9,13}) = {0,4,12,21,34}.
Definition: cumsum.h:19

PatternBuilder.h
Convenience type for building Pattern&#39;s, uses coordinate/couplet format. Note that PatternBuilder may...

myra::SchurTree
Symbolic analysis data structure for multifrontal schur complement.
Definition: SchurTree.h:42

myra
Definition: syntax.dox:1

AssemblyTree.h
Describes data layout and job dependencies for symmetric-pattern multifrontal solvers.

laplacian3.h
Helper routines for reordering/filling 3D structured grids. Used by many unit tests.

PatternRange.h
Range/Iterator types associated with Pattern.

myra::Pattern
Holds the nonzero pattern of a sparse matrix.
Definition: Pattern.h:55

myra::PatternBuilder
Like Pattern, but easier to populate via insert()/erase() methods.
Definition: PatternBuilder.h:51

Pattern.h
Container class for a sparse nonzero pattern, used in reordering/symbolic analysis.

cumsum.h
Returns cumulative sum of a std::vector<T>. Reversible by diff()

graphviz.h
Given a JobGraph, produces a .dot file for visualization with graphviz.

SchurTree.h
Tabulates data layout and dependencies for multifrontal schur complement.