C/C++ Efficient Computation of Large Hermitian Polynomials in C++?

[sor2char]

Im having difficulty computing large Hermitian polynomials in C++. I fear I may have to steer away from a recursive formula. Any help would be greatly appreciated.

John

 

[so-crates]

Recursion would OK as long as you make your programs tail recursive, meaning the recursive call is the last statement in teh function.

 

[Davorak]

Sor2char, you mean you are running out of stack space.

Anything that can be done recursively can be done in a loop. This should take care of stack problems. It can be pain to write some recursive function as a loop however.

Hope this helps.