28 #ifndef _SRC_COMMON_CPP_MATHS_MMATRIX_HH_
29 #define _SRC_COMMON_CPP_MATHS_MMATRIX_HH_
34 #include "gsl/gsl_matrix.h"
35 #include "gsl/gsl_blas.h"
41 namespace interpolation {
61 template <
class Tmplt>
81 MMatrix(
size_t nrows,
size_t ncols, Tmplt* data_beginning );
89 MMatrix(
size_t nrows,
size_t ncols, Tmplt value);
96 MMatrix(
size_t nrows,
size_t ncols);
151 MMatrix<Tmplt> sub(
size_t min_row,
size_t max_row,
size_t min_col,
size_t max_col)
const;
155 const Tmplt&
operator()(
size_t row,
size_t column)
const;
226 template <
class Tmplt> std::ostream& operator<<(std::ostream& out, MMatrix<Tmplt> mat);
249 if(_matrix)
return ((gsl_matrix*)_matrix)->size1;
255 if(_matrix)
return ((gsl_matrix_complex*)_matrix)->size1;
261 if(_matrix)
return ((gsl_matrix*)_matrix)->size2;
268 if(_matrix)
return ((gsl_matrix_complex*)_matrix)->size2;
273 {gsl_matrix_complex_scale((gsl_matrix_complex*)m.
_matrix, c);
return m;}
276 {gsl_matrix_scale((gsl_matrix*)m.
_matrix, d);
return m;}
288 gsl_blas_dgemv(CblasNoTrans, 1., (gsl_matrix*)m.
_matrix, (gsl_vector*)v.
_vector, 0., (gsl_vector*)v0._vector);
293 {gsl_matrix_complex_add((gsl_matrix_complex*)m1.
_matrix, (gsl_matrix_complex*)m2.
_matrix);
return m1;}
296 {gsl_matrix_add((gsl_matrix*)m1.
_matrix, (gsl_matrix*)m2.
_matrix);
return m1;}
299 {
for(
size_t i=1; i<=m1.
num_row(); i++)
for(
size_t j=1; j<=m1.
num_col(); j++) m1(i,j) = -1.*m1(i,j);
return m1; }
327 {
return *gsl_matrix_ptr((gsl_matrix*)_matrix, i-1, j-1); }
330 {
return *gsl_matrix_complex_ptr((gsl_matrix_complex*)_matrix, i-1, j-1); }
334 {
return *gsl_matrix_ptr((gsl_matrix*)_matrix, i-1, j-1); }
337 {
return *gsl_matrix_complex_ptr((gsl_matrix_complex*)_matrix, i-1, j-1); }
339 template <
class Tmplt>
343 for(
size_t i=1; i<=lhs.
num_row(); i++)
344 for(
size_t j=1; j<=lhs.
num_col(); j++)
345 if(lhs(i,j) != rhs(i,j))
return false;
349 template <
class Tmplt>
353 template <
class Tmplt> std::ostream& operator<<(std::ostream& out, MMatrix<Tmplt>);
356 template <
class Tmplt>
364 template <
class Tmplt>
369 return (gsl_matrix_complex*)m.
_matrix;
Matrix< T > operator+(const Matrix< T > &, const Matrix< T > &)
Matrix addition.
MMatrix< Tmplt > inverse() const
returns matrix inverse leaving this matrix unchanged
void build_matrix(size_t i, size_t j)
static gsl_matrix * get_matrix(const MMatrix< double > &m)
Matrix< T > operator/(const Matrix< T > &, const T &)
Matrix divided by scalar.
MVector< m_complex > operator*(MMatrix< m_complex > m, MVector< m_complex > v)
MMatrix< m_complex > complex(MMatrix< double > real)
std::pair< MVector< m_complex >, MMatrix< m_complex > > eigenvectors() const
const Tmplt & operator()(size_t row, size_t column) const
Mesh::Iterator & operator+=(Mesh::Iterator &lhs, const Mesh::Iterator &rhs)
friend MMatrix< m_complex > & operator+=(MMatrix< m_complex > &m1, const MMatrix< m_complex > &m2)
Matrix< T > operator*(const Matrix< T > &, const Matrix< T > &)
Matrix multiply.
m_complex m_complex_build(double r, double i)
MMatrix< Tmplt > operator/(MMatrix< Tmplt >, Tmplt)
MMatrix< Tmplt > & operator/=(MMatrix< Tmplt > &m, Tmplt t)
static MMatrix< Tmplt > Diagonal(size_t i, Tmplt diag_value, Tmplt off_diag_value)
Construct a square matrix filling on and off diagonal values.
template std::istream & operator>>(std::istream &in, MMatrix< double > &mat)
MMatrix< Tmplt > sub(size_t min_row, size_t max_row, size_t min_col, size_t max_col) const
MVector< m_complex > eigenvalues() const
returns a vector of eigenvalues. Throws an exception if either this matrix is not square or the eigen...
FLieGenerator< T, N > real(const FLieGenerator< std::complex< T >, N > &)
Take real part of a complex generator.
Tmplt determinant() const
returns matrix determinant; throws an exception if matrix is not square
friend MVector< m_complex > operator*(MMatrix< m_complex > m, MVector< m_complex > v)
MVector< Tmplt > get_mvector(size_t column) const
size_t num_col() const
returns number of columns in the matrix
Mesh::Iterator & operator-=(Mesh::Iterator &lhs, const Mesh::Iterator &rhs)
bool operator!=(const Mesh::Iterator &lhs, const Mesh::Iterator &rhs)
Mesh::Iterator operator+(const Mesh::Iterator &lhs, const Mesh::Iterator &rhs)
const gsl_matrix * MMatrix_to_gsl(const MMatrix< double > &m)
constexpr double c
The velocity of light in m/s.
MMatrix< double > im(MMatrix< m_complex > mc)
MMatrix< double > & operator*=(MMatrix< double > &m1, MMatrix< double > m2)
friend const gsl_matrix * MMatrix_to_gsl(const MMatrix< double > &m)
MMatrix< Tmplt > T() const
returns matrix transpose T (such that M(i,j) = T(j,i))
Mesh::Iterator operator-(const Mesh::Iterator &lhs, const Mesh::Iterator &rhs)
MMatrix< double > re(MMatrix< m_complex > mc)
bool operator!=(const Offset &off1, const Offset &off2)
friend MMatrix< Tmplt2 > operator+(MMatrix< Tmplt2 > m1, const MMatrix< Tmplt2 > m2)
MMatrix()
default constructor makes an empty MMatrix of size (0,0)
Tmplt trace() const
returns sum of terms with row == column, even if matrix is not square
friend MMatrix< m_complex > & operator*=(MMatrix< m_complex > &m, m_complex c)
MMatrix< Tmplt > & operator=(const MMatrix< Tmplt > &mm)
Matrix< T > operator-(const Matrix< T > &, const Matrix< T > &)
Matrix subtraction.
void invert()
turns this matrix into its inverse
bool operator==(const Mesh::Iterator &lhs, const Mesh::Iterator &rhs)
size_t num_row() const
returns number of rows in the matrix
bool operator==(const TwoPolynomial &left, const TwoPolynomial &right)