tgb_sparse_matrix Class Reference

#include <tgbgauss.h>

Public Member Functions
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)

Private Attributes
ring	r
mac_poly *	mp
int	columns
int	rows
BOOLEAN	free_numbers

Friends
poly	free_row_to_poly (tgb_sparse_matrix *mat, int row, poly *monoms, int monom_index)
void	init_with_mac_poly (tgb_sparse_matrix *mat, int row, mac_poly m)

Detailed Description

Definition at line 60 of file tgbgauss.h.

Constructor & Destructor Documentation

tgb_sparse_matrix()

tgb_sparse_matrix::tgb_sparse_matrix	(	int	i,
		int	j,
		ring	rarg
	)

Definition at line 645 of file tgbgauss.cc.

{
  mp=(mac_poly*) omAlloc(i*sizeof (mac_poly));;
  int z;
  for(z=0;z<i;z++)
  {
    mp[z]=NULL;
  }
  columns=j;
  rows=i;
  free_numbers=FALSE;
  r=rarg;
}

~tgb_sparse_matrix()

tgb_sparse_matrix::~tgb_sparse_matrix

(

)

Definition at line 659 of file tgbgauss.cc.

{
  int z;
  for(z=0;z<rows;z++)
  {
    if(mp[z]!=NULL)
    {
      if(free_numbers)
      {
        mac_destroy(mp[z]);
      }
      else {
        while(mp[z]!=NULL)
        {
          mac_poly next=mp[z]->next;
          delete mp[z];
          mp[z]=next;
        }
      }
    }
  }
  omfree(mp);
}

Member Function Documentation

add_lambda_times_row()

void tgb_sparse_matrix::add_lambda_times_row	(	int	add_to,
		int	summand,
		number	factor
	)

Definition at line 909 of file tgbgauss.cc.

{
  mp[add_to]= mac_p_add_ff_qq(mp[add_to], factor,mp[summand]);
}

free_row()

void tgb_sparse_matrix::free_row	(	int	row,
		BOOLEAN	free_non_zeros = TRUE
	)

Definition at line 928 of file tgbgauss.cc.

{
  if(free_non_zeros)
    mac_destroy(mp[row]);
  else
  {
    while(mp[row]!=NULL)
    {
      mac_poly next=mp[row]->next;
      delete mp[row];
      mp[row]=next;
    }
  }
  mp[row]=NULL;
}

get()

number tgb_sparse_matrix::get	(	int	i,
		int	j
	)

Definition at line 766 of file tgbgauss.cc.

{
  assume(i<rows);
  assume(j<columns);
  mac_poly rr=mp[i];
  while((rr!=NULL)&&(rr->exp<j))
    rr=rr->next;
  if ((rr==NULL)||(rr->exp>j))
  {
    number n=nInit(0);
    return n;
  }
  assume(rr->exp==j);
  return rr->coef;
}

get_columns()

int tgb_sparse_matrix::get_columns

(

)

Definition at line 761 of file tgbgauss.cc.

{
  return columns;
}

get_rows()

int tgb_sparse_matrix::get_rows

(

)

Definition at line 756 of file tgbgauss.cc.

{
  return rows;
}

is_zero_entry()

BOOLEAN tgb_sparse_matrix::is_zero_entry	(	int	i,
		int	j
	)

Definition at line 782 of file tgbgauss.cc.

{
  assume(i<rows);
  assume(j<columns);
  mac_poly rr=mp[i];
  while((rr!=NULL)&&(rr->exp<j))
    rr=rr->next;
  if ((rr==NULL)||(rr->exp>j))
  {
    return TRUE;
  }
  assume(!nIsZero(rr->coef));
  assume(rr->exp==j);
  return FALSE;
}

min_col_not_zero_in_row()

int tgb_sparse_matrix::min_col_not_zero_in_row

(

int

row

)

Definition at line 798 of file tgbgauss.cc.

{
  if(mp[row]!=NULL)
  {
    assume(!nIsZero(mp[row]->coef));
    return mp[row]->exp;
  }
  else
    return columns;//error code
}

mult_row()

void tgb_sparse_matrix::mult_row	(	int	row,
		number	factor
	)

Definition at line 914 of file tgbgauss.cc.

{
  if (nIsZero(factor))
  {
    mac_destroy(mp[row]);
    mp[row]=NULL;
 
    return;
  }
  if(nIsOne(factor))
    return;
  mac_mult_cons(mp[row],factor);
}

next_col_not_zero()

int tgb_sparse_matrix::next_col_not_zero	(	int	row,
		int	pre
	)

Definition at line 809 of file tgbgauss.cc.

{
  mac_poly rr=mp[row];
  while((rr!=NULL)&&(rr->exp<=pre))
    rr=rr->next;
  if(rr!=NULL)
  {
    assume(!nIsZero(rr->coef));
    return rr->exp;
  }
  return columns;//error code
}

non_zero_entries()

int tgb_sparse_matrix::non_zero_entries

(

int

row

)

Definition at line 903 of file tgbgauss.cc.

{
  return mac_length(mp[row]);
}

perm_rows()

void tgb_sparse_matrix::perm_rows ( int  i, int  j  )

inline

Definition at line 80 of file tgbgauss.h.

                              {
  mac_poly h;
  h=mp[i];
  mp[i]=mp[j];
  mp[j]=h;
  }

print()

void tgb_sparse_matrix::print

(

)

Definition at line 698 of file tgbgauss.cc.

