roman_pearce

Mr. Roman Pearce

1678 Reputation

19 Badges

20 years, 218 days
CECM/SFU
Research Associate
Abbotsford, British Columbia, Canada

I am a research associate at Simon Fraser University and a member of the Computer Algebra Group at the CECM.

MaplePrimes Activity


These are replies submitted by roman_pearce

rtable_scanblock won't work well on sparse matrices. Try this (props to Joe Riel): maxindex := proc(A::Matrix) local i; op(attributes(max(seq(setattribute(Float(abs(rhs(i)),0), [lhs(i)]),i=op(2,A))))) end proc:
rtable_scanblock won't work well on sparse matrices. Try this (props to Joe Riel): maxindex := proc(A::Matrix) local i; op(attributes(max(seq(setattribute(Float(abs(rhs(i)),0), [lhs(i)]),i=op(2,A))))) end proc:
I am currently away on a trip but when I get home this weekend I'll take a look at my Gentoo system and try to help you guys out.
I've been testing the release candidate of this patch and it's very good. Congratulations are in order for the people who worked on this, even if it is only a point revision.
Not all equations can be solved symbolically, for example x=cos(x). If you want a numerical solution you can use the fsolve command, ie: fsolve(equation);
Not all equations can be solved symbolically, for example x=cos(x). If you want a numerical solution you can use the fsolve command, ie: fsolve(equation);
Sorry I'm on a trip so I have no idea what version of glibc I'm using. It is whatever version was current in January of this year. I was also using Maple 10 - I've never tried Maple 9.5 with NPTL. This is basically a bug (although it is technically unsupported). Can anyone in the company comment on this thread ?
For anyone who is wondering why 0 and 1 appear so frequently: Benford's law
For those interested in playing with knots on a computer, I highly recommend KnotPlot.
This is excellent, and I can't wait to try it out :)
If you can compute the number of v's (when coeffs is called) then do C := [coeffs(g, {seq(v[i], i=1..n)}, 'M')]; where n is the number of v[i]'s.
If you can compute the number of v's (when coeffs is called) then do C := [coeffs(g, {seq(v[i], i=1..n)}, 'M')]; where n is the number of v[i]'s.
This is a great suggestion
In algebra, certainly. Maple has a lot of quirky packages which do interesting things. Many of them come out of advanced research projects. Maple is also very strong for differential equations.
In algebra, certainly. Maple has a lot of quirky packages which do interesting things. Many of them come out of advanced research projects. Maple is also very strong for differential equations.
First 32 33 34 35 36 37 38 Page 34 of 39