Dave L

Dave Linder

472 Reputation

16 Badges

15 years, 301 days
Maplesoft
Software Architect
Waterloo, Ontario, Canada

 

Dave Linder
Mathematical Software, Maplesoft

MaplePrimes Activity


These are Posts that have been published by Dave L

Eleven years ago, one of the Maplesoft developers sent around the office this Maple language port of the first example of obfuscated code here.

This code below is text, for insertion in 1D Maple Notation, and runs in

Has anyone tried the technique used here, to run Maple 12's 32bit Classic GUI with the 64bit Maple 12 kernel binaries, on Linux?

Should I try and update it to work with Maple 11 or 12?

It looks like some symlinks would have to change or be added, relative to the way that I did it for Maple 10.

Has anyone ever tried to do a similar thing on 64bit Windows?

Dave L

The following example arrived in my email inbox a few weeks ago. It spurred a short but lively thread of discussion amongst some Maple developers.

I thought that it was interesting enough to post here. I'll hold off on giving my own opinion right away, because I'm curious to read what other MaplePrimes members might write about it.

> q := (6*((1/3)*a-1/9))/(36*a-116+12*sqrt(12*a^3-3*a^2-54*a+93))^(1/3);
                                   6 (a/3 - 1/9...

For double-precision ("hardware") real and complex floating-point operations on Matrices, Vectors, and Arrays Maple makes use of its external-calling mechanism to get to compiled code. A great deal of such compiled code for array operations requires what are known as Basic Linear Algebra Subprograms (BLAS). The BLAS libraries provide support not only directly for Matrix-Vector arithmetic but also indirectly in other external compiled libraries used by Statistics, ArrayTools, LinearAlgebra[Modular], etc.

I thought that I would try to put some tips down in writing here, over time. I'll start off with something very easy.

Some users may have noticed that there is a new, faster routine in Maple 11 for finding purely real roots of polynomials, see ?RootFinding,Isolate . This gets used by fsolve, when only the real roots of a univariate polynomial are requested. Such a request occurs when the 'complex' option to fsolve is not supplied. This new solver is much faster than what was used by default in Maple 10.
1 2 3 Page 2 of 3