Matrix.h

Go to the documentation of this file.

/* Frobby: Software for monomial ideal computations.
   Copyright (C) 2010 University of Aarhus
   Contact Bjarke Hammersholt Roune for license information (www.broune.com)
 
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.
 
   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.
 
   You should have received a copy of the GNU General Public License
   along with this program.  If not, see http://www.gnu.org/licenses/.
*/
#ifndef MATRIX_GUARD
#define MATRIX_GUARD
 
#include <vector>
 
class BigIntVector;
class ColumnPrinter;
 
class Matrix {
 public:
  Matrix(size_t rowCount = 0, size_t colCount = 0);
 
  size_t getRowCount() const {return _rowCount;}
  size_t getColCount() const {return _colCount;}
 
  void resize(size_t rowCount, size_t colCount);
 
  const mpq_class& operator()(size_t row, size_t col) const
  {return _entries[toIndex(row, col)];}
  mpq_class& operator()(size_t row, size_t col)
    {return _entries[toIndex(row, col)];}
 
  void swap(Matrix& mat);
 
 private:
  size_t toIndex(size_t row, size_t col) const {
    ASSERT(row < _rowCount);
    ASSERT(col < _colCount);
    ASSERT(_entries.size() == _rowCount * _colCount);
    size_t index = col + row * _colCount;
    ASSERT(index < _entries.size());
    return index;
  }
 
  size_t _rowCount;
  size_t _colCount;
  vector<mpq_class> _entries;
};
 
bool operator==(const Matrix& a, const Matrix& b);
ostream& operator<<(ostream& out, const Matrix& mat);
 
void print(FILE* file, const Matrix& mat);
void print(ColumnPrinter& printer, const Matrix& mat);
 
void product(Matrix& prod, const Matrix& a, const Matrix& b);
 
void transpose(Matrix& trans, const Matrix& mat);
 
void transpose(Matrix& mat);
 
void addMultiplyRow(Matrix& mat, size_t resultRow,
            size_t sourceRow, const mpq_class& mult);
 
void multiplyRow(Matrix& mat, size_t row, const mpq_class& mult);
 
void swapRows(Matrix& mat, size_t row1, size_t row2);
 
bool rowReduce(Matrix& mat);
 
size_t matrixRank(const Matrix& mat);
 
void rowReduceFully(Matrix& mat);
 
void subMatrix(Matrix& sub, const Matrix& mat,
               size_t rowBegin, size_t rowEnd,
               size_t colBegin, size_t colEnd);
 
void copyRow(Matrix& target, size_t targetRow,
             const Matrix& source, size_t sourceRow);
 
bool inverse(Matrix& inv, const Matrix& mat);
 
void nullSpace(Matrix& basis, const Matrix& mat);
 
bool solve(Matrix& sol, const Matrix& lhs, const Matrix& rhs);
 
bool hasSameColSpace(const Matrix& a, const Matrix& b);
 
bool hasSameRowSpace(const Matrix& a, const Matrix& b);
 
mpq_class determinant(const Matrix& mat);
 
bool isParallelogram(const Matrix& mat);
 
mpq_class getParallelogramAreaSq(const Matrix& mat);
 
#endif