⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 uutgmd.cc

📁 完全使用C++写的高效线性代数运算库!还提供了矩阵类。
💻 CC
字号:
////              LAPACK++ 1.1 Linear Algebra Package 1.1//               University of Tennessee, Knoxvilee, TN.//            Oak Ridge National Laboratory, Oak Ridge, TN.//        Authors: J. J. Dongarra, E. Greaser, R. Pozo, D. Walker//                 (C) 1992-1996 All Rights Reserved////                             NOTICE//// Permission to use, copy, modify, and distribute this software and// its documentation for any purpose and without fee is hereby granted// provided that the above copyright notice appear in all copies and// that both the copyright notice and this permission notice appear in// supporting documentation.//// Neither the Institutions (University of Tennessee, and Oak Ridge National// Laboratory) nor the Authors make any representations about the suitability // of this software for any purpose.  This software is provided ``as is'' // without express or implied warranty.//// LAPACK++ was funded in part by the U.S. Department of Energy, the// National Science Foundation and the State of Tennessee.#include "lafnames.h"#include LA_UNIT_UPPER_TRIANG_MAT_DOUBLE_Hdouble LaUnitUpperTriangMatDouble::outofbounds_= 0;  // set outofbounds_.int LaUnitUpperTriangMatDouble::debug_= 0;  // turn off debug flag.int* LaUnitUpperTriangMatDouble::info_= new int;  // turn off info print flag.double& LaUnitUpperTriangMatDouble::operator()(int i, int j){#ifdef UNIT_UPPER_INDEX_CHK  if (j<=i)   {      cout << "Warning, index to Upper Triular matrix out of range!\n";     cout << " i = " << i << " " <<" j = " << j << endl;   }#endif  if ((j==0)&&(i==0))  // this special case allows us to pass unit matrices    return data_(0,0); // by accessing the first element of the matrix  else if (j<=i)       // which under normal circumstances would return     return outofbounds_; //outofbounds_.  else    return data_(i,j);}double& LaUnitUpperTriangMatDouble::operator()(int i, int j) const{#ifdef UNIT_UPPER_INDEX_CHK  if (j<=i)   {     cout << "Warning, index to Upper Triular matrix out of range!\n";     cout << " i = " << i << " " <<" j = " << j << endl;   }#endif  if ((j==0)&&(i==0))  // this special case allows us to pass unit matrices    return data_(0,0); // by accessing the first element of the matrix  else if (j<=i)       // which under normal circumstances would return    return outofbounds_; //outofbounds_.  else    return data_(i,j);}LaUnitUpperTriangMatDouble& LaUnitUpperTriangMatDouble::copy(LaUnitUpperTriangMatDouble &ob){  if (debug())  {      cout << " ob: " << ob.info() << endl;  }  int M = ob.size(0);  int N = ob.size(1);  int i,j;  resize(ob);  for (i=0; i<M; i++)    for (j=0; j<N; j++)      if (j>i)        (*this)(i,j) = ob(i,j);  if (debug())  {    cout << " *this: " << this->info() << endl;  }  return *this;} LaUnitUpperTriangMatDouble& LaUnitUpperTriangMatDouble::operator=(const double &s){  int M = (*this).size(0);  int N = (*this).size(1);  int i,j;    for (j=0; j<N; j++)    for (i=0; i<M; i++)      if (j>i)        (*this)(i,j) = s;  return *this;}     ostream &operator<<(ostream &s, const LaUnitUpperTriangMatDouble &ob){  if (*(ob.info_))     // print out only matrix info, not actual values  {      *(ob.info_) = 0; // reset the flag      s << "(" << ob.size(0) << "x" << ob.size(1) << ") " ;      s << "Indices: " << ob.index(0) << " " << ob.index(1);      s << " #ref: " << ob.ref_count() ;      s << " sa:" << ob.shallow();  }  else  {    int M = ob.size(0);    int N = ob.size(1);    int i,j;    for (i=0; i<M; i++)    {     for (j=0;j<N;j++)     {         if (j>i)       s << ob(i,j) << "  ";     }     s << endl;    }  }  return s;}

⌨️ 快捷键说明

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