Global FFPACK::RandomMatrixWithRank (const Field &F, typename Field::Element_ptr A, size_t lda, size_t r, size_t m, size_t n)
compute LU with ftrtr
Global FFPACK::CharpolyArithProg (const Field &F, std::list< Polynomial > &frobeniusForm, const size_t N, typename Field::Element_ptr A, const size_t lda, const size_t c)
Global launch_MM_dispatch (const Field &F, const int mm, const int nn, const int kk, const typename Field::Element alpha, const typename Field::Element beta, const size_t iters, const int nbw, const bool par, const size_t b)
does nbw actually do nbw recursive calls and then call blas (check ?) ?
Global launch_fger_dispatch (const Field &F, const size_t nn, const typename Field::Element alpha, const size_t iters)
does nbw actually do nbw recursive calls and then call blas (check ?) ?
Global FFLAS::fconvert (const Field &F, const size_t m, const size_t n, OtherElement_ptr A, const size_t lda, typename Field::ConstElement_ptr B, const size_t ldb)
use primitive (no Field()) and specialise for int64.
Global FFLAS::fadd (const Field &F, const size_t N, typename Field::ConstElement_ptr A, const size_t inca, const typename Field::Element alpha, typename Field::ConstElement_ptr B, const size_t incb, typename Field::Element_ptr C, const size_t incc)
optimise here
Global FFLAS::fnegin (const Field &F, const size_t m, const size_t n, typename Field::Element_ptr A, const size_t lda)
check if n == lda
Global FFLAS::fneg (const Field &F, const size_t m, const size_t n, typename Field::ConstElement_ptr B, const size_t ldb, typename Field::Element_ptr A, const size_t lda)
check if n == lda
Global FFLAS::Protected::MatF2MatFl_Triangular (const Field &F, Givaro::FloatDomain::Element_ptr S, const size_t lds, typename Field::ConstElement_ptr const E, const size_t lde, const size_t m, const size_t n)