Partitioning of an Element: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
'''Partitioning on an Element'' is used in a cyclical way to order the indexing of the matrix under development. | '''Partitioning on an Element''' is used in a cyclical way to order the indexing of the matrix under development. | ||
In the process of [[Partitioning|partitioning]], data are supplied that partially fill the matrix. Each cycle may involve several parts, and each part involves the ''same four steps'': | In the process of [[Partitioning|partitioning]], data are supplied that partially fill the matrix. Each cycle may involve several parts, and each part involves the ''same four steps'': | ||
* First cycle has only one part, and four steps | * First cycle has only one part, and four steps. | ||
* Second cycle may have as many as three parts, depending on the results of the first | * Second cycle may have as many as three parts, depending on the results of the first cycle. | ||
cycle. | * Third cycle may have as many as nine parts. | ||
* Third cycle may have as many as nine parts | |||
* The nth cycle may have as many as 3<sup>n-1</sup> parts. | * The nth cycle may have as many as 3<sup>n-1</sup> parts. | ||
Revision as of 11:34, 10 January 2022
Partitioning on an Element is used in a cyclical way to order the indexing of the matrix under development.
In the process of partitioning, data are supplied that partially fill the matrix. Each cycle may involve several parts, and each part involves the same four steps:
- First cycle has only one part, and four steps.
- Second cycle may have as many as three parts, depending on the results of the first cycle.
- Third cycle may have as many as nine parts.
- The nth cycle may have as many as 3n-1 parts.
Experience suggests that only a few cycles will normally be needed to develop a Reachability Matrix, and the number of parts will seldom be as high as the stated maxima.