.NET Version of Mathematical Algorithms now available
Friday, 29 October 2010

NAG has brought out a .NET version of its well established number-crunching solution. 

Developers in .NET environment who program in C#, Visual Basic, Visual C++ or F# can now incorporate the methods from NAG's (Numerical Algorithms Group) extensively tested and comprehensively documented numerical library.

nag

The NAG Library for .NET contains mathematical and statistical methods developed by NAG experts and can be used to include fast and efficient algorithms that enhance application capabilities and reduce development time.

The Library includes areas such as optimization, curve and surface fitting, FFTs, interpolation, linear algebra, wavelet transforms, quadrature, correlation and regression analysis, random number generators and time series analysis. It also incorporates extensive documentation and references, and makes this available from the Visual Studio help systems, to enable users to fully understand the usage of the methods and to guide them to the most appropriate method for the solution of their problem.

NAG is a not-for-profit organisation developing numerical and technical software with close links with academic institutions and industry.

For more information: http://www.nag.co.uk/numeric/DT/DTdescription.asp

Further reading

NAG for GPGPU

New number crunching library - NAG C Mark 9 

Banner


The Art Of Computer Programming - A Great Present
15/12/2024

If you are looking for a programmer present this holiday season, there is one book, or set of books, that should be top of any list... Donald Knuth's The Art of Computer Programming.



Advent Of Code 2024 Now Underway
01/12/2024

December 1st is much anticipated among those who like programming puzzles. It is time to start solving small but tricky puzzles on the Advent of Code website with the goal of amassing 50 stars by Chri [ ... ]


More News

<ASIN:0521880688>

<ASIN:0130314005>

<ASIN:0691145032>

<ASIN:0849374790>

Last Updated ( Sunday, 23 September 2012 )