diff --git a/da/df2/durand__kerner__roots_8cpp.html b/da/df2/durand__kerner__roots_8cpp.html index a38c7b510..3017baea9 100644 --- a/da/df2/durand__kerner__roots_8cpp.html +++ b/da/df2/durand__kerner__roots_8cpp.html @@ -150,7 +150,7 @@ Functions
1206647803780373360 -3599979517947607200 8037811822645051776
-12870931245150988800 13803759753640704000 -8752948036761600000
2432902008176640000
-for std::map container
for IO operations
Sample implementation results to compute approximate roots of the equation \(x^4-1=0\):
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ babylonian_method.cpp File Reference
+
+
+
+
+
+
+
+
+A babylonian method (BM) is an algorithm that computes the square root. +More...
+#include <cassert>+
#include <iostream>+
#include "math.h"+
+Include dependency graph for babylonian_method.cpp:
+
+
+
+
++Namespaces | |
| namespace | numerical_methods |
| for IO operations | |
+Functions | |
| double | numerical_methods::babylonian_method (double radicand) |
| Babylonian methods is an iterative function which returns square root of radicand. More... | |
| static void | test () |
| Self-test implementations. More... | |
| int | main (int argc, char const *argv[]) |
| Main function. More... | |
Detailed Description
+A babylonian method (BM) is an algorithm that computes the square root.
+This algorithm has an application in use case scenario where a user wants find accurate square roots of large numbers
+Function Documentation
+ +◆ main()
+ +
+
+
+
+
+
+
| int main | +( | +int | +argc, | +
| + | + | char const * | +argv[] | +
| + | ) | ++ |
+
+
+Main function.
+- Parameters
-
+
+
+argc commandline argument count (ignored) argv commandline array of arguments (ignored) calls automated test function to test the working of fast fourier transform.
+
- Returns
- 0 on exit
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+
+◆ test()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+Self-test implementations.
+Declaring two test cases and checking for the error in predicted and true value is less than 0.0001.
- Returns
- void
Testcase 1
+Testcase 2
+Real Output 1
+Real Output 2
+Test result for testcase 1
+Test result for testcase 2
+Testing for test Case 1
+Testing for test Case 2
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
T max(T... args)
T min(T... args)
double babylonian_method(double radicand)
Babylonian methods is an iterative function which returns square root of radicand.
Definition: babylonian_method.cpp:31
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
diff --git a/dc/d9c/babylonian__method_8cpp.js b/dc/d9c/babylonian__method_8cpp.js
new file mode 100644
index 000000000..7df58329a
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp.js
@@ -0,0 +1,6 @@
+var babylonian__method_8cpp =
+[
+ [ "babylonian_method", "dc/d9c/babylonian__method_8cpp.html#a28e67885f8606564cc8335f483f63309", null ],
+ [ "main", "dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ],
+ [ "test", "dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..38617ca14
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,6 @@
+
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..f36851892
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+19003ed02c1305b41ac4fcbbe9e4d454
\ No newline at end of file
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..f9ac1c3fc
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,80 @@
+
+
+
+
+
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
new file mode 100644
index 000000000..78b514984
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
@@ -0,0 +1,7 @@
+
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
new file mode 100644
index 000000000..3abb6d423
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
@@ -0,0 +1 @@
+f0ff92e5b2bd8d2d7782f5d3112a0a71
\ No newline at end of file
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
new file mode 100644
index 000000000..8bffac33d
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
@@ -0,0 +1,95 @@
+
+
+
+
+
diff --git a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
index b51200d10..3b323ee3c 100644
--- a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
+++ b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
@@ -231,7 +231,7 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
-
+
+
- Generated by
1.9.2
+
double k(double x)
Another test function.
Definition: composite_simpson_rule.cpp:115
for std::map container
for IO operations
Functions for Runge Kutta fourth order method.
static double change(double x, double y)
for using the vector container
Definition: rungekutta.cpp:33
Namespaces
Namespaces
Files | |
| file | babylonian_method.cpp |
| A babylonian method (BM) is an algorithm that computes the square root. | |
| file | bisection_method.cpp |
| Solve the equation \(f(x)=0\) using bisection method | |
| ► numerical_methods | |
| ► operations_on_datastructures | |
| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
| Nncr_modulo_p | Functions for nCr modulo p implementation |
| Nneural_network | Neural Network or Multilayer Perceptron |
| Nnumerical_methods | For std::map container |
| Nnumerical_methods | For IO operations |
| ►Noperations_on_datastructures | For std::vector |