StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics
https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
35 lines
1.2 KiB
35 lines
1.2 KiB
4 years ago
|
robust-sum
|
||
|
|
==========
|
||
|
|
Computes the sum of two increasing non-overlapping sequences of floats as an increasing non-overlapping sequence. This can be used to perform exact arithmetic calculations on floating point values.
|
||
|
|
|
||
|
|
For more information, see:
|
||
|
|
|
||
|
|
* Jonathan Richard Shewchuk, ["Adaptive precision floating-point arithmetic and fast robust geometric predicates"](http://www.cs.cmu.edu/afs/cs/project/quake/public/papers/robust-arithmetic.ps). 1997
|
||
|
|
|
||
|
|
## Install
|
||
|
|
|
||
|
|
npm install robust-sum
|
||
|
|
|
||
|
|
## Example
|
||
|
|
|
||
|
|
```javascript
|
||
|
|
var robustSum = require("robust-sum")
|
||
|
|
|
||
|
|
var seq = robustSum([1, 64], [1e-64, 1e64])
|
||
|
|
console.log("result = ", seq)
|
||
|
|
```
|
||
|
|
|
||
|
|
## API
|
||
|
|
|
||
|
|
### `require("robust-sum")(a, b)`
|
||
|
|
Computes the sum of two non-overlapping increasing sequences of floats exactly as a non-overlapping increasing sequence of floats.
|
||
|
|
|
||
|
|
* `a` is a non-overlapping sequence of floats that is increasing in magnitude
|
||
|
|
* `b` is a non-overlapping sequence of floats that is increasing magnitude
|
||
|
|
|
||
|
|
**Returns** A non-overlapping increasing sequence that encodes the result of `a+b`
|
||
|
|
|
||
|
|
## Credits
|
||
|
|
Based on JRS' robust geometric predicates for floating point arithmetic.
|
||
|
|
|
||
|
|
Implementation (c) 2013 Mikola Lysenko. MIT License
|