linbox
Bibliography
Class BlockLanczosSolver< Field, Matrix >
[Montgomery '95]
Class BlockMasseyDomain< _Field, _Sequence >
Giorgi, Jeannerod Villard algorithm from ISSAC'03
Class FullMultipCRA< Domain_Type >
  • Jean-Guillaume Dumas, Thierry Gautier et Jean-Louis Roch. Generic design of Chinese remaindering schemes PASCO 2010, pp 26-34, 21-23 juillet, Grenoble, France.
Global GaussDomain< _Field >::QLUPin (unsigned long &rank, Element &determinant, Perm &Q, Matrix &L, Matrix &U, Perm &P, unsigned long Ni, unsigned long Nj) const
  • Jean-Guillaume Dumas and Gilles Villard, Computing the rank of sparse matrices over finite fields. In Ganzha et~al. CASC'2002, pages 47--62.
Class GivaroRnsFixedCRA< Domain_Type >
Global LinBox::cia (Polynomial &P, const Blackbox &A, const Method::BlasElimination &M)
[Dumas-Pernet-Wan ISSAC05]
Global PID_integer::RationalReconstruction (Element &a, Element &b, const Element &f, const Element &m, const Element &k, bool reduce, bool recursive) const
  • von zur Gathen & Gerhard, Modern Computer Algebra, 5.10, Cambridge Univ. Press 1999
File rational-solver2.h
Implementation of the algorithm in manuscript, available at http://www.cis.udel.edu/~wan/jsc_wan.ps
Class RationalSolver< Ring, Field, RandomPrime, WanTraits >
  • Zhendong Wan Exactly solve integer linear systems using numerical methods. Submitted to Journal of Symbolic Computation, 2004. .
Class SigmaBasis< _Field >
  • P. Giorgi, C.P. Jeannerod and G. Villard. On the complexity of polynomial matrix computations. ISSAC'03 doi.
Class SmithFormIliopoulos
Worst Case Complexity Bounds on Algorithms for computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix, by Costas Iliopoulos.