Lines Matching +full:method +full:- +full:complexity
42 chunking method, it only uses subtraction to find a quotient digit. It avoids
50 2. It minimizes algorithmic complexity.
53 complexity of `O(n^(2*log_2(3)))` (best case) and `O(n^3)` (worst case).
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
63 This `bc` implements the fast algorithm [Newton's Method][4] (also known as the
64 Newton-Raphson Method, or the [Babylonian Method][5]) to perform the square root
65 operation. Its complexity is `O(log(n)*n^2)` as it requires one division per
73 x - x^3/3! + x^5/5! - x^7/7! + ...
82 to calculate `cos(x)`. It has a complexity of `O(n^3)`.
106 to reduce `x`. It has a complexity of `O(n^3)`.
120 (where `a` is equal to `(x - 1)/(x + 1)`) to calculate `ln(x)` when `x` is small
127 to sufficiently reduce `x`. It has a complexity of `O(n^3)`.
138 x - x^3/3 + x^5/5 - x^7/7 + ...
144 atan(x) = atan(c) + atan((x - c)/(1 + x * c))
147 to reduce `x` to small enough. It has a complexity of `O(n^3)`.
158 x^n/(2^n * n!) * (1 - x^2 * 2 * 1! * (n + 1)) + x^4/(2^4 * 2! * (n + 1) * (n + 2)) - ...
166 j(-n,x) = (-1)^n * j(n,x)
169 to calculate the bessel when `x < 0`, It has a complexity of `O(n^3)`.
177 This `dc` uses the [Memory-efficient method][8] to compute modular
178 exponentiation. The complexity is `O(e*n^2)`, which may initially seem
189 [8]: https://en.wikipedia.org/wiki/Modular_exponentiation#Memory-efficient_method