| 1 | /*
|
|---|
| 2 | * Matrix.hpp
|
|---|
| 3 | *
|
|---|
| 4 | * Created on: Jun 25, 2010
|
|---|
| 5 | * Author: crueger
|
|---|
| 6 | */
|
|---|
| 7 |
|
|---|
| 8 | #ifndef MATRIX_HPP_
|
|---|
| 9 | #define MATRIX_HPP_
|
|---|
| 10 |
|
|---|
| 11 | #include <iosfwd>
|
|---|
| 12 | #include "defs.hpp"
|
|---|
| 13 |
|
|---|
| 14 | /**
|
|---|
| 15 | * Simple class to store matrices with a few extra functions
|
|---|
| 16 | */
|
|---|
| 17 |
|
|---|
| 18 | class Vector;
|
|---|
| 19 | class MatrixContent;
|
|---|
| 20 |
|
|---|
| 21 | class Matrix
|
|---|
| 22 | {
|
|---|
| 23 | friend Vector operator*(const Matrix&,const Vector&);
|
|---|
| 24 | public:
|
|---|
| 25 | Matrix();
|
|---|
| 26 |
|
|---|
| 27 | /**
|
|---|
| 28 | * construct a matrix from a 3x3 double array that contains all Elements.
|
|---|
| 29 | *
|
|---|
| 30 | * The elements are laid out in the following way:
|
|---|
| 31 | * array -> matrix
|
|---|
| 32 | * 0 -> (0,0)
|
|---|
| 33 | * 1 -> (1,0)
|
|---|
| 34 | * 2 -> (2,0)
|
|---|
| 35 | * 3 -> (0,1)
|
|---|
| 36 | * 4 -> (1,1)
|
|---|
| 37 | * 5 -> (2,1)
|
|---|
| 38 | * 6 -> (0,2)
|
|---|
| 39 | * 7 -> (1,2)
|
|---|
| 40 | * 8 -> (2,2)
|
|---|
| 41 | *
|
|---|
| 42 | */
|
|---|
| 43 | Matrix(const double*);
|
|---|
| 44 | Matrix(const Matrix&);
|
|---|
| 45 | virtual ~Matrix();
|
|---|
| 46 |
|
|---|
| 47 | /**
|
|---|
| 48 | * Set the matrix to a unit matrix.
|
|---|
| 49 | */
|
|---|
| 50 | void one();
|
|---|
| 51 |
|
|---|
| 52 | /**
|
|---|
| 53 | * Access the matrix at index (i,j)
|
|---|
| 54 | */
|
|---|
| 55 | double &at(size_t i, size_t j);
|
|---|
| 56 | /**
|
|---|
| 57 | * Access the matrix at index (i,j)
|
|---|
| 58 | */
|
|---|
| 59 | const double at(size_t i, size_t j) const;
|
|---|
| 60 |
|
|---|
| 61 | /**
|
|---|
| 62 | * Set the matrix at index (i,j).
|
|---|
| 63 | *
|
|---|
| 64 | * Slightly faster than at(i,j)=x
|
|---|
| 65 | */
|
|---|
| 66 | void set(size_t i, size_t j, const double value);
|
|---|
| 67 |
|
|---|
| 68 | /**
|
|---|
| 69 | * get the ith row of the matrix as a vector
|
|---|
| 70 | */
|
|---|
| 71 | Vector &row(size_t);
|
|---|
| 72 | const Vector &row(size_t) const;
|
|---|
| 73 |
|
|---|
| 74 | /**
|
|---|
| 75 | * get the ith column of the matrix as a vector
|
|---|
| 76 | */
|
|---|
| 77 | Vector &column(size_t);
|
|---|
| 78 | const Vector &column(size_t) const;
|
|---|
| 79 |
|
|---|
| 80 | /**
|
|---|
| 81 | * get the diagonal of the matrix as a vector
|
|---|
| 82 | */
|
|---|
| 83 | Vector &diagonal();
|
|---|
| 84 | const Vector &diagonal() const;
|
|---|
| 85 |
|
|---|
| 86 | /**
|
|---|
| 87 | * Calculate the determinant of the matrix
|
|---|
| 88 | */
|
|---|
| 89 | double determinant() const;
|
|---|
| 90 |
|
|---|
| 91 | /**
|
|---|
| 92 | * Calculate the inverse of the matrix.
|
|---|
| 93 | *
|
|---|
| 94 | * Rather costly, so use precomputation as often as possible.
|
|---|
| 95 | */
|
|---|
| 96 | Matrix invert() const;
|
|---|
| 97 |
|
|---|
| 98 | Matrix transpose() const;
|
|---|
| 99 |
|
|---|
| 100 | // operators
|
|---|
| 101 | Matrix &operator=(const Matrix&);
|
|---|
| 102 |
|
|---|
| 103 | Matrix &operator+=(const Matrix&);
|
|---|
| 104 | Matrix &operator-=(const Matrix&);
|
|---|
| 105 | Matrix &operator*=(const Matrix&);
|
|---|
| 106 |
|
|---|
| 107 | Matrix &operator*=(const double);
|
|---|
| 108 |
|
|---|
| 109 | Matrix operator+(const Matrix&) const;
|
|---|
| 110 | Matrix operator-(const Matrix&) const;
|
|---|
| 111 | Matrix operator*(const Matrix&) const;
|
|---|
| 112 |
|
|---|
| 113 | bool operator==(const Matrix&) const;
|
|---|
| 114 |
|
|---|
| 115 | private:
|
|---|
| 116 | Matrix(MatrixContent*);
|
|---|
| 117 | void createViews();
|
|---|
| 118 | MatrixContent *content;
|
|---|
| 119 | // we keep around some Vector views of the matrix, to return references
|
|---|
| 120 | Vector* rows_ptr[NDIM];
|
|---|
| 121 | Vector* columns_ptr[NDIM];
|
|---|
| 122 | Vector* diagonal_ptr;
|
|---|
| 123 | };
|
|---|
| 124 |
|
|---|
| 125 | Matrix operator*(const double,const Matrix&);
|
|---|
| 126 | Matrix operator*(const Matrix&,const double);
|
|---|
| 127 |
|
|---|
| 128 | /**
|
|---|
| 129 | * Takes a symmetric matrix that stores the lower diagonal and produces a
|
|---|
| 130 | * full matrix.
|
|---|
| 131 | *
|
|---|
| 132 | * The array is laid out as follows:
|
|---|
| 133 | *
|
|---|
| 134 | * array -> matrix
|
|---|
| 135 | * 0 -> (0,0)
|
|---|
| 136 | * 1 -> (1,0);(0,1)
|
|---|
| 137 | * 2 -> (1,1)
|
|---|
| 138 | * 3 -> (2,0);(0,2)
|
|---|
| 139 | * 4 -> (2,1);(1,2)
|
|---|
| 140 | * 5 -> (2,2)
|
|---|
| 141 | */
|
|---|
| 142 | Matrix ReturnFullMatrixforSymmetric(const double * const cell_size);
|
|---|
| 143 |
|
|---|
| 144 | std::ostream &operator<<(std::ostream&,const Matrix&);
|
|---|
| 145 | Vector operator*(const Matrix&,const Vector&);
|
|---|
| 146 | Vector& operator*=(Vector&,const Matrix&);
|
|---|
| 147 |
|
|---|
| 148 | #endif /* MATRIX_HPP_ */
|
|---|