CNF:Monte Carlo Event Generator using a Tessellation: Difference between revisions
Jump to navigation
Jump to search
Spyridon97 (talk | contribs) |
Spyridon97 (talk | contribs) |
||
| Line 17: | Line 17: | ||
# Replace linear search (O(n)) of tetrahedrons with given weight threshold with binary search (O(log(n))) ✔ | # Replace linear search (O(n)) of tetrahedrons with given weight threshold with binary search (O(log(n))) ✔ | ||
# Parallelize code using OpenMP ✔ | # Parallelize code using OpenMP ✔ | ||
== Fall 2020 == | |||
# Use Lebesque integral ✔ | |||
# Incorporate Smart Look-up table utilities ✔ | |||
# Add importance sampling point generation inside simplex (TODO) | |||
= References = | = References = | ||
[https://github.com/gavalian/clas12ai/blob/add-crtc-ml/cnf/main.cc Gagik's MC kernel] | [https://github.com/gavalian/clas12ai/blob/add-crtc-ml/cnf/main.cc Gagik's MC kernel] | ||
Revision as of 22:36, 24 September 2020
Repository
Documentation
Summer 2020
- Add README.md file ✔
Code
Summer 2020
- Organize Gagik's code ✔
- Add command-line interface ✔
- Template code for 2-3 dimensions using:
- Replace linear search (O(n)) of tetrahedrons with given weight threshold with binary search (O(log(n))) ✔
- Parallelize code using OpenMP ✔
Fall 2020
- Use Lebesque integral ✔
- Incorporate Smart Look-up table utilities ✔
- Add importance sampling point generation inside simplex (TODO)