What’s happening here regarding block sizes and variance
Variance decreases when block size increases.
How is a grade of a block obtained during DBSim
The grade of block is the average grade of all the points inside the block.
How much the variance of the small block v is different from the variance of big block V?
…
Name four (4) issues that DBSim overcomes? (Disadvantages of the traditional techniques)
Name six (6) general characteristics (fonctionnement général) of DBSim
*important
Effect of block size over simulation:
As the block size gets smaller, DBSim→???
As the block size gets smaller, DBSim→SGS
Effect of block size over simulation:
As the block size gets bigger, GSGS→???
As the block size gets bigger, GSGS→LU, but DBSim just looses variability
Name the eight (8) steps of DBSim
Name four (4) Advantages of the DBSim algorithm
Takeaways from this graph?
That performance is based on group size and conditioning data. (There is an optimum group size)
Case Study: Walker Lake
What? Why? Process?
What?: DBSim was only used to change the support size to blocks rather than points
Why blocks rather than point support?: The goal is to determine the conditional probaility distribution of ore blocks that are classified one by one
Process?: 78,000 points on a 1m x 1m grid→780 blocks of about 100-point grades
Case Study: Walker Lake
Explain what happened & why
Higher frequency of extreme values because less pairs are available to acalculate the experimental variogram than in point support
Case study: Walker Lake
Takeaways from this graph?
Study Case: Walker Lake
Takeaways from this graph?
At high grades, DBSim represents batter the connectivity of the data set than SGSim does.
What does Connectivity refers?
Connectivity refers to the degree to which different parts of a mineral deposit are physically linked or related to each other.
Describe this illustred step of DBSim
Initial Situation, where drillholes are represented as red dots and the nodes to simulate in yellow
Describe this illustred step of DBSim
Blocks of chosen size is determined, using a random path, and a search neighborhood depicted in red. Internal are simulated by LU to find the value of the block
Describe this illustred step of DBSim
The nodes of the precedent block are discarded, and we go to the next block liberating memory from storing all the nodes
Describe this illustred step of DBSim
New block, same process.
Covariance can be computed separately to to still save computational costs
Recall LU LU
Hi LU LU <3