My Project
Public Member Functions | Data Fields | Protected Attributes | Friends
ModPMatrixProxyOnArray< number_type > Class Template Reference

#include <tgb_internal.h>

Public Member Functions

 ModPMatrixProxyOnArray (number_type *array, int nnrows, int nncols)
 
 ~ModPMatrixProxyOnArray ()
 
void permRows (int i, int j)
 
void multiplyRow (int row, number_type coef)
 
void reduceOtherRowsForward (int r)
 
void updateStartIndex (int row, int lower_bound)
 
int getStartIndex (int row)
 
BOOLEAN findPivot (int &r, int &c)
 

Data Fields

int ncols
 
int nrows
 

Protected Attributes

number_type ** rows
 
int * startIndices
 

Friends

class ModPMatrixBackSubstProxyOnArray< number_type >
 

Detailed Description

template<class number_type>
class ModPMatrixProxyOnArray< number_type >

Definition at line 1501 of file tgb_internal.h.

Constructor & Destructor Documentation

◆ ModPMatrixProxyOnArray()

template<class number_type >
ModPMatrixProxyOnArray< number_type >::ModPMatrixProxyOnArray ( number_type *  array,
int  nnrows,
int  nncols 
)
inline

Definition at line 1507 of file tgb_internal.h.

1508  {
1509  this->ncols=nncols;
1510  this->nrows=nnrows;
1511  rows=(number_type**) omalloc((size_t)nnrows*sizeof(number_type*));
1512  startIndices=(int*)omalloc((size_t)nnrows*sizeof(int));
1513  int i;
1514  for(i=0;i<nnrows;i++)
1515  {
1516  rows[i]=array+((long)i*(long)nncols);
1517  updateStartIndex(i,-1);
1518  }
1519  }
int i
Definition: cfEzgcd.cc:132
void updateStartIndex(int row, int lower_bound)
#define omalloc(size)
Definition: omAllocDecl.h:228

◆ ~ModPMatrixProxyOnArray()

template<class number_type >
ModPMatrixProxyOnArray< number_type >::~ModPMatrixProxyOnArray ( )
inline

Definition at line 1520 of file tgb_internal.h.

1521  {
1522  omfree(rows);
1524  }
#define omfree(addr)
Definition: omAllocDecl.h:237

Member Function Documentation

◆ findPivot()

template<class number_type >
BOOLEAN ModPMatrixProxyOnArray< number_type >::findPivot ( int &  r,
int &  c 
)
inline

Definition at line 1657 of file tgb_internal.h.

1658 {
1659  //row>=r, col>=c
1660 
1661  while(c<ncols)
1662  {
1663  int i;
1664  for(i=r;i<nrows;i++)
1665  {
1666  assume(startIndices[i]>=c);
1667  if (startIndices[i]==c)
1668  {
1669  //r=i;
1670  if (r!=i)
1671  permRows(r,i);
1672  return TRUE;
1673  }
1674  }
1675  c++;
1676  }
1677  return FALSE;
1678 }
#define TRUE
Definition: auxiliary.h:100
#define FALSE
Definition: auxiliary.h:96
void permRows(int i, int j)
#define assume(x)
Definition: mod2.h:389

◆ getStartIndex()

template<class number_type >
int ModPMatrixProxyOnArray< number_type >::getStartIndex ( int  row)
inline

Definition at line 1653 of file tgb_internal.h.

1654 {
1655  return startIndices[row];
1656 }

◆ multiplyRow()

template<class number_type >
void ModPMatrixProxyOnArray< number_type >::multiplyRow ( int  row,
number_type  coef 
)
inline

Definition at line 1535 of file tgb_internal.h.

1536  {
1537  int i;
1538  number_type* row_array=rows[row];
1539  if(currRing->cf->ch<=NV_MAX_PRIME)
1540  {
1541  for(i=startIndices[row];i<ncols;i++)
1542  {
1543  row_array[i]=F4mat_to_number_type(npMult((number)(long) row_array[i],(number)(long) coef,currRing->cf));
1544  }
1545  }
1546  else
1547  {
1548  for(i=startIndices[row];i<ncols;i++)
1549  {
1550  row_array[i]=F4mat_to_number_type(nvMult((number)(long) row_array[i],(number)(long) coef,currRing->cf));
1551  }
1552  }
1553  }
#define NV_MAX_PRIME
Definition: modulop.h:37
static number nvMult(number a, number b, const coeffs r)
Definition: modulop_inl.h:50
static number npMult(number a, number b, const coeffs r)
Definition: modulop_inl.h:12
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:13
#define F4mat_to_number_type(a)
Definition: tgb_internal.h:410

◆ permRows()

template<class number_type >
void ModPMatrixProxyOnArray< number_type >::permRows ( int  i,
int  j 
)
inline

Definition at line 1526 of file tgb_internal.h.

1527  {
1528  number_type* h=rows[i];
1529  rows[i]=rows[j];
1530  rows[j]=h;
1531  int hs=startIndices[i];
1533  startIndices[j]=hs;
1534  }
int j
Definition: facHensel.cc:110
STATIC_VAR Poly * h
Definition: janet.cc:971

◆ reduceOtherRowsForward()

template<class number_type >
void ModPMatrixProxyOnArray< number_type >::reduceOtherRowsForward ( int  r)
inline

Definition at line 1554 of file tgb_internal.h.

