+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Functions associated with LU Decomposition of a square matrix. +More...
+#include <iostream>+
#include <valarray>+
#include <vector>+
+Include dependency graph for lu_decomposition.h:
+
+
+
+
+
+This graph shows which files directly or indirectly include this file:
+
+
+
+
+Go to the source code of this file.
++Typedefs | |
| template<typename T > | |
| using | matrix = std::vector< std::valarray< T > > |
+Functions | |
| template<typename T > | |
| int | lu_decomposition (const matrix< T > &A, matrix< double > *L, matrix< double > *U) |
| template<typename T > | |
| double | determinant_lu (const matrix< T > &A) |
| Compute determinant of an NxN square matrix using LU decomposition. Using LU decomposition, the determinant is given by the product of diagonal elements of matrices L and U. More... | |
Detailed Description
+Functions associated with LU Decomposition of a square matrix.
+ +Typedef Documentation
+ +◆ matrix
+ +
+
+
+
+
+
+template<typename T >
+ | using matrix = std::vector<std::valarray<T> > | +
+
+Define matrix type as a std::vector of std::valarray
Function Documentation
+ +◆ determinant_lu()
+ +
+
+
+
+
+
+
+template<typename T >
+ | double determinant_lu | +( | +const matrix< T > & | +A | ) | ++ |
+
+
+Compute determinant of an NxN square matrix using LU decomposition. Using LU decomposition, the determinant is given by the product of diagonal elements of matrices L and U.
+- Template Parameters
-
+
+
+T datatype of input matrix - int, unsigned int, double, etc
+
- Parameters
-
+
+
+A input square matrix
+
- Returns
- determinant of matrix A
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ lu_decomposition()
+ +
+
+
+
+
+
+template<typename T >
+ | int lu_decomposition | +( | +const matrix< T > & | +A, | +
| + | + | matrix< double > * | +L, | +
| + | + | matrix< double > * | +U | +
| + | ) | ++ |
+
+Perform LU decomposition on matrix
- Parameters
-
+
+
+[in] A matrix to decompose [out] L output L matrix [out] U output U matrix
+
- Returns
- 0 if no errors +
- +negative if error occurred
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+STL class.
T size(T... args)
STL class.
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
+
+
+
diff --git a/d1/dbe/lu__decomposition_8h.js b/d1/dbe/lu__decomposition_8h.js
new file mode 100644
index 000000000..e5734e378
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h.js
@@ -0,0 +1,6 @@
+var lu__decomposition_8h =
+[
+ [ "matrix", "d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5", null ],
+ [ "determinant_lu", "d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f", null ],
+ [ "lu_decomposition", "d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509", null ]
+];
\ No newline at end of file
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map
new file mode 100644
index 000000000..376071840
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5 b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5
new file mode 100644
index 000000000..470fcdea5
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5
@@ -0,0 +1 @@
+88a2ff7f08f53ee9aac3f59997d32991
\ No newline at end of file
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg
new file mode 100644
index 000000000..86202f5fa
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg
@@ -0,0 +1,58 @@
+
+
+
+
+
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map
new file mode 100644
index 000000000..db3f16a64
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5 b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5
new file mode 100644
index 000000000..8057ce7fe
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5
@@ -0,0 +1 @@
+2046e39037fadeac7e6958ecbc86a537
\ No newline at end of file
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg
new file mode 100644
index 000000000..e0f81b555
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html
new file mode 100644
index 000000000..2b83f9d0b
--- /dev/null
+++ b/d1/dbe/lu__decomposition_8h_source.html
@@ -0,0 +1,352 @@
+
+
+
+
+
+
+
+-
+
+
- Generated by
+
+
1.8.18
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+lu_decomposition.h
+Go to the documentation of this file.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
T srand(T... args)
#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
void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:188
STL class.
bool miller_rabin_primality_test(T num, T repeats)
Definition: miller_rabin.cpp:125
T cos(T... args)
STL class.
void test2()
Test determinant computation using LU decomposition.
Definition: lu_decompose.cpp:66
T size(T... args)
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
T setfill(T... args)
T sqrt(T... args)
void test1()
Test function to find minima for the function in the interval Expected result = 2.
Definition: golden_search_extrema.cpp:78
T push_back(T... args)
T clock(T... args)
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
T isnan(T... args)
Statistical algorithms.
T snprintf(T... args)
T infinity(T... args)
STL class.
T isinf(T... args)
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
STL class.
T real(T... args)
T open(T... args)
Definition: realtime_stats.cpp:72
T rand(T... args)
T swap(T... args)
Functions associated with LU Decomposition of a square matrix.
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
T substr(T... args)
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
T endl(T... args)
void test2()
Test function to find root for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:165
T left(T... args)
T cbegin(T... args)
T strtod(T... args)
double determinant_lu(const matrix< T > &A)
Compute determinant of an NxN square matrix using LU decomposition. Using LU decomposition,...
Definition: lu_decomposition.h:90
T fixed(T... args)
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
STL class.
T imag(T... args)
void test1()
Test function to find root for the function in the interval Expected result = 2.
Definition: brent_method_extrema.cpp:143
T make_pair(T... args)
T time(T... args)
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
T cend(T... args)
T setw(T... args)
T max(T... args)
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
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
std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition: lu_decompose.cpp:18
T is_open(T... args)
T exit(T... args)
friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)
Definition: realtime_stats.cpp:53
T pow(T... args)
+
+
+
diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html
index 356548a49..df11fcde6 100644
--- a/d1/df3/hash__search_8cpp.html
+++ b/d1/df3/hash__search_8cpp.html
@@ -164,7 +164,7 @@ int -
+
+
- Generated by
+
+ 1.8.18
+
In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.
- Warning
- This program is only for educational purposes. It has serious flaws in implementation with regards to memory management resulting in large amounts of memory leaks.
- Todo:
- fix the program for memory leaks and better structure in C++ and not C fashion
- Todo:
- fix the program for memory leaks and better structure in C++ and not C fashion
Typedef Documentation
◆ node
@@ -204,7 +204,7 @@ intn 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','
-
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
T srand(T... args)
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
void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: brent_method_extrema.cpp:188
STL class.
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
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
T cos(T... args)
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
T atof(T... args)
STL class.
T size(T... args)
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
T setfill(T... args)
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
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:55
T sqrt(T... args)
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
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
T push_back(T... args)
T clock(T... args)
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
T isnan(T... args)
Statistical algorithms.
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
T snprintf(T... args)
T infinity(T... args)
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:104
STL class.
T isinf(T... args)
T close(T... args)
T modular_exponentiation(T base, const std::vector< T > &rev_binary_exponent, T mod)
Definition: miller_rabin.cpp:43
T perror(T... args)
std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
STL class.
T real(T... args)
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
T open(T... args)
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
T rand(T... args)
T swap(T... args)
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
T sin(T... args)
T substr(T... args)
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
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
T endl(T... args)
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:218
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
T left(T... args)
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
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
T cbegin(T... args)
T strtod(T... args)
T fixed(T... args)
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
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
STL class.
T imag(T... args)
void test1()
Test function to find root for the function in the interval Expected result = 2.
Definition: brent_method_extrema.cpp:143
T make_pair(T... args)
T time(T... args)
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
T cend(T... args)
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
T setw(T... args)
T max(T... args)
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
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
T is_open(T... args)
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
std::vector< float > operator/(std::vector< T > const &A, float const scalar)
Definition: ordinary_least_squares_regressor.cpp:166
T exit(T... args)
friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)
Definition: realtime_stats.cpp:53
T pow(T... args)
std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:289
-
@@ -435,7 +435,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
-
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 @@
+
+
+
+
+
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 >
global variable mat_size
- Todo:
- @stepfencurryxiao add documetnation
global variable mat_size
- Todo:
- @stepfencurryxiao add documetnation
-
- Todo:
- add documentation
- Todo:
- add documentation
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 @@
-
- Todo:
- implement as a C++ class
- Todo:
- implement as a C++ class