Talk:Total circles area: Difference between revisions
Content added Content deleted
(→Link) |
(→Python Van der Corput: Seems better than the grid in this case.) |
||
| Line 102: | Line 102: | ||
==Python Van der Corput== |
==Python Van der Corput== |
||
Is this solution converging faster or slower than the simpler grid or totally random sampling strategies? |
Is this solution converging faster or slower than the simpler grid or totally random sampling strategies? |
||
: Lets see, |
|||
:* The Python grid uses 500*500 = 250000 points to get a value of 21.561559772. |
|||
:* After 200000 points, the Van der Corput has a value of 21.565708203389384 |
|||
:* The given analytical solution is 21.565036603856395 |
|||
:It looks as if the VdC does more with its 200K points than the grid with 250K, but I like the fact that the VdC generates a finer and finer grid as you take more points unlike the fixed box grid. (Plus I had stowed away the fact that VdC was used for Monte Carlo sims and wanted to try it out). --[[User:Paddy3118|Paddy3118]] 15:07, 22 September 2012 (UTC) |
|||