Skip to content
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

Faster sequential rules with numpy #56

Open
martinlackner opened this issue Mar 9, 2022 · 0 comments
Open

Faster sequential rules with numpy #56

martinlackner opened this issue Mar 9, 2022 · 0 comments
Labels
enhancement New feature or request help wanted Extra attention is needed

Comments

@martinlackner
Copy link
Owner

The use of numpy may speed up the computation of sequential rules (_seq_thiele_resolute, _seq_thiele_irresolute, _rule_x_algorithm, _phragmen_enestroem_algorithm, _seqphragmen_resolute, _seqphragmen_irresolute, _consensus_rule_algorithm).

This should be implemented as additional algorithms. Currently we have "float-fractions", "gmpy2-fractions", "standard-fractions" for these ABC rules.

@martinlackner martinlackner added the enhancement New feature or request label Mar 9, 2022
@martinlackner martinlackner added the help wanted Extra attention is needed label Jul 4, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request help wanted Extra attention is needed
Projects
None yet
Development

No branches or pull requests

1 participant