#include <Matrix.h>
Public Member Functions | |
| Matrix () | |
| Matrix (double value) | |
| Matrix (const Point< rows > &p, const Point< cols > &q) | |
| const double * | column_major_array () const |
| double * | column_major_array () |
| double | operator() (unsigned r, unsigned c) const |
| double & | operator() (unsigned r, unsigned c) |
| double | get (unsigned r, unsigned c) const |
| double & | get (unsigned r, unsigned c) |
| void | operator+= (const Matrix &other) |
| void | operator-= (const Matrix &other) |
| void | operator *= (double x) |
| void | operator/= (double x) |
| Point< rows > | operator * (const Point< cols > &p) const |
| void | qd_print () |
| template<unsigned newcols> | |
| Matrix< rows, newcols > | operator * (const Matrix< cols, newcols > &other) |
| template<unsigned k> | |
| void | eigenvectors (boost::array< Point< rows >, k > &vectors) const |
|
|||||||||
|
|
|
||||||||||
|
|
|
||||||||||||||||
|
|
|
|||||||||
|
|
|
|||||||||
|
|
|
||||||||||||||
|
Produce the largest k eigenvectors, sorted argest first. We use repeated squaring, which largely assumes low dimension. Of course, the matrix must be square. Raise an error if we cannot find k nonzero eigenvalues |
|
||||||||||||||||
|
|
|
||||||||||||||||
|
|
|
||||||||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
|
|
||||||||||||||||
|
|
|
||||||||||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
|
|
||||||||||
|
|
|
|||||||||
|
|
1.4.6