OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

test commit

Browse Source
This commit is contained in:
Krishna Vedala 2020-07-10 22:00:57 -04:00
parent 523475b183
commit dc6f322975
No known key found for this signature in database
GPG Key ID: BA19ACF8FC8792F7
2 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
numerical_methods/brent_method_extrema.cpp
View File

@ -180,14 +180,13 @@ void test2() {
} }
/** /**
* @brief Test function to find *maxima* for the function * @brief Test function to find *minima* for the function
* \f$f(x)= \cos x\f$ * \f$f(x)= \cos x\f$
* in the interval \f$[0,12]\f$ * in the interval \f$[0,12]\f$
* \n Expected result: \f$\pi\approx 3.14159265358979312\f$ * \n Expected result: \f$\pi\approx 3.14159265358979312\f$
*/ */
void test3() { void test3() {
// define the function to maximize as a lambda function // define the function to minimize as a lambda function
// since we are maximixing, we negated the function return value
std::function<double(double)> func = [](double x) { return std::cos(x); }; std::function<double(double)> func = [](double x) { return std::cos(x); };
std::cout << "Test 3.... "; std::cout << "Test 3.... ";

2
numerical_methods/durand_kerner_roots.cpp
View File

@ -212,7 +212,7 @@ void test1() {
std::complex<double>(0., -2.) // known expected roots std::complex<double>(0., -2.) // known expected roots
}; };
/* initialize root approximations with random values */ /* Initialize root approximations with random values */
for (int n = 0; n < roots.size(); n++) { for (int n = 0; n < roots.size(); n++) {
roots[n] = std::complex<double>(std::rand() % 100, std::rand() % 100); roots[n] = std::complex<double>(std::rand() % 100, std::rand() % 100);
roots[n] -= 50.f; roots[n] -= 50.f;