Christoph Ruegg
|
0be3925a8c
|
Bench: revive benchmarking project, for FFT
|
10 years ago |
|
Christoph Ruegg
|
7c2d3b1892
|
Providers: test folder structure
|
10 years ago |
|
Christoph Ruegg
|
c836df7219
|
Find Roots: extend bracketing in derivative-free algorithms to also reduce/subdevision after trying to expand
|
10 years ago |
|
Christoph Ruegg
|
b076067402
|
Root Finding: Zero Crossing Bracketing expansion must reset boundaries if it fails
|
10 years ago |
|
Christoph Ruegg
|
9ee9627a09
|
Merge branch 'fft'
|
10 years ago |
|
Christoph Ruegg
|
efcb5d5b5b
|
FFT: verify mapping between all fourier options
|
10 years ago |
|
Christoph Ruegg
|
4bad397c44
|
FFT: activate in Fourier.Forward/Backward, with full option mapping
|
10 years ago |
|
Christoph Ruegg
|
432bf493a5
|
FFT: force 64bit integers with MKL_INT64
|
10 years ago |
|
Christoph Ruegg
|
c472e8d4c8
|
FFT: fix PCL builds
|
10 years ago |
|
Christoph Ruegg
|
25282489f3
|
FFT: cleanup Cuda and OpenBlas providers similar to MKL refactoring
|
10 years ago |
|
Christoph Ruegg
|
037c1043cb
|
FFT: rework provider discovery to throw less exceptions and work better
when FFT and LA use different providers
|
10 years ago |
|
Christoph Ruegg
|
ea3b57c4b1
|
FFT: include MKL version in MKL provider description (ToString)
|
10 years ago |
|
Christoph Ruegg
|
d7440d5125
|
FFT: MKL provider refactoring due to sharing between FFT and LA - 2
|
10 years ago |
|
Christoph Ruegg
|
a4f5b618e4
|
FFT: MKL provider refactoring due to sharing between FFT and LA
|
10 years ago |
|
Christoph Ruegg
|
6a42fb7c83
|
FFT: fix PCL builds, cleanup
|
10 years ago |
|
Christoph Ruegg
|
df3264c173
|
FFT: do not mask MKL error status
|
10 years ago |
|
Christoph Ruegg
|
3b92b38afd
|
FFT: forward and backward scaling support, drop manual correction in parseval test
|
10 years ago |
|
Christoph Ruegg
|
31c140cf80
|
FFT: MKL backward transformation
|
10 years ago |
|
Christoph Ruegg
|
2ab73ac781
|
FFT: verify parseval theorem
|
10 years ago |
|
Christoph Ruegg
|
8639df292f
|
FFT: experimental implementation with test for complex-complex inplace forward FFT
|
10 years ago |
|
Christoph Ruegg
|
0486971c4a
|
FFT: wire provider to Control class
|
10 years ago |
|
Christoph Ruegg
|
7f5b414bbe
|
FFT: fft provider mvp interface
|
10 years ago |
|
Christoph Ruegg
|
10680b80d1
|
Readme: fix badge spacing
|
10 years ago |
|
Christoph Ruegg
|
89cbb34bbd
|
Readme: switch to version badges with stats, separate MKL and OpenBLAS versions
|
10 years ago |
|
Christoph Ruegg
|
6f19303efc
|
Build: Travis CI setup with .Net Core support
|
10 years ago |
|
Christoph Ruegg
|
d148fedce0
|
Release MKL Native Provider v2.1.0 (rev 10)
|
10 years ago |
|
Christoph Ruegg
|
1a69470504
|
Release v3.13.1
|
10 years ago |
|
Christoph Ruegg
|
aee8534e16
|
Revert "Build: fix remote name"
This reverts commit 480be7d369.
|
10 years ago |
|
Christoph Ruegg
|
ceb697f92f
|
Random: fix RandomSource.Next(x, x+1) #427
Merge branch 'pr-428' (early part)
|
10 years ago |
|
Christoph Ruegg
|
480be7d369
|
Build: fix remote name
|
10 years ago |
|
Christoph Ruegg
|
5b236aee76
|
Random: drop redundant range check in inner loop implementation #427
|
10 years ago |
|
Christoph Ruegg
|
8e131b481b
|
Random: clarify ranges, ensure them at the call site #427
|
10 years ago |
Juri
|
d852f99120
|
Fix Issue #427
Added fix to DoSampleInt32WithNBits too
|
10 years ago |
|
Juri
|
041ee94908
|
Fix Issue #427
Use Fastpath without random-call when only a single value is allowed to be returned.
Added test that result of Next() is within boundaries.
|
10 years ago |
|
Christoph Ruegg
|
3c189f6e3c
|
Docs: add a couple more users
|
10 years ago |
|
Christoph Ruegg
|
f8a4f9ead2
|
Release v3.13.0
|
10 years ago |
|
Christoph Ruegg
|
563107424d
|
Tests: rewrite a test to rely less on test tooling (regression?)
|
10 years ago |
|
Christoph Ruegg
|
5ff9b59c77
|
Paket: update build and test dependencies
|
10 years ago |
|
Christoph Ruegg
|
b872818d47
|
Paket install
|
10 years ago |
|
Christoph Ruegg
|
c8d3b272ba
|
Merge pull request #426 from Aixile/master
Fix recursion issue of CacheObliviousMatrixMultiply
|
10 years ago |
Aixile
|
f36f7581d9
|
Fix recursion issue of CacheObliviousMatrixMultiply
|
10 years ago |
|
Christoph Ruegg
|
b559ca166e
|
Random: Non-biased integer range sampling
|
10 years ago |
|
Christoph Ruegg
|
00eda31645
|
Euclid: Log2 implementation using DeBruijn sequence lookup
|
10 years ago |
|
Christoph Ruegg
|
484f1e44f2
|
Random: improved fallbacks on zero-minInclusive integer sampling
|
10 years ago |
|
Christoph Ruegg
|
aa4aa9d158
|
Random: explicit byte sampling implementation for MersenneTwister and XorShift
|
10 years ago |
|
Christoph Ruegg
|
ef808bbf30
|
Random: protected RandomSource.DoSampleBytes for clearer design around byte-based sampling
|
10 years ago |
|
Christoph Ruegg
|
656af9870f
|
Merge pull request #423 from larzw/gauss-legendre
Gauss-Legendre
|
10 years ago |
Larz White
|
02fa24b297
|
Changed code documentaion to make it more clear on the allowed node/weights.
|
10 years ago |
|
Larz White
|
c9cd5ae24a
|
Added documentaion for numerical integration.
|
10 years ago |
|
Larz White
|
d475314597
|
Cleaned up Gauss Legendre code.
|
10 years ago |
