|
ViennaCL - The Vienna Computing Library
1.5.1
|
Implementation of the Gibbs-Poole-Stockmeyer algorithm. Experimental. More...
#include <iostream>#include <fstream>#include <string>#include <algorithm>#include <map>#include <vector>#include <deque>#include <cmath>#include "viennacl/forwards.h"#include "viennacl/misc/cuthill_mckee.hpp"Go to the source code of this file.
Data Structures | |
| struct | gibbs_poole_stockmeyer_tag |
| Tag class for identifying the Gibbs-Poole-Stockmeyer algorithm for reducing the bandwidth of a sparse matrix. More... | |
Namespaces | |
| namespace | viennacl |
Main namespace in ViennaCL. Holds all the basic types such as vector, matrix, etc. and defines operations upon them. | |
| namespace | viennacl::detail |
Holds implementation details for functionality in the main viennacl-namespace. Not intended for direct use by library users. | |
Functions | |
| int | calc_layering_width (std::vector< std::vector< int > > const &l) |
| template<typename MatrixType > | |
| std::vector< std::vector< int > > | gps_rg_components (MatrixType const &matrix, int n, std::vector< int > const &rg) |
| template<typename MatrixType > | |
| std::vector< int > | reorder (MatrixType const &matrix, gibbs_poole_stockmeyer_tag) |
| Function for the calculation of a node numbering permutation vector to reduce the bandwidth of a incidence matrix by the Gibbs-Poole-Stockmeyer algorithm. | |
Implementation of the Gibbs-Poole-Stockmeyer algorithm. Experimental.
Contributed by Philipp Grabenweger, interface adjustments by Karl Rupp.
1.7.6.1