xcrwmni.h

基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of co

/* xdfrwmni.h                   freeware                   [e-mail]  */

/* ------------------------------ FUNCTION ---------------------- frowmini_F() */
/* Do    : apply mini_F() on a row                                             */
/* Call  : mini_F()                                                            */
/* Debug : p_mF(m); getchar();                                             */
/* -------------------------------------------------------------------------- */
void frowmini_F(
PmF m,
int     row)
{
  int    j;
fraction f;

 for ( j = 0 ; j < m->cols ; j++,j++ )
    {
     f.n = *(m->pb+row *m->cols+j  );
     f.d = *(m->pb+row *m->cols+j+1);

     f = mini_F(f);

     *(m->pb+row *m->cols+j  ) = f.n;
     *(m->pb+row *m->cols+j+1) = f.d;

    }
}


/* --------------------------------- FUNCTION ------------------------------  */
/* Do    :                                                                    */
/*                                                                            */


/* -------------------------------------------------------------------------- */
fraction rowmini_F(
PmF m,
    int row,
fraction deter)
{
     int j;
     int i;
  double ValueOfN;
     int nb1er;
     int ttrue;
     int row0;

/* ************************************************************************** */
/* In this function 0 = 0/0. In other part 0 = 0/1.                           */
/* Why :  rowmini_F(1, 2, 4, 6, 8) = 1, 2, 4, 6, 8                             */
/*        rowmini_F(0, 2, 4, 6, 8) = 0, 1, 2, 3, 4                             */
/*        0 is a muliple of any numbers                                      */
/*        1 is a muliple of 1                                                */
/* ************************************************************************** */
row0 = 0;
for (j = 0;  j < m->cols ; j++, j++)
{
 ValueOfN = *(m->pb+row *m->cols+j);
 if(!ValueOfN)
 {
 *(m->pb+row *m->cols+j+1) = 0;
   row0++;
 }
}
/* ************************************************************************** */

if((row0 * C2) != (m->cols))
{
for(i = 0; i < 2 ; i++)
{

      nb1er = FIRSTNB1ER;
while(nb1er < LASTNB1ER-1 )
{
j = i; ttrue = 1;

/* -------------------------------------------------------------------------- */
while((j < m->cols) && ttrue )
{
          ValueOfN = *(m->pb+row *m->cols+j);
  if(fmod(ValueOfN,tnb1er[nb1er]))
    {
     nb1er++;
     ttrue = 0;
     if( (tnb1er[nb1er]) > fabs(ValueOfN))
        {
          nb1er = LASTNB1ER-1;
        }
    }
j++;j++;
}
/* -------------------------------------------------------------------------- */


/* -------------------------------- true = y -------------------------------- */
if(ttrue)
  {
  for(j = i;  j < m->cols ; j++, j++)
     {
      *(m->pb+row *m->cols+j) = \
      *(m->pb+row *m->cols+j) / tnb1er[nb1er];
     }
  if( i==0){deter.n *= tnb1er[nb1er];}
  if( i==1){deter.d *= tnb1er[nb1er];}
  }
/* -------------------------------- true = y -------------------------------- */
}
}
}
/* ************************************************************************** */
/* In this function   0 = 0/0.                                                */
/* In other part      0 = 0/1.                                                */
/* Now you must write 0 = 0/1.                                                */
/* ************************************************************************** */
for (j = 0;  j < m->cols ; j++, j++)
{
 ValueOfN = *(m->pb+row *m->cols+j);
 if(!ValueOfN)
 {
 *(m->pb+row *m->cols+j+1) = 1;
 }
}
/* ************************************************************************** */
 return(mini_F(deter));
}