Definition in file matrixof.h.
Go to the source code of this file.
Namespaces | |
namespace | matrixof |
Functions | |
template<class R> | |
void | matrixof::reserve (R &A, typename R::size_type nl, typename R::size_type nc, typename R::size_type nz) |
template<class C, class R> | |
void | matrixof::reserve (MatrSps< C, R > &A, typename R::size_type nl, typename R::size_type nc, typename R::size_type nz) |
template<class R, class C> | |
void | matrixof::assigncoeff (R &A, unsigned int m, unsigned int n, const C &c) |
template<class R, class C> | |
void | matrixof::assigncoeff (MatrSps< C, R > &A, unsigned int m, unsigned int n, const C &c) |
template<class R, class L, class LM> | |
R | matrix_of (const L &f, const LM &s, char t) |
template<class R, class L> | |
R | matrix_of (const L &l, char t='N') |
template<class R, class L, class LM> | |
R | MatUpolyOf (const L &f, const LM &s, unsigned int v) |
template<class R, class L> | |
R | MatUpolyOf (const L &l, unsigned int v) |
R matrix_of | ( | const L & | l, | |
char | t = 'N' | |||
) |
Construction of the matrix of coefficients of a list of polynomials. All the monomials are first stored, with coefficient 1, in a polynomial s
. Then, they are indexed (using the stl map
template), according to their order in this polynomial. If t='N'
, the rows are indexed by the index of the monomials in the map
and the column by the index of the polynomials in the list L
. If t='T'
, the transpose of the previous matrix is computed. The list of monomials indexing the coefficients are put in s
.
Definition at line 120 of file matrixof.h.
R matrix_of | ( | const L & | f, | |
const LM & | s, | |||
char | t | |||
) |
Construction of the matrix of coefficients of a list of polynomials. f
corresponding to the sequence of monomials s
. If t='T'
, the columns are indexed by lm
. Otherwise it is the rows.
Definition at line 69 of file matrixof.h.
References matrixof::assigncoeff(), and matrixof::reserve().