Changeset daf8e1 in git


Ignore:
Timestamp:
Sep 23, 2004, 2:50:52 PM (20 years ago)
Author:
Michael Brickenstein <bricken@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
1baf4f9f23defe16f204a32e64709f7974e922ef
Parents:
74d2017e2056f5e9fdb31c68b3163b7b8f7c2fd7
Message:
*bricken:steps towards sparse matrizes


git-svn-id: file:///usr/local/Singular/svn/trunk@7488 2c84dea3-7e68-4137-9b89-c4e89433aadc
Location:
Singular
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • Singular/tgb.cc

    r74d2017 rdaf8e1  
    12361236  return (*node)->n;
    12371237}
    1238 class mac_poly_r{
    1239 public:
    1240   number coef;
    1241   mac_poly_r* next;
    1242   int exp;
    1243   mac_poly_r():next(NULL){}
    1244 };
     1238
    12451239//mac_polys exp are smaller iff they are greater by monomial ordering
    12461240//corresponding to solving linear equations notation
     
    12491243  int n;
    12501244};
    1251 typedef mac_poly_r* mac_poly;
    1252   void t2ippa_rec(poly* ip,int* ia, poly_tree_node* k, int &offset){
     1245
     1246void t2ippa_rec(poly* ip,int* ia, poly_tree_node* k, int &offset){
    12531247    if(!k) return;
    12541248    t2ippa_rec(ip,ia,k->l,offset);
  • Singular/tgb.h

    r74d2017 rdaf8e1  
    108108  tgb_matrix(int i, int j);
    109109  ~tgb_matrix();
     110  int get_rows();
     111  int get_columns();
     112  void print();
     113  void perm_rows(int i, int j);
     114  void set(int i, int j, number n);
     115  number get(int i, int j);
     116  BOOLEAN is_zero_entry(int i, int j);
     117  void free_row(int row, BOOLEAN free_non_zeros=TRUE);
     118  int min_col_not_zero_in_row(int row);
     119  int next_col_not_zero(int row,int pre);
     120  BOOLEAN zero_row(int row);
     121  void mult_row(int row,number factor);
     122  void add_lambda_times_row(int add_to,int summand,number factor);
     123  int non_zero_entries(int row);
     124};
     125class mac_poly_r{
     126public:
     127  number coef;
     128  mac_poly_r* next;
     129  int exp;
     130  mac_poly_r():next(NULL){}
     131};
     132//mac_polys exp are smaller iff they are greater by monomial ordering
     133//corresponding to solving linear equations notation
     134
     135typedef mac_poly_r* mac_poly;
     136class tgb_sparse_matrix{
     137 private:
     138  mac_poly* mp;
     139  int columns;
     140  int rows;
     141  BOOLEAN free_numbers;
     142 public:
     143  tgb_sparse_matrix(int i, int j);
     144  ~tgb_sparse_matrix();
    110145  int get_rows();
    111146  int get_columns();
Note: See TracChangeset for help on using the changeset viewer.