doc/html/test_AssemblyTree.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/Permutation.h>
 #include <myramath/multifrontal/symbolic/AssemblyTree.h>

 // Algorithms.
 #include <myramath/sparse/laplacian2.h>
 #include <myramath/multifrontal/Options.h>
 #include <myramath/multifrontal/symbolic/mmd.h>
 #include <myramath/multifrontal/symbolic/reorder.h>

 // Reporting.
 #include <myramath/utility/Timer.h>
 #include <myramath/utility/stlprint.h>
 #include <tests/myratest.h>

 using namespace myra;
 using namespace myra_stlprint;

 ADD_TEST("AssemblyTree","[symbolic]")
   {
   // Define problem size.
   int X = 256;
   int Y = 256;
   // Process command line arguments
   if (myra::argc() == 3)
     {
     X = atoi( myra::argv(1) );
     Y = atoi( myra::argv(2) );
     }
   int N = X*Y;
   myra::out() << "AssemblyTree: " << X << " * " << Y << " = " << N << std::endl;
   myra::out() << std::endl;
   Pattern pattern = stencil2(X,Y);
   // Some relevant reordering-related options.
   typedef ::multifrontal::Options Options;
   Options options = Options::create();
   // Generate permutation using bisect2()
     {
     myra::out() << "Testing bisect()" << std::endl;
     Timer timer;
     Permutation P = bisect2(X,Y);
     myra::out() << "  Reordering time = " << timer.elapsed_time() << std::endl;
     AssemblyTree atree(pattern, P, options);
     myra::out() << "  AssemblyTree time = " << timer.elapsed_time() << std::endl;
     myra::out() << "  #flops = " << static_cast<double> (atree.n_work_llt()) << std::endl;
     myra::out() << "  #words = " << atree.n_words() << std::endl;
     myra::out() << std::endl;
     }
   // Generate permutation using mmd()
     {
     myra::out() << "Testing mmd()" << std::endl;
     Timer timer;
     Permutation perm = mmd(pattern);
     myra::out() << "  Reordering time = " << timer.elapsed_time() << std::endl;
     AssemblyTree atree (pattern, perm, options);
     myra::out() << "  AssemblyTree time = " << timer.elapsed_time() << std::endl;
     myra::out() << "  #flops = " << static_cast<double> (atree.n_work_llt()) << std::endl;
     myra::out() << "  #words = " << atree.n_words() << std::endl;
     myra::out() << std::endl;
     }

   // Generate permutation using reorder()
     {
     myra::out() << "Testing reorder()" << std::endl;
     Timer timer;
     Permutation perm = reorder(pattern);
     myra::out() << "  Reordering time = " << timer.elapsed_time() << std::endl;
     AssemblyTree atree (pattern, perm, options);
     myra::out() << "  AssemblyTree time = " << timer.elapsed_time() << std::endl;
     myra::out() << "  #flops = " << static_cast<double> (atree.n_work_llt()) << std::endl;
     myra::out() << "  #words = " << atree.n_words() << std::endl;
     myra::out() << std::endl;
     }

   }
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

Timer.h
Simplistic timing class, might dispatch to platform specific timers depending upon environment...

myra
Definition: syntax.dox:1

myra::Timer
Measures elapsed time.
Definition: Timer.h:19

myra::mmd
Permutation mmd(const PatternRange &A)
Reorders A for reduced fill-in using multiple minimum degree.

myra_stlprint
Definition: stlprint.h:32

stlprint.h
Routines for printing the contents of various std::container&#39;s to a std::ostream using operator <<...

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

Options.h
Options pack for routines in /multifrontal.

PatternRange.h
Range/Iterator types associated with Pattern.

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

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

Permutation.h
Aggregates a (perm, iperm, swaps) triple into a vocabulary type.

mmd.h
Minimum degree algorithms, for computing fill-minimizing permutations.

reorder.h
Computes a fill-reducing Permutation for a structurally symmetric sparse A.

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

myra::Timer::elapsed_time
double elapsed_time() const
Returns elapsed time in seconds since last call to reset()
Definition: Timer.cpp:18