60 template <
class nr_type_t>
91 void solve_inverse (
void);
92 void solve_gauss (
void);
93 void solve_gauss_jordan (
void);
94 void solve_lu_crout (
void);
95 void solve_lu_doolittle (
void);
96 void factorize_lu_crout (
void);
97 void factorize_lu_doolittle (
void);
98 void substitute_lu_crout (
void);
99 void substitute_lu_doolittle (
void);
100 void solve_qr (
void);
101 void solve_qr_ls (
void);
102 void solve_qrh (
void);
103 void factorize_qrh (
void);
104 void substitute_qrh (
void);
105 void factorize_qr_householder (
void);
106 void substitute_qr_householder (
void);
107 void substitute_qr_householder_ls (
void);
108 nr_type_t householder_create_left (
int);
109 void householder_apply_left (
int, nr_type_t);
110 nr_type_t householder_left (
int);
111 nr_type_t householder_create_right (
int);
112 void householder_apply_right (
int, nr_type_t);
113 void householder_apply_right_extern (
int, nr_type_t);
114 nr_type_t householder_right (
int);
115 nr_double_t euclidian_c (
int,
int r = 1);
116 nr_double_t euclidian_r (
int,
int c = 1);
117 void givens_apply_u (
int,
int, nr_double_t, nr_double_t);
118 void givens_apply_v (
int,
int, nr_double_t, nr_double_t);
119 void solve_svd (
void);
120 void chop_svd (
void);
121 void factorize_svd (
void);
122 void substitute_svd (
void);
123 void diagonalize_svd (
void);
124 void solve_iterative (
void);
125 void solve_sor (
void);
126 nr_double_t convergence_criteria (
void);
127 void ensure_diagonal (
void);
128 void ensure_diagonal_MNA (
void);
129 int countPairs (
int,
int&,
int&);
130 void preconditioner (
void);