FTB-C000319 / Formula component

Wilder Recursive Update

Wilder Recursive Update updates the prior Wilder average using alpha one over n and the current input.

Also known asRMA recurrence

Definitions

In plain terms

The equivalent form adds one-nth of the difference between current input and prior state.

Technical

The recurrence applies only after the declared seed is ready and must preserve order, state, missing policy, and precision.

Scope

It is not a rolling arithmetic mean after initialization.

Formula

RMA_t = RMA_(t-1) + (x_t - RMA_(t-1))/n
LaTeX: RMA_t=RMA_{t-1}+\frac{x_t-RMA_{t-1}}{n}
SymbolMeaningUnit
RMA_(t-1)prior Wilder averageinput unit
x_tcurrent inputinput unit
nWilder periodobservations

Output unit: input unit

Examples

  • A governed lesson uses Wilder Recursive Update only with declared inputs, timing, parameters, and edge-case behavior.

Common misconceptions

  • It is not a rolling arithmetic mean after initialization.

Concept relationships

Where this concept is used

Evidence and governance

  1. Wilder Smoothing in TA-Lib RSI TA-Lib · first party technical publication

    Supports: preferred label, short definition, technical definition, formula

    Limits: The source is an RSI implementation; applying the recurrence to a standalone RMA requires an explicit input and readiness contract.

Reviewed by
fintech-builder-batch-006
Last reviewed
2026-07-27
Next review
2027-07-27
Record status
evidence reviewed

This record is evidence-reviewed and readable, but not yet promoted to published — it is served noindex,follow and excluded from the sitemap.