-
Notifications
You must be signed in to change notification settings - Fork 3
Recursive evaluation #19
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
2f6f147 to
25ad3d3
Compare
|
Please rebase this first onto main and then onto #17. this has diverged too far to merge. In the future it would be useful to have separate WIP PRs open so everybody can see the work being done. |
|
Sorry for asking that, but I think this PR is based on |
|
#17 has diverged very far from |
|
sorry, I mistyped. I meant #18. |
|
but if the the new PR is compatible with |
Still need an SVD or a S2 symmetrization though
Should double check if it'd be the same first nn and then ll
for larger sum(ll), this error accumulates so a larger tolerance should be set...
no accumulated error in this version; necessary documentation added
so that we don't have "almost none zero" zeros singular values, neither the large equivariance violation.
The efficiency is not yet satisfactory though
a1fa4e2 to
3556260
Compare
Now that the new RPE implementation has been merged, I'd like to make another PR about the recursive evaluation of the Coupling Coefficients which is based on the new RPE implementation. More specifically, this PR aims to provide the implementation of calculating the RPE basis for given$n,l \in \mathbb{N}^N$ via
for an arbitrary partition$n = (n_1,n_2)$ and $l = (l_1,l_2)$ .
Some conflicts will occur and should be resolved, the benchmark tests should be removed before it is ready to merge. I'll try to create a task list for this PR.