Wiedemann Class Reference

#include <wiedemann.h>

Inheritance diagram for Wiedemann:

---

Detailed Description

solutions all based on Wiedemann's algorithm.

Public Member Functions
template<class Polynomial, class Blackbox> Polynomial &	minpoly (Polynomial &P, const Blackbox &A)
	Minimal polynomial of a blackbox linear operator A.
template<class Element, class Blackbox> Element &	determinant (Element &det, Blackbox &A)
	A Monte Carlo algorithm: The field must be large.
template<class Blackbox> unsigned long &	rank (unsigned long &res, const Blackbox &A)
	r <-- rank of A.
template<class Element, class Blackbox> Element &	trace (Element &res, const Blackbox &A)
	via application to cols of identity matrix.
Data Fields
MethodTrait::Wiedemann	M

---

Member Function Documentation

Polynomial& minpoly (  Polynomial &  P, const Blackbox &  A )  [inline]

Minimal polynomial of a blackbox linear operator A. The resulting polynomial is a vector of coefficients. Somewhere we should document our handling of polys. A Monte Carlo algorithm: The field must be large. Reimplemented from SolverConcept.

Element& determinant (  Element &  det, Blackbox &  A )  [inline]

A Monte Carlo algorithm: The field must be large. Reimplemented from SolverConcept.

unsigned long& rank (  unsigned long &  res, const Blackbox &  A )  [inline]

r <-- rank of A. Reimplemented from SolverConcept.

Element& trace (  Element &  res, const Blackbox &  A )  [inline]

via application to cols of identity matrix. Reimplemented from SolverConcept.

---

Field Documentation

MethodTrait::Wiedemann M

---