primesieve
QuantLib
Our great sponsors
primesieve | QuantLib | |
---|---|---|
8 | 1 | |
898 | 4,810 | |
- | - | |
9.4 | 9.8 | |
10 days ago | 4 days ago | |
C++ | C++ | |
BSD 2-clause "Simplified" License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
primesieve
-
The Sieve of Atkin
This is a fascinating Q&A where user GordonBGood analyzes the performance of the Sieve of Atkin and compares it to that of Eratosthenes with a view to practical implementations.
The fast prime generator project primesieve is also relevant: https://github.com/kimwalisch/primesieve
- Primesieve: Fast Prime Number Generator
-
How to implement wheel factorisation?
I've come across this excellent prime sieve on GitHub, and I just want to find out how it generally works. Yes, it's written in C but I plan to make a Python version that uses some of its methods to make a fairly quick prime sieve. However, I'm really not sure how it has implemented wheel factorisation, and no matter how hard I look online, I can't find a good execution of it that works with its segmented approach. Does anyone have any idea how the wheel factorisation is implemented? To my understanding it's a modulus array that tells you which numbers modulo n are definitely not prime leaving you with the candidate primes to check, but I'm not sure how you would implement this inside a segment so that you only check the candidate primes. In the prime sieve on GitHub it somehow finds the next multiple of the prime using its lookup tables, which I cannot decipher.
-
Dave's Garage: Sieve of Eratoshenes Competition
Implementation: https://github.com/kimwalisch/primesieve/wiki/Segmented-sieve-of-Eratosthenes
-
https://np.reddit.com/r/programming/comments/o0x6pk/i_made_a_63_line_prime_number_finder_in_rust_over/h1yev0g/
Here another version that still run fast (between 15 and 20ms). A better implementation of the sieve of Eratosthenes is primesieve. You could also use the sieve of Atkin.
-
I built a prime number finder for fun (over 3000 primes found .3 seconds)
Well, that's fine and all, but factually, its very slow: - https://github.com/kimwalisch/primesieve achieve over a billion prime in the same amount of time
-
high precision text-data-files for Phi, Pi and e ?
The list of primes at primes.utm.edu contains just 50 million primes. A program like Primesieve by Kim Walisch can compute them in a fraction of a second.
-
I understand why the borrow checker won't allow this. But what's my Rust-idiomatic alternative?
There are approximately 193 million primes under 232 which is the square root of 264, you quickly generate a list of all primes using https://github.com/kimwalisch/primesieve - and then do trial division in paralelle on your input set using rayon.
QuantLib
-
Question About Fitting The Heston Model To Market Data
Check out the last 2 methods here https://github.com/lballabio/QuantLib/blob/master/ql/models/equity/hestonmodelhelper.cpp
What are some alternatives?
Primes - Prime Number Projects in C#/C++/Python
Eigen
primecount - 🚀 Fast prime counting function implementations
ceres-solver - A large scale non-linear optimization library
prime-spirals - Creates images of prime numbers in various spiral patterns.
GLM - OpenGL Mathematics (GLM)
Riecoin - Riecoin Core repository. Riecoin Whitepaper: https://riecoin.xyz/Whitepaper
TinyExpr - tiny recursive descent expression parser, compiler, and evaluation engine for math expressions
LibTomMath - LibTomMath is a free open source portable number theoretic multiple-precision integer library written entirely in C.
OpenBLAS - OpenBLAS is an optimized BLAS library based on GotoBLAS2 1.13 BSD version.
Xerus - A general purpose library for numerical calculations with higher order tensors, Tensor-Train Decompositions / Matrix Product States and other Tensor Networks
Mission : Impossible (AutoDiff) - A concise C++17 implementation of automatic differentiation (operator overloading)