|
linbox
|
tests LQUP decomposition, solve, and nullspace of a random sparse matrice. More...
#include "linbox/linbox-config.h"#include <iostream>#include <fstream>#include <cstdio>#include <linbox/matrix/sparse-matrix.h>#include "linbox/algorithms/gauss.h"#include "linbox/algorithms/gauss-gf2.h"#include "linbox/blackbox/permutation.h"#include "linbox/util/commentator.h"#include <givaro/modular.h>#include "linbox/blackbox/diagonal.h"#include "linbox/blackbox/scalar-matrix.h"#include "linbox/blackbox/direct-sum.h"#include "linbox/solutions/rank.h"#include "test-common.h"Macros | |
| #define | STOR_T SparseMatrixFormat::SparseSeq |
Functions | |
| template<class Field, class Blackbox, class RandStream> | |
| bool | testQLUP (const Field &F, size_t n, unsigned int iterations, int rseed, double sparsity=0.05) |
| template<class Field, class Blackbox, class RandStream> | |
| bool | testQLUPsolve (const Field &F, size_t n, unsigned int iterations, int rseed, double sparsity=0.05) |
| template<class Field, class Blackbox, class RandStream> | |
| bool | testQLUPnullspace (const Field &F, size_t n, unsigned int iterations, int rseed, double sparsity=0.05) |
| int | main (int argc, char **argv) |
tests LQUP decomposition, solve, and nullspace of a random sparse matrice.
| #define STOR_T SparseMatrixFormat::SparseSeq |
| bool testQLUP | ( | const Field & | F, |
| size_t | n, | ||
| unsigned int | iterations, | ||
| int | rseed, | ||
| double | sparsity = 0.05 ) |
| bool testQLUPsolve | ( | const Field & | F, |
| size_t | n, | ||
| unsigned int | iterations, | ||
| int | rseed, | ||
| double | sparsity = 0.05 ) |
| bool testQLUPnullspace | ( | const Field & | F, |
| size_t | n, | ||
| unsigned int | iterations, | ||
| int | rseed, | ||
| double | sparsity = 0.05 ) |
| int main | ( | int | argc, |
| char ** | argv ) |