Function Prototype
/* Vector Square Root */
/* Type: simple */
/* Input arrays: 1 Options: 0 Output arrays: 1 */
/* Inputs: real */
/* Options: none */
/* Outputs: sqrt */
int ti_sqrt_start(TI_REAL const *options);
int ti_sqrt(int size,
TI_REAL const *const *inputs,
TI_REAL const *options,
TI_REAL *const *outputs);
Description
This documentation is still a work in progress. It has omissions, and it probably has errors too. If you see any issues, or have any general feedback, please get in touch.
Vector Square Root calculates the square root of each element in the input array.
$$sqrt_{t} = \sqrt{input_{t}}$$
This is sometimes useful as a building block to more complex functions.
References
Example Usage
Calling From C
/* Example usage of Vector Square Root */
/* Assuming that 'input' is a pre-loaded array of size 'in_size'. */
TI_REAL *inputs[] = {input};
TI_REAL options[] = {}; /* No options */
TI_REAL *outputs[1]; /* sqrt */
/* Determine how large the output size is for our options. */
const int out_size = in_size - ti_sqrt_start(options);
/* Allocate memory for output. */
outputs[0] = malloc(sizeof(TI_REAL) * out_size); assert(outputs[0] != 0); /* sqrt */
/* Run the actual calculation. */
const int ret = ti_sqrt(in_size, inputs, options, outputs);
assert(ret == TI_OKAY);
Calling From Lua (with Tulip Chart bindings)
-- Example usage of Vector Square Root
sqrt = ti.sqrt(input)
Example Calculation
date | input | sqrt |
---|---|---|
2005-11-01 | 81.59 | 9.03 |
2005-11-02 | 81.06 | 9.00 |
2005-11-03 | 82.87 | 9.10 |
2005-11-04 | 83.00 | 9.11 |
2005-11-07 | 83.61 | 9.14 |
2005-11-08 | 83.15 | 9.12 |
2005-11-09 | 82.84 | 9.10 |
2005-11-10 | 83.99 | 9.17 |
2005-11-11 | 84.55 | 9.20 |
2005-11-14 | 84.36 | 9.19 |
2005-11-15 | 85.53 | 9.25 |
2005-11-16 | 86.54 | 9.30 |
2005-11-17 | 86.89 | 9.32 |
2005-11-18 | 87.77 | 9.37 |
2005-11-21 | 87.29 | 9.34 |
Chart
Other Indicators
Previous indicator: Simple Moving Average
Next indicator: Standard Deviation Over Period
Random indicator: Lag
Copyright © 2016-2024 Tulip Charts LLC. All Rights Reserved.