linbox
1
|
Repository of functions for rank modulo a prime power by elimination on sparse matrices. More...
#include <smith-form-sparseelim-local.h>
Public Member Functions | |
PowerGaussDomain (const Field &F) | |
The field parameter is the domain over which to perform computations. | |
![]() | |
GaussDomain (const Field &F) | |
The field parameter is the domain over which to perform computations. | |
const Field & | field () |
template<class Matrix > | |
unsigned long & | InPlaceLinearPivoting (unsigned long &rank, Element &determinant, Matrix &A, unsigned long Ni, unsigned long Nj) |
Sparse in place Gaussian elimination with reordering to reduce fill-in. pivots are chosen in sparsest column of sparsest row. This runs in linear overhead. It is similar in spirit but different from Markovitz' approach. | |
template<class Matrix > | |
unsigned long & | NoReordering (unsigned long &rank, Element &determinant, Matrix &LigneA, unsigned long Ni, unsigned long Nj) |
Sparse Gaussian elimination without reordering. | |
template<class Matrix > | |
unsigned long & | LUin (unsigned long &rank, Matrix &A) |
Dense in place LU factorization without reordering. | |
template<class Matrix > | |
unsigned long & | upperin (unsigned long &rank, Matrix &A) |
Dense in place Gaussian elimination without reordering. | |
template<class Matrix > | |
unsigned long & | rankin (unsigned long &rank, Matrix &A, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
unsigned long & | rankin (unsigned long &rank, Matrix &A, unsigned long Ni, unsigned long Nj, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
unsigned long & | rank (unsigned long &rank, const Matrix &A, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
unsigned long & | rank (unsigned long &rank, const Matrix &A, unsigned long Ni, unsigned long Nj, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
Element & | detin (Element &determinant, Matrix &A, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
Element & | detin (Element &determinant, Matrix &A, unsigned long Ni, unsigned long Nj, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
Element & | det (Element &determinant, const Matrix &A, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
template<class Matrix > | |
Element & | det (Element &determinant, const Matrix &A, unsigned long Ni, unsigned long Nj, SparseEliminationTraits::PivotStrategy reord=SparseEliminationTraits::PIVOT_LINEAR) |
Repository of functions for rank modulo a prime power by elimination on sparse matrices.