[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: approximatino non trancedental numbers
From: |
David Bateman |
Subject: |
Re: approximatino non trancedental numbers |
Date: |
Tue, 16 Oct 2007 14:22:21 +0200 |
User-agent: |
Thunderbird 1.5.0.7 (X11/20060921) |
Willem Hendriks wrote:
> What methods / algorithms does octave use when i type:
>
> 34.25^(0.3) for instance?
>
> does it create an polynomial and find it roots?
> _______________________________________________
> Help-octave mailing list
> address@hidden
> https://www.cae.wisc.edu/mailman/listinfo/help-octave
>
>
The code fragment doing this operation in Octave is
octave_value
xpow (double a, double b)
{
if (a < 0.0 && static_cast<int> (b) != b)
{
Complex atmp (a);
return std::pow (atmp, b);
}
else
return std::pow (a, b);
}
There are similar functions for the 3 other cases real/complex,
complex/real and complex/complex for the arguments.. The the answer to
your question, is Octave uses whatever method/algorithm that is defined
by the libc++ for the std::pow method..
D.
--
David Bateman address@hidden
Motorola Labs - Paris +33 1 69 35 48 04 (Ph)
Parc Les Algorithmes, Commune de St Aubin +33 6 72 01 06 33 (Mob)
91193 Gif-Sur-Yvette FRANCE +33 1 69 35 77 01 (Fax)
The information contained in this communication has been classified as:
[x] General Business Information
[ ] Motorola Internal Use Only
[ ] Motorola Confidential Proprietary