So it sounds like the special case that would be helpful is when the real
part of the complex base is 0.
On Thu, Aug 3, 2017, 18:26 Dorival Pedroso
wrote:
> Thanks for the advice.
>
> This is the piece of code where I use that function:
> // compute hat(Du)
> pf := float64(p)
> for j := 0; j < N
Thanks for the advice.
This is the piece of code where I use that function:
// compute hat(Du)
pf := float64(p)
for j := 0; j < N; j++ {
ikp := ImagPowN(p) * complex(math.Pow(K[j], pf), 0)
DuHat[j] = ikp * S[j] * A[j]
}
where p is an integer (unbounded), K[j] is a real number from -Inf to +Inf
a
the complex power function is a difficult (time consuming) general
computation.
are you saying that you actually have a program that uses boolean gaussian
integers and needs to do lots of power operations?
if so, i highly recommend that you special case this for your own use.
if this is common t
