#include <tgbgauss.h>
|
void | sort_rows () |
|
| tgb_sparse_matrix (int i, int j, ring rarg) |
|
| ~tgb_sparse_matrix () |
|
int | get_rows () |
|
int | get_columns () |
|
void | print () |
|
void | row_normalize (int row) |
|
void | row_content (int row) |
|
void | perm_rows (int i, int j) |
|
void | set (int i, int j, number n) |
|
number | get (int i, int j) |
|
BOOLEAN | is_zero_entry (int i, int j) |
|
void | free_row (int row, BOOLEAN free_non_zeros=TRUE) |
|
int | min_col_not_zero_in_row (int row) |
|
int | next_col_not_zero (int row, int pre) |
|
BOOLEAN | zero_row (int row) |
|
void | mult_row (int row, number factor) |
|
void | add_lambda_times_row (int add_to, int summand, number factor) |
|
int | non_zero_entries (int row) |
|
Definition at line 59 of file tgbgauss.h.
◆ tgb_sparse_matrix()
tgb_sparse_matrix::tgb_sparse_matrix |
( |
int |
i, |
|
|
int |
j, |
|
|
ring |
rarg |
|
) |
| |
◆ ~tgb_sparse_matrix()
tgb_sparse_matrix::~tgb_sparse_matrix |
( |
| ) |
|
◆ add_lambda_times_row()
void tgb_sparse_matrix::add_lambda_times_row |
( |
int |
add_to, |
|
|
int |
summand, |
|
|
number |
factor |
|
) |
| |
◆ free_row()
void tgb_sparse_matrix::free_row |
( |
int |
row, |
|
|
BOOLEAN |
free_non_zeros = TRUE |
|
) |
| |
◆ get()
number tgb_sparse_matrix::get |
( |
int |
i, |
|
|
int |
j |
|
) |
| |
◆ get_columns()
int tgb_sparse_matrix::get_columns |
( |
| ) |
|
◆ get_rows()
int tgb_sparse_matrix::get_rows |
( |
| ) |
|
◆ is_zero_entry()
BOOLEAN tgb_sparse_matrix::is_zero_entry |
( |
int |
i, |
|
|
int |
j |
|
) |
| |
◆ min_col_not_zero_in_row()
int tgb_sparse_matrix::min_col_not_zero_in_row |
( |
int |
row | ) |
|
◆ mult_row()
void tgb_sparse_matrix::mult_row |
( |
int |
row, |
|
|
number |
factor |
|
) |
| |
◆ next_col_not_zero()
int tgb_sparse_matrix::next_col_not_zero |
( |
int |
row, |
|
|
int |
pre |
|
) |
| |
◆ non_zero_entries()
int tgb_sparse_matrix::non_zero_entries |
( |
int |
row | ) |
|
◆ perm_rows()
void tgb_sparse_matrix::perm_rows |
( |
int |
i, |
|
|
int |
j |
|
) |
| |
|
inline |
◆ print()
void tgb_sparse_matrix::print |
( |
| ) |
|
◆ row_content()
void tgb_sparse_matrix::row_content |
( |
int |
row | ) |
|
◆ row_normalize()
void tgb_sparse_matrix::row_normalize |
( |
int |
row | ) |
|
◆ set()
void tgb_sparse_matrix::set |
( |
int |
i, |
|
|
int |
j, |
|
|
number |
n |
|
) |
| |
Definition at line 720 of file tgbgauss.cc.
727 while(((*set_this)!=
NULL) && ((*set_this)->exp<
j))
728 set_this=&((*set_this)->next);
730 if (((*set_this)==
NULL)||((*set_this)->exp>
j))
737 (*set_this)->next=old;
750 (*set_this)=dt->
next;
◆ sort_rows()
void tgb_sparse_matrix::sort_rows |
( |
| ) |
|
◆ zero_row()
BOOLEAN tgb_sparse_matrix::zero_row |
( |
int |
row | ) |
|
◆ free_row_to_poly
poly free_row_to_poly |
( |
tgb_sparse_matrix * |
mat, |
|
|
int |
row, |
|
|
poly * |
monoms, |
|
|
int |
monom_index |
|
) |
| |
|
friend |
Definition at line 3064 of file tgb.cc.
3068 poly *set_this = &
p;
3073 (*set_this) =
pLmInit (monoms[monom_index - 1 -
r->exp]);
3075 set_this = &((*set_this)->next);
◆ init_with_mac_poly
◆ columns
int tgb_sparse_matrix::columns |
|
private |
◆ free_numbers
BOOLEAN tgb_sparse_matrix::free_numbers |
|
private |
◆ mp
ring tgb_sparse_matrix::r |
|
private |
◆ rows
int tgb_sparse_matrix::rows |
|
private |
The documentation for this class was generated from the following files:
static FORCE_INLINE number n_Gcd(number a, number b, const coeffs r)
in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ,...