minSteps: minSteps
In ppcamp/r-edo-solver: Some mathematical algorithms used in numeric solutions
Description
Usage
Arguments
Value
Note
Author(s)
Examples
Description
Calculates the minimum amount of times must execute bissection method to get some "good"" value.
Usage
1
minSteps(a,b,E)
Arguments
a
INT
Lower bound
b
INT
Upper bound
E
INT
Tolerance
Value
INT ceiling(value)
Note
Classnotes by João
Author(s)
@ppcamp
Examples
1
ppcamp/r-edo-solver documentation built on Dec. 30, 2021, 12:19 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Note Author(s) Examples
Description
Calculates the minimum amount of times must execute bissection method to get some "good"" value.
Usage
1 | minSteps(a,b,E)
|
Arguments
a |
INT Lower bound |
b |
INT Upper bound |
E |
INT Tolerance |
Value
INT ceiling(value)
Note
Classnotes by João
Author(s)
@ppcamp
Examples
1 |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.