Bluebit Software
Bluebit Software Support Forum
 Home          Members     Calendar     Who's On

Welcome Guest ( Login | Register )
        



Matrix Computation Speed Expand / Collapse
Message
Posted Friday, April 27, 2007 8:03 AM Post #395
 

Forum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum Newbie
Hi,

I recently downloaded the trial version for testing in my vb.net app. My need is basically to avoid/minimise the for loops associated whenever dealing with arrays and matrices. The matrix library is simple to use but is there a loss of speed in using the library over the direct for loops ?

Nilimb  

Posted Friday, April 27, 2007 8:21 AM Post #396
 

Bluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit Support
On the contrary you will get a performance improvement 100-500% compared to normal managed code.

The Bluebit .NET Matrix Library uses internally highly optimized native  C++ libraries, and combines together managed and unmanaged code and delivers the best of both worlds; the speed of native C++ code and the feature-rich and easy to use environment of the .NET Framework.

Please find here some performance benchmarks : http://www.bluebit.gr/benchmarks.htm

Please contact us again if there is anything more we can help.

Trifon Triantafillidis

Lead Developer

Bluebit Software

Posted Friday, April 27, 2007 8:52 AM Post #397
 

Forum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum Newbie
could you please point to documentation of vector examples . Is there an example i can use to compare the speed ?
Posted Friday, April 27, 2007 12:51 PM Post #398
 

Bluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit Support
I am afraid we do not have any tests for vectors online. I you wish you may specify the vector sizes and operations you need timings for and I can run some tests and post the results here.

Trifon Triantafillidis

Lead Developer

Bluebit Software

Posted Monday, April 30, 2007 6:41 AM Post #399
 

Forum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum NewbieForum Newbie
Sure That will be really helpful.

Can you suggest the time for finding squareroot of  [x(3000,1).^2 + y(3000,1).^2] compared to a straightforward code.

Posted Monday, April 30, 2007 8:43 AM Post #400
 

Bluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit SupportBluebit Support
I have used the following code:

 int n = 3000;
 Vector A = new Vector(n);
 Vector B = new Vector(n);
 Vector C ;
 double d;

 A.FillRandom();
 B.FillRandom();

 DateTime start = DateTime.Now;

 C = Vector.Multiply(A, A) + Vector.Multiply(B, B);
 d = Math.Sqrt( C.Sum() );

 TimeSpan span = DateTime.Now.Subtract(start);
 
 Console.WriteLine("result ={0},   time={1}", d, span.Ticks/ TimeSpan.TicksPerMillisecond );
 Console.Read();

The results for various values of n are:


           n    milliseconds
        3000        0
       10000        0
      100000        1
     1000000       31
    10000000      390
 

My machine is a Pentium 4 at 3.2GHz

Trifon Triantafillidis

Lead Developer

Bluebit Software

« Prev Topic | Next Topic »


Reading This Topic Expand / Collapse
Active Users: 0 (0 guests, 0 members, 0 anonymous members)
No members currently viewing this topic.
Forum Moderators: Trifon

Permissions Expand / Collapse

All times are GMT -5:00, Time now is 6:45am

Powered by InstantForum.NET v4.1.4 © 2012
Execution: 0.281. 10 queries. Compression Disabled.
.NET Matrix Library