To translate maple code to C or C++ or whatever i would call then placing that maple code inside a C(),

is there a command for doing the reverse?

Download op_error.mw

Hello, 

I'm having trouble seeing which command is calling the "thaw" for the code below and was wondering if someone is able to save me the trouble from working it out myself. i know its not when the "is" function is called from viewing the showstat for it, but the output prior to mapping that function pops out with no troubles, so im guessing its the generic mapping proc, but of course, in built function so i can only assume its the same way i would write it but im pretty sure i dont use thaw either so anyway the line in question:

map(is, seq(seq(map(eval, Matrix(3, omega[1]) = Matrix(3, omega[0]), [n = i, m = j]), i = 1 .. 10), j = 1 .. 10));
Error, (in thaw) too many levels of recursion
 

In some cases, maple is able to return a series expansion when line A is called but fails to do so when line B is called, and in the help page for asympt it defines them to be identical procedures:

A: asympt(f,z)

B:

this has generally occured when ever the function f is of the form:

where g(z) has an asymptotic expansion and when asympt(f,z) is called, maple provides this expansion divided by the exponential function, however line B as prescribed above returns an error. 

So, my question is, which line in showstat(asympt) is responsible for catching the error which line B as above encounters?

The image is an extract from the help page on the function "series" my question is in regard to how a method is selected, ie either it be a taylor or laurent series expansion, or as it defines in the passage attached "a more generalised series".

im just curious to know what procedure maple uses to make this choice when the series function is called, and im also finding it hard to replicate and understand the procedure of computing coeffiecents as described in the extract for a generalised series.

Thanks.