Re: MuPAD or Maple - Comments welcome
From: François Fayard (francois.fayard_at_free.fr)
Date: 12/17/04
- Next message: Dave Rusin: "Re: factorization of polynomials"
- Previous message: katya: "factorization of polynomials"
- In reply to: CPT: "Re: MuPAD or Maple - Comments welcome"
- Messages sorted by: [ date ] [ thread ]
Date: Fri, 17 Dec 2004 16:56:27 +0100
On 2004-12-07 14:56:52 +0100, CPT <mm002a@netscape.com> said:
> I would be interested in comments on this topic. I want to do some
> (fairly simple) polynomial manipulation and optimisation (the sort of
> thing which you seee when calculating the best value of omega in an SOR
> iteration.
> I, too, am comparing Maple and MuPad.
> MuPad seems to be more powerful and therefore harder to use! I have to
> spend a lot of time telling MuPad what the variables are....
> Maple makes some (correct) assumptions!
> Anyone have similar (or different) experiences?
> Thanks
> CPT
If you want to do some basic algebra, MuPAD will be as good as Maple,
and is rather cheaper.
There are a lot of domains, where Maple beats MuPAD on specific
application (like PDE solver), but on the other side the way MuPAD
behaves is much more easy to understand, and by default it doesn't take
some asumptions without warnings.
So, let say that the good points of MuPAD are :
- the price
- well designed
- excellent documentation
- better handling of specific cases
- (personnal advice) very nice to use
On the other side Maple is much more mature, so :
- Some functions are much more powerfull than MuPAD
So, if you want to do things that all CAS do go for MuPAD. For some
specific purposes, Maple will be better.
Regards,
François
- Next message: Dave Rusin: "Re: factorization of polynomials"
- Previous message: katya: "factorization of polynomials"
- In reply to: CPT: "Re: MuPAD or Maple - Comments welcome"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|