xcpivbst.h

来自「基本矩阵运算 : + - *, power, transpose, trace,」· C头文件 代码 · 共 164 行

H
164 行
字号 
/* xcpivbst.h                   freeware                   xhunga@tiscali.fr  */


/* --------------------------------- FUNCTION ------------------------------  */
/* Do    :                                                                    */
/*                                                                            */
/* -------------------------------------------------------------------------- */
int pivotbestFdenom(
PmF m,
    int row,
    int col)
{
fraction      pivot;
fraction belowpivot;
   int  sign =     1;
   int  row2 = row+1;

      frowmini_F(m,row);

  pivot.n = (*(m->pb+row *m->cols+col*C2   ));
  pivot.d = (*(m->pb+row *m->cols+col*C2+1));

   while(row2 < m->rows)
   {
    frowmini_F(m,row2);
    belowpivot.n = *(m->pb+row2 *m->cols+col*C2    );
    belowpivot.d = *(m->pb+row2 *m->cols+col*C2+1);

       if(fabs(belowpivot.d) < fabs(pivot.d))
         {
          if(belowpivot.n)
            {
             swaprow_mF(m,row,row2);
        pivot.n = belowpivot.n;
        pivot.d = belowpivot.d;
              sign *= -1;
            }
         }

       if(fabs(belowpivot.d) == fabs(pivot.d))
         {
          if(belowpivot.n)
           {
           if(fabs(belowpivot.n) < fabs(pivot.n))
            {
             swaprow_mF(m,row,row2);
        pivot.n = belowpivot.n;
        pivot.d = belowpivot.d;
             sign *= -1;
            }
          }
         }
    row2++;
   }

return(sign);
}

/* --------------------------------- FUNCTION ------------------------------  */
/* Do    :                                                                    */
/*                                                                            */
/* -------------------------------------------------------------------------- */
int pivotbestFnumermax(
PmF m,
    int row,
    int col)
{
fraction      pivot;
fraction belowpivot;
   int  sign =       1;
   int  row2 = row+1;

      frowmini_F(m,row);

  pivot.n = (*(m->pb+row *m->cols+col*C2  ));
  pivot.d = (*(m->pb+row *m->cols+col*C2+1));

   while(row2 < m->rows)
   {
    frowmini_F(m,row2);
    belowpivot.n = *(m->pb+row2 *m->cols+col*C2  );
    belowpivot.d = *(m->pb+row2 *m->cols+col*C2+1);

       if(fabs(belowpivot.n) > fabs(pivot.n))
         {
            {
             swaprow_mF(m,row,row2);
        pivot.n = belowpivot.n;
        pivot.d = belowpivot.d;
              sign *= -1;
            }
         }

       if(fabs(belowpivot.n) == fabs(pivot.n))
         {
           if(fabs(belowpivot.d) > fabs(pivot.d))
            {
             swaprow_mF(m,row,row2);
        pivot.n = belowpivot.n;
        pivot.d = belowpivot.d;
             sign *= -1;
            }
         }
    row2++;
   }

return(sign);
}

/* --------------------------------- FUNCTION ------------------------------  */
/* Do    :                                                                    */
/*                                                                            */
/* -------------------------------------------------------------------------- */
int pivotbestFnumer(
PmF m,
    int row,
    int col)
{
fraction      pivot;
fraction belowpivot;
   int  sign =       1;
   int  row2 = row+1;

      frowmini_F(m,row);

  pivot.n = (*(m->pb+row *m->cols+col*C2  ));
  pivot.d = (*(m->pb+row *m->cols+col*C2+1));

   while(row2 < m->rows)
   {
    frowmini_F(m,row2);
    belowpivot.n = *(m->pb+row2 *m->cols+col*C2   );
    belowpivot.d = *(m->pb+row2 *m->cols+col*C2+1);

       if(fabs(belowpivot.n) < fabs(pivot.n))
         {
          if(belowpivot.n)
            {
             swaprow_mF(m,row,row2);
        pivot.n = belowpivot.n;
        pivot.d = belowpivot.d;
              sign *= -1;
            }
         }

       if(fabs(belowpivot.n) == fabs(pivot.n))
         {
           if(fabs(belowpivot.d) < fabs(pivot.d))
            {
             swaprow_mF(m,row,row2);
        pivot.n = belowpivot.n;
        pivot.d = belowpivot.d;
             sign *= -1;
            }
         }
    row2++;
   }

return(sign);
}

xcpivbst.h - 源码说明

本页面展示了「基本矩阵运算 : + - *, power, transpose, trace, determinant, minor, matrix of minor, cofactor, matrix of co」中的 xcpivbst.h 源码文件，采用 C头文件 编程语言编写，共 164 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫开发者社区收录了大量与矩阵运算相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?