792 Reputation

11 Badges

9 years, 211 days

MaplePrimes Activity

These are replies submitted by sand15


Still a lot of errors:

  • As you perform an integration over x, C is a function of t alone.
  • You missed many " * " symbols (a common error for people using 2D input mode).
    For instance tou wrote `n πx` instead n*Pi*x (copy paste your expression into a 1D input mode worksheet).
  • It's quite simple to see (after having corrected the previous error) that the value of the integral is
    3250 * f(t) * exp(-lambda^2*t)

    (just put the terms containing t out of the integral and even out of the Sum])
    Thus C, which is an infinite sum of this value is infinite too.

    HINT: You probably wanted to write


    ? But even in this case 

    sum(int(sin(n*Pi*x/L)*sin(m*Pi*x/L), x=0..L), m=1..+infinity) = 3250  # whatever the value of n

I can't do anything more for you;
Correct your own equations and come back if you still have a problem.


None of what you are looking for (PLS, PCR, KNN [see your previous question]) is avaliable in Maple.

Concerning KNN: if I'm not mistaken I think @Carl Love posted an implementation of it, let's say less than a year ago.
Try and search this within the "Posts".

Concerning PLS and PCR I will provide you two codes in a few hours (I need to extract them from a larger project I'm working on and make them work in an autonomous way... so it takes time).
See you soon.

Does it makes sense to have negative weights?

If you want to copy together, what don't you generate a single image ?
Something like this

ttt1 := textplot([0, 1, "3  +  5  =  __", color = "black", font = ["Arial", "bold", 120]]);
ttt2 := textplot([0, -1, "1  +  3  =  __", color = "black", font = ["Arial", "bold", 120]]);
display(ttt1, tt2, size = [1000, 400], axes = none);


Thank you acer for your comments and improvements.


I tried to avoid typos but I missed this one, thanks.

With  optionsimplicit=[grid=[50, 50]] in inequal(...) the boundary is, IMO, smoother an more correct than the one you get with Mathematica.
As I have edited my answer you can see that the boundary is indeed very smooth (zoom on the figure to verify this).

Refining this grid gives an even smoother boundary but increases the computational time too.

Nevertheless, what I have done is only a workaround that we should not have to use if the visualization procedures were more efficient.
I'm  not even sure that my "trick" still works for other feasibility domains and/or mappings

Defining H this way

H := `#mrow(mo("["),msup(mo("H"),mo("+")),mo("]"))`

will make the equality

 V__b=V__a*(( C__a/(1+H/K__a)-H+K__w/H)/(C__b/(1+K__w/H/K__b)+H-K__w/H))

to appear exactly as in pour post.

H is an atomic variable you can manipulate in all the ways you want, for instance tomleslie's


Thank you nm, I vote up.

Here is a simplified version of the previous answer I gave as mmcdara.
More of this I corrected an error due to the fact that the maximum values of the PDF are not equal to 1;
so please disregard my answer as mmcdara

Projector := proc(f, R, N, k)
  local a := op(1, R):
  local b := op(2, R):
  local T, S:
  uses Statistics:

  if k > 0 and k < N then
    T := RandomVariable(Triangular(a+(b-a)*(k-1)/N, a+(b-a)*(k+1)/N, a+(b-a)*k/N)):
    return Mean(f(T)) * ((b-a)/N)
  elif k=0 then
    T := RandomVariable(Triangular(a, a+(b-a)/N, a)):
    return Mean(f(T)) * ((b-a)/N/2)
  elif  k=N then
    T := RandomVariable(Triangular(b-(b-a)/N, b, b)):
    return Mean(f(T)) * ((b-a)/N/2):
    error cat("k must be an integer between 0 and ", N, " (given value ", k, ")")
  end if:
end proc:
Array(0..6, k -> Projector(x -> sin(Pi*x), 0..1, 6, k))



Thank you Tom for this detailed answer.

I will indeed stick to your last advice.

@Thomas Richard 

Using strict inequalities is indeed a good advice.

Converning your last remark "The help file (?convert,Heaviside) indicates that proper conversion is not always possible." :
yes, @acer has recently told me something about this recently.
But his advice was about using And/Or/Not instead of and/or/not (thus my code), but it seems we must be even more careful.


Thanks, I've just sent the suspicious file to @Thomas Richard

@Thomas Richard 

Thanks for your reply.

Did you install the last update for Maple 2020?
I use  the version 2020.2 with W10. It has been installed by the technical support of my company in november 2020.
Looking at the link you give it seems that I am using the latest update.
If this is not the case I will soon have Maple 2021, which will solve the problem if I understand correctly.

Here is the file? I hope you will be able to read it (we have very little permissive firewalls and it has already happened that files are not loaded correctly)


No explanation but a very usefull workaround.
Thank you very much acer.


(reply from the office)

Point 1: I agree with your interpretation but this would mean that it is not necessary to click on the point you want to move in order to select it, but simply in a neighborhood of it whose extent is controlled by the value 5.
I didn't verified this but it seemed so strange that I suspected some hidden meaning (thus the search of the point closest to the click point) 

Point 2: a solid argument in favor of the tables, thanks for the tip

First 8 9 10 11 12 13 14 Last Page 10 of 25