{
  int i;
  int j;
  PrintLn();
  for(i=0;i<rows;i++)
  {
    PrintS("(");
    for(j=0;j<columns;j++)
    {
      StringSetS("");
      number n=get(i,j);
      n_Write(n,currRing->cf);
      char *s=StringEndS();
      PrintS(s);
      omFree(s);
      PrintS("\t");
    }
    PrintS(")\n");
  }
}

row_content()

void tgb_sparse_matrix::row_content

(

int

row

)

Definition at line 847 of file tgbgauss.cc.

{
  mac_poly ph=mp[row];
  number h,d;
  mac_poly p;
 
  if(TEST_OPT_CONTENTSB) return;
  if(ph->next==NULL)
  {
    nDelete(&ph->coef);
    ph->coef=nInit(1);
  }
  else
  {
    nNormalize(ph->coef);
    if(!nGreaterZero(ph->coef))
    {
      p=ph;
      while(p!=NULL)
      {
        p->coef=nInpNeg(p->coef);
        p=p->next;
      }
    }
    if (currRing->cf->cfGcd==ndGcd) return;
 
    h=nCopy(ph->coef);
    p = ph->next;
 
    while (p!=NULL)
    {
      nNormalize(p->coef);
      d=n_Gcd(h,p->coef,currRing->cf);
      nDelete(&h);
      h = d;
      if(nIsOne(h))
      {
        break;
      }
      p=p->next;
    }
    p = ph;
    //number tmp;
    if(!nIsOne(h))
    {
      while (p!=NULL)
      {
        d = nExactDiv(p->coef,h);
        nDelete(&p->coef);
        p->coef=d;
        p=p->next;
      }
    }
    nDelete(&h);
  }
}

row_normalize()

void tgb_sparse_matrix::row_normalize

(

int

row

)

Definition at line 831 of file tgbgauss.cc.

{
  if (!rField_has_simple_inverse(r))  /* Z/p, GF(p,n), R, long R/C */
  {
    mac_poly m=mp[row];
    while (m!=NULL)
    {
      #ifndef SING_NDEBUG
      if (currRing==r) {nTest(m->coef);}
      #endif
      n_Normalize(m->coef,r->cf);
      m=m->next;
    }
  }
}

set()

void tgb_sparse_matrix::set	(	int	i,
		int	j,
		number	n
	)

Definition at line 721 of file tgbgauss.cc.

{
  assume(i<rows);
  assume(j<columns);
  mac_poly* set_this=&mp[i];
  //  while(((*set_this)!=NULL)&&((*set_this)\AD>exp<j))
  while(((*set_this)!=NULL) && ((*set_this)->exp<j))
    set_this=&((*set_this)->next);
 
  if (((*set_this)==NULL)||((*set_this)->exp>j))
  {
    if (nIsZero(n)) return;
    mac_poly old=(*set_this);
    (*set_this)=new mac_poly_r();
    (*set_this)->exp=j;
    (*set_this)->coef=n;
    (*set_this)->next=old;
    return;
  }
  assume((*set_this)->exp==j);
  if(!nIsZero(n))
  {
    nDelete(&(*set_this)->coef);
    (*set_this)->coef=n;
  }
  else
  {
    nDelete(&(*set_this)->coef);
    mac_poly dt=(*set_this);
    (*set_this)=dt->next;
    delete dt;
  }
  return;
}

sort_rows()

void tgb_sparse_matrix::sort_rows

(

)

Definition at line 693 of file tgbgauss.cc.

{
  qsort(mp,rows,sizeof(mac_poly),row_cmp_gen);
}

zero_row()

BOOLEAN tgb_sparse_matrix::zero_row

(

int

row

)

Definition at line 822 of file tgbgauss.cc.

{
  assume((mp[row]==NULL)||(!nIsZero(mp[row]->coef)));
  if (mp[row]==NULL)
    return TRUE;
  else
    return FALSE;
}

Friends And Related Function Documentation

free_row_to_poly

poly free_row_to_poly ( tgb_sparse_matrix *  mat, int  row, poly *  monoms, int  monom_index  )

friend

Definition at line 3118 of file tgb.cc.

{
  poly p = NULL;
  poly *set_this = &p;
  mac_poly r = mat->mp[row];
  mat->mp[row] = NULL;
  while(r)
  {
    (*set_this) = pLmInit (monoms[monom_index - 1 - r->exp]);
    pSetCoeff ((*set_this), r->coef);
    set_this = &((*set_this)->next);
    mac_poly old = r;
    r = r->next;
    delete old;
 
  }
  return p;
}

init_with_mac_poly

void init_with_mac_poly ( tgb_sparse_matrix *  mat, int  row, mac_poly  m  )

friend

Definition at line 3103 of file tgb.cc.

{
  assume (mat->mp[row] == NULL);
  mat->mp[row] = m;
#ifdef TGB_DEBUG
  mac_poly r = m;
  while(r)
  {
    assume (r->exp < mat->columns);
    r = r->next;
  }
#endif
}

Field Documentation

columns

int tgb_sparse_matrix::columns

private

Definition at line 65 of file tgbgauss.h.

free_numbers

BOOLEAN tgb_sparse_matrix::free_numbers

private

Definition at line 67 of file tgbgauss.h.

mp

mac_poly* tgb_sparse_matrix::mp

private

Definition at line 64 of file tgbgauss.h.

r

ring tgb_sparse_matrix::r

private

Definition at line 63 of file tgbgauss.h.

rows

int tgb_sparse_matrix::rows

private

Definition at line 66 of file tgbgauss.h.

---

The documentation for this class was generated from the following files:

• kernel/GBEngine/tgbgauss.h
• kernel/GBEngine/tgbgauss.cc