commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Phil Steitz" <phil.ste...@gmail.com>
Subject Re: [math] Complex nth roots
Date Tue, 06 Jan 2009 20:47:00 GMT
Yeah. Speed probably goes the other way. Accuracy is another issue.

On 1/6/09, Luc Maisonobe <Luc.Maisonobe@free.fr> wrote:
> Phil Steitz a écrit :
>
>> Committed in r731822.  I noticed one more thing that I just commented
>> for now in the code.  It might be faster and/or more accurate to use a
>> solver to compute the nth root of the modulus.  Should we consider doing
>> this and exposing the associated real function in MathUtils?  If yes,
>> what solver with what parameters?
>
> Is Math.pow so slow ? I would be interested in some benchmarks about
> this. I generally trust modern processors to provide wired
> implementations of most mathematical functions.
>
> Luc
>
>>
>> Phil
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>
>

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message