vv

13805 Reputation

20 Badges

9 years, 308 days

MaplePrimes Activity


These are replies submitted by vv

@Carl Love It should be better:

proc(L::{list, set}, $) option overload; ilcm__orig(L[]) end proc

 

@acer  Let's consider just polynomials in one variable over Q.
Is there a good simplifier for them? compoly could be a candidate but it most often fails.
ex := -10*x^9 + 45*x^8 - 120*x^7 + 210*x^6 - 252*x^5 + 210*x^4 - 120*x^3 + 45*x^2 - 11*x + 1;

@nm If you need all the chains for each eigenvalue then this is equivalent with finding the Jordan form and the transition matrix. So practically you will have to program a new JordanForm. It remains to see whether it will be better than Maple's version.

@dharr  Maple computes diff(HeunB(a1,a2,a3,a4, u(z)), z,z);  with a formula having u(z) at the denominator.
 

@janhardo  The geometric idea is simple. A path integral equals the length of the curve for f = 1.

E.g. if the curve is the unit circle in the xy plane and S is the right circular cylinder based on this circle and the height is 1, then the area of the cylinder equals (obviously) the length of the circle:
plots:-display(
plot3d([cos(t), sin(t), z], t=0..2*Pi, z=0..1, color=pink, style=surface, transparency=0.25),
plots:-spacecurve([cos(t), sin(t), 0], t=0..2*Pi, color=blue, thickness=3)
);

@Carl Love The replacement is necessary for r>0 too.

@Carl Love 
Thanks. I wonder why the formula was not included somewhere (e.g. in `simplify/Psi` or some convert); maybe it was forgotten.

Your extension is wrong for Psi(r) when r is a negative rational; probably because the original Psi has 2 arguments (or recursive overload problem); it would be interesting to investigate.

Edit. The mistake: (n-1)*(q+1) must be replaced with (n-1)*q+p

Just curious: what's wrong with a .mla update? It used to work well in the past. Is it not the case in "modern Maple"?

@tomleslie Maybe because you are using a 65 bit OS  :-)

@nguyenhuyenag 
The question is what information about f is contained in discriminant(f,[k])?
When such a computation is useful for a polynomial in several variables?

Also, if you try  g:=eval(f, a=d+e) in your last example, it does not terminate.

What are you trying to obtain?
E.g. in your last example, what does discriminant(f, [k]) represent for f?

@afernande1008 

It's a bug in Physics:-diff. Use diff instead.

F:=int(f(x+r(t)), x=0..1):
Physics:-diff(F, r(t)); # bug

                               0
diff( eval(F, r(t)=rt), rt); # OK
                 int(D(f)(x + rt), x = 0 .. 1)
 

@Axel Vogt I don't think so. The function is

f := f0 + r:  # where
f0 := x -> add(- i * sin((i + 1) * x + i), i=1..5):
r := rand(-1. .. 1.):
plot(f, -10 .. 10, numpoints=5000);

and it is practically nowhere continuous. DirectSearch does not try to "clean-up" the noise r().

The program is written in Algol. The syntax is close to Maple, so, if you produce from the pdf a correct text file (with indentation) it should be easy to obtain a Maple version.

First 40 41 42 43 44 45 46 Last Page 42 of 176