1555  {
1556  //assume rows "under r" have bigger or equal start index
1557  number_type* row_array=rows[r];
1558  number_type zero=F4mat_to_number_type((number)0 /*npInit(0, currRing)*/);
1559  int start=startIndices[r];
1560  number_type coef=row_array[start];
1561  assume(start<ncols);
1562  int other_row;
1563  assume(!(npIsZero((number)(long) row_array[start],currRing->cf)));
1564  if (!(npIsOne((number)(long) coef,currRing->cf)))
1565  multiplyRow(r,F4mat_to_number_type(npInversM((number)(long) coef,currRing->cf)));
1566  assume(npIsOne((number)(long) row_array[start],currRing->cf));
1567  int lastIndex=modP_lastIndexRow(row_array, ncols);
1568  number minus_one=npInit(-1, currRing->cf);
1569  if(currRing->cf->ch<=NV_MAX_PRIME)
1570  {
1571  for (other_row=r+1;other_row<nrows;other_row++)
1572  {
1573  assume(startIndices[other_row]>=start);
1574  if (startIndices[other_row]==start)
1575  {
1576  int i;
1577  number_type* other_row_array=rows[other_row];
1578  number coef2=npNegM((number)(long) other_row_array[start],currRing->cf);
1579  if (coef2==minus_one)
1580  {
1581  for(i=start;i<=lastIndex;i++)
1582  {
1583  if (row_array[i]!=zero)
1584  {
1585  other_row_array[i]=F4mat_to_number_type(npSubM((number)(long) other_row_array[i], (number)(long) row_array[i],currRing->cf));
1586  }
1587  }
1588  }
1589  else
1590  {
1591  for(i=start;i<=lastIndex;i++)
1592  {
1593  if (row_array[i]!=zero)
1594  {
1595  other_row_array[i]=F4mat_to_number_type(npAddM(npMult(coef2,(number)(long) row_array[i],currRing->cf),(number)(long) other_row_array[i],currRing->cf));
1596  }
1597  }
1598  }
1599  updateStartIndex(other_row,start);
1600  assume(npIsZero((number)(long) other_row_array[start],currRing->cf));
1601  }
1602  }
1603  }
1604  else /* ch>NV_MAX_PRIME*/
1605  {
1606  for (other_row=r+1;other_row<nrows;other_row++)
1607  {
1608  assume(startIndices[other_row]>=start);
1609  if (startIndices[other_row]==start)
1610  {
1611  int i;
1612  number_type* other_row_array=rows[other_row];
1613  number coef2=npNegM((number)(long) other_row_array[start],currRing->cf);
1614  if (coef2==minus_one)
1615  {
1616  for(i=start;i<=lastIndex;i++)
1617  {
1618  if (row_array[i]!=zero)
1619  {
1620  other_row_array[i]=F4mat_to_number_type(npSubM((number)(long) other_row_array[i], (number)(long) row_array[i],currRing->cf));
1621  }
1622  }
1623  }
1624  else
1625  {
1626  for(i=start;i<=lastIndex;i++)
1627  {
1628  if (row_array[i]!=zero)
1629  {
1630  other_row_array[i]=F4mat_to_number_type(npAddM(nvMult(coef2,(number)(long) row_array[i],currRing->cf),(number)(long) other_row_array[i],currRing->cf));
1631  }
1632  }
1633  }
1634  updateStartIndex(other_row,start);
1635  assume(npIsZero((number)(long) other_row_array[start],currRing->cf));
1636  }
1637  }
1638  }
1639 }
void multiplyRow(int row, number_type coef)
static BOOLEAN npIsOne(number a, const coeffs)
Definition: modulop.h:179
static number npAddM(number a, number b, const coeffs r)
Definition: modulop.h:124
static number npNegM(number a, const coeffs r)
Definition: modulop.h:174
static number npInversM(number c, const coeffs r)
Definition: modulop.h:223
static number npSubM(number a, number b, const coeffs r)
Definition: modulop.h:134
static number npInit(long i, const coeffs r)
Definition: modulop_inl.h:27
static BOOLEAN npIsZero(number a, const coeffs r)
Definition: modulop_inl.h:38
int modP_lastIndexRow(number_type *row, int ncols)

◆ updateStartIndex()

template<class number_type >
void ModPMatrixProxyOnArray< number_type >::updateStartIndex ( int  row,
int  lower_bound 
)
inline

Definition at line 1640 of file tgb_internal.h.

1641 {
1642  number_type* row_array=rows[row];
1643  assume((lower_bound<0)||(npIsZero((number)(long) row_array[lower_bound],currRing->cf)));
1644  int i;
1645  //number_type zero=npInit(0);
1646  for(i=lower_bound+1;i<ncols;i++)
1647  {
1648  if (!(row_array[i]==0))
1649  break;
1650  }
1651  startIndices[row]=i;
1652 }

Friends And Related Function Documentation

◆ ModPMatrixBackSubstProxyOnArray< number_type >

template<class number_type >
friend class ModPMatrixBackSubstProxyOnArray< number_type >
friend

Definition at line 1170 of file tgb_internal.h.

Field Documentation

◆ ncols

template<class number_type >
int ModPMatrixProxyOnArray< number_type >::ncols

Definition at line 1506 of file tgb_internal.h.

◆ nrows

template<class number_type >
int ModPMatrixProxyOnArray< number_type >::nrows

Definition at line 1506 of file tgb_internal.h.

◆ rows

template<class number_type >
number_type** ModPMatrixProxyOnArray< number_type >::rows
protected

Definition at line 1680 of file tgb_internal.h.

◆ startIndices

template<class number_type >
int* ModPMatrixProxyOnArray< number_type >::startIndices
protected

Definition at line 1681 of file tgb_internal.h.


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