Hello,
what's the current status on this issue, please?
http://bugs.freepascal.org/view.php?id=8803
Best regards,
Flávio
___
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel
Alexander Klenin a écrit :
On Mon, Mar 2, 2009 at 21:58, Michael Schnell wrote:
In the "Deutsches Lazarus Forum" there was a project called "GNURZ"
providing this. It was quite promising and I provided some ASM-optimization
for it.
Here the original Author implemented a "Karazuba" multiplicati
Mehmet Erol Sanliturk a écrit :
Alexander Klenin wrote:
For now, NX library with LGPL license fulfills my needs.
The license seems to be no problem at all.
Good, although getting explicit license from the author is always
preferable.
Some commercial companies may object to LGP
Alexander Klenin wrote:
For now, NX library with LGPL license fulfills my needs.
The license seems to be no problem at all.
Good, although getting explicit license from the author is always preferable.
Some commercial companies may object to LGPL Version 3.0 because it requires
On Mon, Mar 2, 2009 at 23:13, Michael Schnell wrote:
>
>> here it has nothing to do with what a Fourier Transform results in. But
>> like FFT it's speed is O(n), while the speed of plain old "school"
>> multiplication and DFT is O(n²).
>
> I suppose in fact it's o(n * ln(n) )
It is O(n^log 3) ~ O
here it has nothing to do with what a Fourier Transform results in.
But like FFT it's speed is O(n), while the speed of plain old "school"
multiplication and DFT is O(n²).
I suppose in fact it's o(n * ln(n) )
-Michael
___
fpc-devel maillist - fpc-
It is Karatsuba, actually (he is Russian professor).
:) Thanks :)
I vaguely remember that although it is asymptotically faster than FFT,
implementation
is complicated and the time constant is higher, so FFT is used in
practice except
for really large problems.
In this application the make-u
On Mon, Mar 2, 2009 at 21:58, Michael Schnell wrote:
> In the "Deutsches Lazarus Forum" there was a project called "GNURZ"
> providing this. It was quite promising and I provided some ASM-optimization
> for it.
>
> Here the original Author implemented a "Karazuba" multiplication, that is a
> lot f
Alexander Klenin wrote:
On Mon, Mar 2, 2009 at 21:27, Michael Schnell wrote:
Do you need integer or floating point ?
Fixed-point, actually.
In the "Deutsches Lazarus Forum" there was a project called "GNURZ"
providing this. It was quite promising and I provided some
ASM-optimizati
I think , in the long run such a facility may be very useful ,
because some times it is becoming necessary to resort such
techniques .
Hmm there is a lot other basic mathematical stuff that is equally
important and IMHO should be provided in separate Libraries (such as
Jedi). (e.g. Primes
On Mon, Mar 2, 2009 at 21:27, Michael Schnell wrote:
> Do you need integer or floating point ?
Fixed-point, actually.
--
Alexander S. Klenin
___
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-dev
Do you need integer or floating point ?
-Michael
___
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel
12 matches
Mail list logo
