Editing
ALGORITHM II
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== '''Step XI. Final Selection of t.2 - Checking the Convergence of LT and LC''' === :'''11.0.''' If t.2 is known (for example, in the case algorythm is searching for an alternative model), proceed directly to sub-step 11.3. ::'''11.0.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective). :::'''11.0.1.1.''' If :::: - the closest preceding model is a model from the beginning of the trend, and :::: - t.2 of the analyzed model is before or coincides with t.1 of the preceding model, then the considered t.2 is rejected, and this branch of the algorithm is terminated. :::'''11.0.1.2.''' If :::: - the closest preceding model is a trend model, and :::: - t.2 of the analyzed model is before t.1 of the preceding model, ::: the considered t.2 is rejected, and this branch of the algorithm is terminated. If EAM contains a presupposition, the program proceeds to sub-item 11.2. If the model does not contain a presupposition, the program proceeds to sub-item 11.1. :'''11.1.''' The program finds the closest (in terms of time from t.1 of these models to t.3 of EAM) linked model on the preceding trend (preceding or preceding corrective). ::'''11.1.0.''' If there are no preceding models, the program proceeds to sub-step 11.2. ::'''11.1.1.''' If the nearest found linked model (preceding or preceding corrective) is a model from the beginning of the trend (not a trend model), then all potential t.2 that coincide with the bar of t.1 of the found linked model or are located before t.1 of the found linked model are rejected. The program proceeds to sub-step 11.2. ::'''11.1.2.''' If the nearest found linked model (preceding or preceding corrective) is a trend model, then :::'''11.1.2.1.''' In the presence of a preceding trend model, all t.2 that are located before t.1 of the preceding model are rejected. In other words, t.1 of the preceding can be t.2 of EAM, and the points located before t.1 of the preceding - cannot be t.2 of EAM. The program proceeds to sub-step 11.2. :::'''11.1.2.2.''' In the presence of a preceding corrective trend model, the program looks for another linked model on the preceding trend of EAM (the next in terms of distance) and analyzes it as a reference for this item (11.1.). In other words, the program returns to the beginning of sub-step 11.1. ::'''11.2.1.''' For specific models, the program selects the most distant t.2 in terms of time from t.3. ::'''11.2.2.''' For simple models, the program selects t.2 that is as close as possible in time to t.3. :'''11.3.''' The algorithm calculates the level of intersection of TL and AL of EAM (hereinafter β the calculated t.6). The position of t.5 in relation to the level of the calculated t.6 is checked. There are two possible scenarios: ::'''11.3.1.''' If the bar of t.5 does not penetrate the level of the calculated t.6, the program checks if t.5'' has been found (in sub-step 13). Two scenarios are possible: :::'''11.3.1.1.''' If t.5'' has been found, then the program checks for the convergence of TL'' and AL. ::::'''11.3.1.1.Π.''' If the lines converge, then the program checks for the extent of convergence of TL'' and AL. If the ratio of the distance in bars between t.2 and t.4 to the distance between t.4 and the calculated t.6'' is less than the default value of the parameter "Minimum ratio of t.2-t.4 to t.4-t.6 EAM", then t.5'' is rejected. ::::'''11.3.1.1.Π.''' If TL'' and AL diverge, then t.5'' is rejected. :::: In the end of sub-step 11.3.1.1. - the program records the model. :::'''11.3.1.2.''' If t.5'' is absent, the program records the model. ::'''11.3.2.''' If the bar of t.5 penetrates the level of the calculated t.6, then this EAM cannot be built, and the program looks for a new t.5 by processing the bar following the bar of t.5 according to sub-step 2 and further according to the algorithm.
Summary:
Please note that all contributions to MarketPawns may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
MarketPawns:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
MarketPawns Key Ideas
Universal Market Geometry
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information