Jurik-Style Moving Average Design
Install and import#
npm install fintech-algorithmsimport { jurikStyleMovingAverageDesign } from "fintech-algorithms/technical-indicators/trend-smoothing/jurik-style-moving-average-design";Signature#
jurikStyleMovingAverageDesign(input)Demonstrates the Jurik design idea without the proprietary internals: the current absolute bar-to-bar change is scored against its own period-bar average, and that score stretches a base smoothing constant between a floor and a ceiling before the average is applied to close.
Parameters#
| Name | Type | Notes |
|---|---|---|
input | TopicInput | bars is a non-empty array of OHLCV records with strictly increasing timestamp, finite open, high, low, close and non-negative volume, all sharing one adjustment basis. From parameters this topic reads period, an integer of at least 2, default 14; base_alpha, default 2 / (period + 1); volatility_sensitivity, a finite number of at least 0, default 0.5; minimum_alpha, default 0.01; and maximum_alpha, default 0.8. The three alpha parameters must each be finite and between 0 and 1. |
Returns#
TopicResult
series and latest carry two keys, value and alpha, the smoothed close and the clamped constant actually used at that bar. Both are null for the first period - 1 bars while the change baseline fills, so with the default period ready_at is 13.
Warm-up#
The first period - 1 bars (13 at the default period of 14) positions are null. The baseline is a simple average of period absolute changes, so nothing prints until index period - 1, where value is seeded with the close. ready_at is that index. A baseline of zero scores 0, which leaves base_alpha unmodified before clamping.
Errors#
- When
parameters.base_alpha,minimum_alpha, ormaximum_alphais not a finite number between 0 and 1 — throws Error - When
parameters.volatility_sensitivityis negative or not finite — throws Error - When
parameters.periodis not an integer of at least 2 — throws Error
Complexity: time O(n * period),
space O(n).
Worked example#
executed Captured by running this function on the input its own test provides. Real output of real code — but not asserted against a published figure.
Input#
{
"bars": [
{
"timestamp": "2024-01-02",
"basis": "synthetic-unadjusted",
"open": 100,
"high": 101.45,
"low": 98.695,
"close": 100,
"volume": 750000,
"benchmark": 200
},
{
"timestamp": "2024-01-03",
"basis": "synthetic-unadjusted",
"open": 101.49111452,
"high": 103.38381693,
"low": 100.05480022,
"close": 101.78791214,
"volume": 795117,
"benchmark": 200.56326135
},
{
"timestamp": "2024-01-04",
"basis": "synthetic-unadjusted",
"open": 102.45519048,
"high": 104.6701838,
"low": 100.91147007,
"close": 102.9549389,
"volume": 840234,
"benchmark": 201.11020913
}
],
"parameters": {}
}Call#
jurikStyleMovingAverageDesign(input)Returns#
object with 9 fields: topic_id, title, state, ready, ready_at, series, latest, parameters, …
{
"topic_id": "D07-F01-A19",
"title": "Jurik-Style Moving Average Design",
"state": "calculated",
"ready": true,
"ready_at": 13,
"series": {
"value": [null, null, null, null, null, null],
"alpha": [null, null, null, null, null, null]
},
"latest": {
"value": 103.48082066608806,
"alpha": 0.17224435187656212
},
"parameters": {},
"diagnostics": {
"causal": true,
"input_count": 96
}
}Diagrams#
Calculation flow#
Jurik-Style Moving Average Design calculation flow
flowchart LR
A["an oldest-to-newest finite price series, declared price so"] --> B["Validate order, basis, and finite values"]
B --> C["Apply the selected Jurik-Style Moving Average Design convention"]
C --> D["Emit value, readiness, and diagnostics"]
D --> E["Interpret descriptively; test outcomes separately"]
B -->|invalid or insufficient| X["Withhold output with a reason"]
Jurik-Style Moving Average Design readiness and evidence states
stateDiagram-v2
[*] --> Waiting
Waiting --> Ready: enough valid causal observations
Waiting --> Rejected: malformed or unsupported input
Ready --> Calculated: selected formula applied
Calculated --> Interpreted: diagnostic and limitation retained
Interpreted --> Ready: next observation arrives
Rejected --> Waiting: corrected input and deterministic reset
How it works#
This page states the contract — how to call it correctly. The article explains the concept: why it works, and where it breaks.
References#
- TA-Lib function groups — see linked primary or authoritative record
- TA-Lib C/C++ API — see linked primary or authoritative record
- TA-Lib maintained source — see linked primary or authoritative record
- Evidence decision
- Level 1 evidence map