Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
Like the title says I'm in need of someway to store and compute with Integers in excess of 500,000 digits in C++. The operations that this program needs are: Divide(Integer), add, subtract, and modulus. Does anyone know of a library out there that can help me accomplish this?
GMP is what you want. There is no practical size limit to processing large integers or floating point numbers. GMP is capable of processing billions of digits, so you are well within the realistic range. It is primarily dependent on your system's architecture and available memory limitations.
http://gmplib.org/
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 8 years ago.
Improve this question
Currently I'm working in a simple code generator to output an assembly-like language.
Background:
I've already working part of a register allocator but now I need to deal with instructions like mul/div which has fixed registers as input: eax/ebx which I don't know how to deal with it, so I'm looking for see how other implemenations does it. I've tried tcc. While the code is very small I find a bit hard to understand.
NOTE: I'm targeting C/C++ because it's the languages I'm more familiar with, but implementation in any language is very welcome.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
Can anyone recommend a good numerical library providing a C++ implementation of Hermite polynomials? I am building them brute force, using iterative algorithms, but I would like some ready made alternatives which will probably work more quickly.
If you don't mind using Boost, there is a Hermite polynomial implementation in boost/math/special_functions/hermite.hpp
Check out the docs here: http://www.boost.org/doc/libs/1_55_0/libs/math/doc/html/math_toolkit/sf_poly/hermite.html
The Boost libraries have a ready made set of functions for Hermite Polynomials.
#include <boost/math/special_functions/hermite.hpp>
I've never used this boost header but you can start reading about it here:
http://www.boost.org/doc/libs/1_36_0/libs/math/doc/sf_and_dist/html/math_toolkit/special/sf_poly/hermite.html
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 8 years ago.
Improve this question
There are any good benchmark framework for C++?
I know Hayai and Celero, but I wonder if there is a better tool available.
Anyone recommends a benchmark framework for C++?
I had the same question today and the only C++ benchmark frameworks I could find were the ones you mentioned: Celero and hayai.
I'll try Celero first, because it has an option to save the benchmark results in XML format, whereas hayai apparently can only print benchmark results to the console.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
I am looking for some c/c++ libraries to do fixed point singular value decomposition or eigenvalue decomposition. Do you know any libraries or any pointers to existing codes?
Thanks
There is a good answer to your question in this thread:
Single Value Decomposition implementation C++
Also, #Bathsheba is pointing you to a good resource, in Numerical Recipes. C is free, but C++ is only "available" with the paid version:
C: http://apps.nrbook.com/c/index.html
C++: http://www.nr.com/oldverswitcher.html
Numerical recipes is a good place to start for all this stuff, visit www.nr.com.
It has versions in C and C++ and other languages although an old cat like me sticks to the C versions.
The very well-written book also explains the algorithms in good detail (the authors are 4 Cambridge professors).
You will have to do some tweaking for fixed point; may be as simple as changing the data types.
Worth a look though methinks.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Questions asking us to recommend or find a tool, library or favorite off-site resource are off-topic for Stack Overflow as they tend to attract opinionated answers and spam. Instead, describe the problem and what has been done so far to solve it.
Closed 9 years ago.
Improve this question
I'm looking to compute the Moore-Penrose pseudo-inverse of a matrix in C++, can someone point me to a library implementation or a numerical recipe?
Thanks!
You need 'Single Value Decomposition', from which you can find a C implementation here from Numerical Recipes in C.
This other site describes how to use single value decomposition to calculate the pseudo-inverse.