New Post: 3.0 roadmap
Hi Thomas, Sorry for the delay, I've just updated the document (with 2014-03 in the title). Feedback is welcome, as usual. Thanks, Christoph
View ArticleNew Post: Thread Safe Random Variate Generation
Thanks for the details, and also to the System.Random bug. Indeed, the array-based routines would not help at all in this use case. Thanks, Christoph
View ArticleNew Post: Sparse Matrix Solver
Hi, Have you tried the new MILU0Preconditioner? Seems like this might be a good use case for a sparse implementation of direct factorizations (LU, QR). Unfortunately these direct factorizations do not...
View ArticleReviewed: Math.NET Numerics v2.6.1 (Bug Fix) (Mar 25, 2014)
Rated 5 Stars (out of 5) - Excellent collection of RNGs!
View ArticleNew Post: 3.0 roadmap
What about referencing this document in RELEASENOTES.md instead of your older blog post? Would make sense for me.
View ArticleNew Post: c# interactive
In case somebody missed this. Roslyn CPT from Microsoft allows c# interactive directly in Visual Studio.>#r "C:\work\csharp\mathnet-numerics\out\debug\Net40\MathNet.Numerics.dll" > using...
View ArticleNew Post: Extract multiply element from a matrix efficiently
Hi, I was wondering is there an efficient way to extract multiply element from a matrix efficiently? For example, I have a index vector idx = [0, 1, 3, 5] and have a matrix rho 8x8. How can I get a new...
View ArticleNew Post: Find Min and Max element in matrix?
Hi, I want to find the max value and minimum value within a matrix. Is there any way to do that without for loops? Thanks
View ArticleNew Post: Find Min and Max element in matrix?
I was under the impression we had added Minimum/Maximum routines a while back, but apparently that was only for vectors. You can use Enumerate however, which is fairly efficient in...
View ArticleNew Post: MKL is even slower
I tested MLK with the following simple codeControl.LinearAlgebraProvider = new MklLinearAlgebraProvider(); ContinuousUniform uniform = new ContinuousUniform(-0.5, 0.5); DenseVector a =...
View ArticleNew Post: MKL is even slower
MKL is slower on the first call (especially since this is not an expensive operation itself) but is faster afterwards, at least if the dataset is large enough. A quick benchmark on my machine (which is...
View ArticleNew Post: Extract multiply element from a matrix efficiently
A feature like this has actually been suggested some time ago in issue #45, including code. In the meantime you could use a loop using matrix.Storage.CopySubMatrixTo.
View ArticleNew Post: MKL is even slower
I've thought about this too. So I changed my code to Control.LinearAlgebraProvider = new MklLinearAlgebraProvider(); ContinuousUniform uniform = new ContinuousUniform(-0.5, 0.5); DenseVector a =...
View ArticleNew Post: MKL is even slower
Note that you're benchmarking a routine that takes roughly 100ns (1s = 1'000'000'000ns). For such short operations at some point the p/invoke and marshaling overhead to call from managed code into...
View ArticleNew Post: Are units interesting?
I often find that I want units, have written some stuff that I can make a pull request of if anyone is interested.
View ArticleNew Post: Are units interesting?
With units you're referring to F# Units of Measure or something in this direction?
View ArticleNew Post: Are units interesting?
Yeah, very similar but for C# (nothing fancy). Sample:var av1 = new AngleUnitValue(90, AngleUnit.Degrees); var av2 = new AngleUnitValue(Math.PI, AngleUnit.Radians); var sum = av1 + av2;...
View ArticleNew Post: Bisection Roots
Hi! I have a polynomial function from which I'd like to calculate the roots. Can anyone show me an example of such? I figured that I have to create a funtion of System.Func(Of Double, Double) type, but...
View Article