Warning dynamic memory allocated to n never gets freed.
-Todo: fix memory leak
+Todo: fix memory leak
diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html
index c9cdc43fc..d5e14ed1b 100644
--- a/d4/d68/qr__decompose_8h_source.html
+++ b/d4/d68/qr__decompose_8h_source.html
@@ -306,189 +306,72 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
210 #endif // NUMERICAL_METHODS_QR_DECOMPOSE_H_
-bool check_termination(long double delta)
Definition: durand_kerner_roots.cpp:91
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_midpoint_euler.cpp:156
-double Sqrt(double a)
Definition: sqrt_double.cpp:16
-unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
-void tests()
Definition: least_common_multiple.cpp:48
-std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
-int main()
Definition: primes_up_to_billion.cpp:26
double semi_implicit_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the semi-implicit-Euler method in the given limits.
Definition: ode_semi_implicit_euler.cpp:103
-std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: lu_decompose.cpp:75
-#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: false_position.cpp:24
-friend std::istream & operator>>(std::istream &input, stats_computer2 &stat)
Definition: realtime_stats.cpp:97
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: newton_raphson_method.cpp:21
-ll mat_size
Definition: matrix_exponentiation.cpp:45
-#define EPSILON
solution accuracy limit
Definition: golden_search_extrema.cpp:17
-void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:188
-
void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the semi-implicit-Euler method.
Definition: ode_semi_implicit_euler.cpp:82
-
-std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
-bool miller_rabin_primality_test(T num, T repeats)
Definition: miller_rabin.cpp:125
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:196
static double eq(double i)
Definition: newton_raphson_method.cpp:29
-
-int main()
Definition: brent_method_extrema.cpp:204
-#define EPSILON
system accuracy limit
Definition: brent_method_extrema.cpp:23
static double eq_der(double i)
Definition: newton_raphson_method.cpp:39
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_forward_euler.cpp:67
-int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
int main(int argc, char *argv[])
Definition: ode_forward_euler.cpp:188
-ll ans(ll n)
Definition: matrix_exponentiation.cpp:91
-int main()
Definition: sieve_of_eratosthenes.cpp:59
-void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
-const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
-void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:123
-double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
Get the real root of a function in the given interval.
Definition: brent_method_extrema.cpp:35
-
-int sgn(T val)
Definition: bisection_method.cpp:32
-double std() const
Definition: realtime_stats.cpp:48
void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the midpoint-Euler method.
Definition: ode_midpoint_euler.cpp:85
-std::vector< std::pair< int, int > > factors
Definition: prime_factorization.cpp:19
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:55
-int main()
Definition: prime_factorization.cpp:62
-std::vector< T > reverse_binary(T num)
Definition: miller_rabin.cpp:19
-void power(int x, int n)
Definition: power_for_huge_numbers.cpp:56
Functions to compute QR decomposition of any rectangular matrix.
std::vector< std::vector< T > > operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B)
Definition: ordinary_least_squares_regressor.cpp:72
-void test1()
Test function to find minima for the function in the interval Expected result = 2.
Definition: golden_search_extrema.cpp:78
-int main()
Definition: prime_numbers.cpp:26
void forward_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the forward-Euler method.
Definition: ode_forward_euler.cpp:86
-
-
-int main()
Definition: modular_inverse_fermat_little_theorem.cpp:84
-std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
Definition: durand_kerner_roots.cpp:109
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: ordinary_least_squares_regressor.cpp:20
-void test()
Definition: sum_of_digits.cpp:58
-
-
-void test2()
Definition: sum_of_digits.cpp:49
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_forward_euler.cpp:152
-void init()
Definition: sieve_of_eratosthenes.cpp:52
-
-
-
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:104
-int main()
Definition: false_position.cpp:39
-
double vector_mag(const std::valarray< T > &a)
Definition: qr_decompose.h:92
-double variance() const
Definition: realtime_stats.cpp:89
-unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
-int main()
Definition: sqrt_double.cpp:42
-void sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:25
-T modular_exponentiation(T base, const std::vector< T > &rev_binary_exponent, T mod)
Definition: miller_rabin.cpp:43
-std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
-int main(int argc, char **argv)
Definition: lu_decompose.cpp:91
int main()
Definition: ordinary_least_squares_regressor.cpp:358
-
-void test1()
Definition: durand_kerner_roots.cpp:207
std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)
Definition: ordinary_least_squares_regressor.cpp:340
-int main()
Definition: gaussian_elimination.cpp:9
-#define ACCURACY
Definition: durand_kerner_roots.cpp:45
-double mean() const
Definition: realtime_stats.cpp:42
-Definition: realtime_stats.cpp:72
std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)
Definition: qr_decompose.h:33
double forward_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the forward-Euler method in the given limits.
Definition: ode_forward_euler.cpp:102
-int main(int argc, char **argv)
Definition: realtime_stats.cpp:158
-int sgn(T val)
Definition: false_position.cpp:34
-
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_semi_implicit_euler.cpp:53
-void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
-void SieveOfEratosthenes(int N)
Definition: prime_factorization.cpp:23
-
-bool miller_test(T d, T num)
Definition: miller_rabin.cpp:73
-int main()
Definition: least_common_multiple.cpp:67
#define EPSILON
system accuracy limit
Definition: newton_raphson_method.cpp:20
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_forward_euler.cpp:54
int data[MAX]
test data
Definition: hash_search.cpp:24
-#define MAX
Definition: sieve_of_eratosthenes.cpp:16
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)
Definition: ordinary_least_squares_regressor.cpp:310
std::vector< T > operator-(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:175
-int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:218
-void new_val(T x)
Definition: realtime_stats.cpp:32
-void test2()
Test function to find root for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:165
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:76
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_midpoint_euler.cpp:53
-void new_val(T x)
Definition: realtime_stats.cpp:77
-double variance() const
Definition: realtime_stats.cpp:45
int main()
Definition: newton_raphson_method.cpp:44
-int sum_of_digits(int num)
Definition: sum_of_digits.cpp:23
double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the midpoint-Euler method in the given limits.
Definition: ode_midpoint_euler.cpp:107
-int main()
Definition: number_of_positive_divisors.cpp:62
-
-int main()
Definition: miller_rabin.cpp:183
-
-int main()
Definition: power_for_huge_numbers.cpp:82
-void prime_factorization(int num)
Definition: prime_factorization.cpp:40
-int main()
Definition: sum_of_digits.cpp:68
-
-Definition: realtime_stats.cpp:27
-void test2()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:100
-double std() const
Definition: realtime_stats.cpp:92
-int main()
Definition: golden_search_extrema.cpp:139
-bool isprime[MAX]
Definition: sieve_of_eratosthenes.cpp:19
-void test1()
Definition: sum_of_digits.cpp:40
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
-
-
int main(int argc, char *argv[])
Definition: ode_semi_implicit_euler.cpp:189
-static double eq(double i)
Definition: false_position.cpp:28
-void test1()
Test function to find root for the function in the interval Expected result = 2.
Definition: brent_method_extrema.cpp:143
-std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
-
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_semi_implicit_euler.cpp:153
-#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
-
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_semi_implicit_euler.cpp:66
-
-int main()
Definition: string_fibonacci.cpp:81
-int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
-static double eq(double i)
Definition: bisection_method.cpp:26
-double get_minima(const std::function< double(double)> &f, double lim_a, double lim_b)
Get the minima of a function in the given interval. To get the maxima, simply negate the function....
Definition: golden_search_extrema.cpp:29
-void fib_Accurate(uint64_t n)
Definition: string_fibonacci.cpp:68
-void Sieve(int64_t n)
Definition: primes_up_to_billion.cpp:13
-double mean() const
Definition: realtime_stats.cpp:86
-bool isPrime(int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:68
-void test2()
Definition: durand_kerner_roots.cpp:242
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_midpoint_euler.cpp:66
-int lu_decomposition(const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U)
Definition: lu_decompose.cpp:22
-int main()
Definition: bisection_method.cpp:37
std::vector< float > operator/(std::vector< T > const &A, float const scalar)
Definition: ordinary_least_squares_regressor.cpp:166
-
-#define MAX
Definition: power_for_huge_numbers.cpp:10
-friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)
Definition: realtime_stats.cpp:53
int main(int argc, char *argv[])
Definition: ode_midpoint_euler.cpp:192
-void tests()
Definition: miller_rabin.cpp:157
-char prime[100000000]
Definition: primes_up_to_billion.cpp:10
-bool isprime[1000006]
Definition: prime_factorization.cpp:13
std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:289
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 4d262b8c6..2f2a50cae 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -256,6 +256,7 @@ Numerical Methods
Gaussian Elimination
Golden Search Extrema
Lu Decompose
+
Lu Decomposition
Newton Raphson Method
Ode Forward Euler
Ode Midpoint Euler
diff --git a/d6/d20/lu__decomposition_8h__incl.map b/d6/d20/lu__decomposition_8h__incl.map
new file mode 100644
index 000000000..a2fcf810f
--- /dev/null
+++ b/d6/d20/lu__decomposition_8h__incl.map
@@ -0,0 +1,6 @@
+
+
+
+
+
+
diff --git a/d6/d20/lu__decomposition_8h__incl.md5 b/d6/d20/lu__decomposition_8h__incl.md5
new file mode 100644
index 000000000..531a00f29
--- /dev/null
+++ b/d6/d20/lu__decomposition_8h__incl.md5
@@ -0,0 +1 @@
+908a450b50ae5d896eefd98949709743
\ No newline at end of file
diff --git a/d6/d20/lu__decomposition_8h__incl.svg b/d6/d20/lu__decomposition_8h__incl.svg
new file mode 100644
index 000000000..35b0f0a75
--- /dev/null
+++ b/d6/d20/lu__decomposition_8h__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+numerical_methods/lu_decomposition.h
+
+
+
+Node1
+
+
+numerical_methods/lu
+_decomposition.h
+
+
+
+
+
+Node2
+
+
+iostream
+
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+
+valarray
+
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+
+vector
+
+
+
+
+
+Node1->Node4
+
+
+
+
+
diff --git a/d7/d35/matrix__exponentiation_8cpp.html b/d7/d35/matrix__exponentiation_8cpp.html
index b6e3fdb71..449865d2b 100644
--- a/d7/d35/matrix__exponentiation_8cpp.html
+++ b/d7/d35/matrix__exponentiation_8cpp.html
@@ -420,7 +420,7 @@ Here is the call graph for this function:
-
global vector variables used in the ans function.
Todo: @stepfencurryxiao add documetnation
+
global vector variables used in the ans function.
Todo: @stepfencurryxiao add documetnation
@@ -435,7 +435,7 @@ Here is the call graph for this function:
-
global variable mat_size
Todo: @stepfencurryxiao add documetnation
+
global variable mat_size
Todo: @stepfencurryxiao add documetnation
diff --git a/d7/d39/lu__decomposition_8h__dep__incl.map b/d7/d39/lu__decomposition_8h__dep__incl.map
new file mode 100644
index 000000000..90498cf4f
--- /dev/null
+++ b/d7/d39/lu__decomposition_8h__dep__incl.map
@@ -0,0 +1,4 @@
+
+
+
+
diff --git a/d7/d39/lu__decomposition_8h__dep__incl.md5 b/d7/d39/lu__decomposition_8h__dep__incl.md5
new file mode 100644
index 000000000..c707d3416
--- /dev/null
+++ b/d7/d39/lu__decomposition_8h__dep__incl.md5
@@ -0,0 +1 @@
+2313f24130ed2a5ca7a822b076b6579c
\ No newline at end of file
diff --git a/d7/d39/lu__decomposition_8h__dep__incl.svg b/d7/d39/lu__decomposition_8h__dep__incl.svg
new file mode 100644
index 000000000..35438520f
--- /dev/null
+++ b/d7/d39/lu__decomposition_8h__dep__incl.svg
@@ -0,0 +1,39 @@
+
+
+
+
+
+
+numerical_methods/lu_decomposition.h
+
+
+
+Node1
+
+
+numerical_methods/lu
+_decomposition.h
+
+
+
+
+
+Node2
+
+
+numerical_methods/lu
+_decompose.cpp
+
+
+
+
+
+Node1->Node2
+
+
+
+
+
diff --git a/d9/d69/median__search_8cpp.html b/d9/d69/median__search_8cpp.html
index 3249d423e..182e81db3 100644
--- a/d9/d69/median__search_8cpp.html
+++ b/d9/d69/median__search_8cpp.html
@@ -160,7 +160,7 @@ template<class X >
-
Todo: add documentation
+
Todo: add documentation
20 std::cout << (*s2)[0] <<
" is the " << x + 1 <<
"th element from front" ;
diff --git a/dc/d37/lu__decompose_8cpp__incl.map b/dc/d37/lu__decompose_8cpp__incl.map
index 2544e7c25..63ef084ac 100644
--- a/dc/d37/lu__decompose_8cpp__incl.map
+++ b/dc/d37/lu__decompose_8cpp__incl.map
@@ -1,7 +1,10 @@
-
-
-
-
-
+
+
+
+
+
+
+
+
diff --git a/dc/d37/lu__decompose_8cpp__incl.md5 b/dc/d37/lu__decompose_8cpp__incl.md5
index d14f77b15..23df4099d 100644
--- a/dc/d37/lu__decompose_8cpp__incl.md5
+++ b/dc/d37/lu__decompose_8cpp__incl.md5
@@ -1 +1 @@
-0aaf50ef77094991d705b3bba1630939
\ No newline at end of file
+c49d4414684dfa5c0216b861a7d3fdd1
\ No newline at end of file
diff --git a/dc/d37/lu__decompose_8cpp__incl.svg b/dc/d37/lu__decompose_8cpp__incl.svg
index 2f08e9c80..20eed1693 100644
--- a/dc/d37/lu__decompose_8cpp__incl.svg
+++ b/dc/d37/lu__decompose_8cpp__incl.svg
@@ -4,18 +4,18 @@
-
-
+
+
numerical_methods/lu_decompose.cpp
-
+
Node1
-
-numerical_methods/lu
-_decompose.cpp
+
+numerical_methods/lu
+_decompose.cpp
@@ -23,61 +23,112 @@
Node2
-
-ctime
+
+cassert
Node1->Node2
-
-
+
+
Node3
-
-iomanip
+
+ctime
Node1->Node3
-
-
+
+
Node4
-
-iostream
+
+iomanip
Node1->Node4
-
-
+
+
Node5
-
-vector
+
+iostream
Node1->Node5
-
-
+
+
+
+
+
+Node6
+
+
+./lu_decomposition.h
+
+
+
+
+
+Node1->Node6
+
+
+
+
+
+Node6->Node5
+
+
+
+
+
+Node7
+
+
+valarray
+
+
+
+
+
+Node6->Node7
+
+
+
+
+
+Node8
+
+
+vector
+
+
+
+
+
+Node6->Node8
+
+
diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html
index 4250e23fb..cd33aacf0 100644
--- a/dc/dc5/paranthesis__matching_8cpp.html
+++ b/dc/dc5/paranthesis__matching_8cpp.html
@@ -141,7 +141,7 @@ char