| bidiagonalize(Vector< T > &super_diag, const Matrix< T > &_A) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| cut_off(const double min_sig) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | |
| decompose(const Matrix< T > &A) | PLib::SVDMatrix | |
| diagonalize(Vector< T > &super_diag, const double eps) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| get_submatrix_to_work_on(Vector< T > &super_diag, const int k, const double eps) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| inverse(double tau=0) | PLib::SVDMatrix | |
| inverseIn(Matrix< T > &inv, double tau=0) | PLib::SVDMatrix | |
| left_householder(Matrix< T > &A, const int i) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| M (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| minMax(T &min_sig, T &max_sig) const | PLib::SVDMatrix | |
| N | PLib::SVDMatrix | [protected] |
| q_cond_number(void) const | PLib::SVDMatrix | |
| right_householder(Matrix< T > &A, const int i) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| rip_through(Vector< T > &super_diag, const int k, const int l, const double eps) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| rotate(Matrix< T > &U, const int i, const int j, const double cos_ph, const double sin_ph) (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [protected] |
| sig (defined in PLib::SVDMatrix) | PLib::SVDMatrix | |
| sig_ | PLib::SVDMatrix | [protected] |
| solve(const Matrix< T > &B, Matrix< T > &X, double tau=0) | PLib::SVDMatrix | |
| SVDMatrix() (defined in PLib::SVDMatrix) | PLib::SVDMatrix | [inline] |
| SVDMatrix(const Matrix< T > &A) | PLib::SVDMatrix | |
| U (defined in PLib::SVDMatrix) | PLib::SVDMatrix | |
| U_ | PLib::SVDMatrix | [protected] |
| V (defined in PLib::SVDMatrix) | PLib::SVDMatrix | |
| V_ | PLib::SVDMatrix | [protected] |
