Indicator Smoothed ADX was written on demand of a forum visitor and was not too difficult. However, the search for a description of the smoothed ADX algorithm resulted in nothing. This is why I give below only the code that has been provided:
Indeed, if you don't try to get into the deep sense underlying the initial text of the smoothed ADX, this smoothing can be divided into two stages. Suppose we have a numerical sequence P and we have to smooth it with a minimum lag. For this, we build at the first stage function V(P) of P-sequence oscillation from the following formula:
V0 = (8*P0 - 7*P1 + 3*V1) / 4,
Or, in a different way:
V0 = (Vol(P) + 3*V1) / 4,
Vol(P) = 8*P0 - 7P1 - Ehlers' burst (the term is invented by myself).
At the second stage, we apply the simple weighted smoothing:
W0 = (1*V0 + 2*W1) / (2 + 1).
Translated from Russian by MetaQuotes Software Corp.
Original code: https://www.mql5.com/ru/code/7072
Spearman's Rank Correlation is a non-parametric method used in order to make statistical studies of relations between phenomena. In this case, the factual degree of parallelism between two numeric sequences will be detected.Center of Gravity by J. F. Ehlers
Center of Gravity is an oscillator developed by John F. Ehlers and presented in his article in Stocks & Commodities magazine (May 2002).