4019 Reputation

17 Badges

6 years, 177 days

MaplePrimes Activity

These are replies submitted by mmcdara


Ok, could have been a reason.
Good luck

Why not just import the whole file?
I could understand that if your file had a large number of columns and you were only interested in 3 of them. But in your case importing the whole 4 columns file is not more expensive that importing only 3 of them.

Let's assume M is the matrix whivh represents the content of your file and that the columns of interest have numbers i, j and k.
If you want to plot column j versus column i just do 

plot( M[.., [i, j]] )

or, if you want just a specific range m..n :

plot( M[m..n, [i, j]] )


What postprocessing are you talking about?

  • if the read command takes too long, instead of save+read you can try 
    FileTools[Binary][WriteFile] + FileTools[Binary][Read]
    I use to use this for large matrices 106 by 100 (floats, typically 800 Mo), Read is done in less than 4 minutes.

PS; There is no document here 


What does this mean???


Thank you. I wasn't aware of this command.

Two ways:

  1. see plots:-arrow
  2. or plottools:-arrow (I prefer this one)

this is sent from my phone and I can't check my reply: are you sure the last format is keres and not keras ?


Thanks for your background.
I probably make poor use of Grid but I am saved by my PC having enough Gbytes not to be really bothered.


Thank you acer for this detailed reply.
When I Grid:-Run my code I always face a balance issue between computation time and memory used.
Increasing the number of nodes to use decreases the former at the detriment of the latter. 
Is this the consequence of your sentence "The Grid package uses distinct instances of the Maple kernel (engine) for each node, with no cross-pollution of memory or assignments"?



I usually distribute mutually independent computations on the multiple nodes of my machine (which is not, IMO, the same thing to say that I "parallelize these computations", preferring to reserve that term to refer to parallel algorithms, but that's a point of view).
Anyway, here's the problem: I always do this using Grid. 
What precisely is the difference between Grid and Thread for this type of problem, of which the OP provides a good example?

A priori, there is no problem if you do things correctly (load your code with the big green arrow for us to see what you have really done).

BTW: the way you define A doesn't give a 2 by 2 matrix but a a 1 by 2 matrix



`Maple 2015.2, APPLE UNIVERSAL OSX, Dec 20 2015, Build ID 1097895`



A := Matrix(2, 2, {(1, 1) = x, (1, 2) = x^2, (2, 1) = 2*x, (2, 2) = sin(x)})


Threads[Map](int, A, x=0..2, numeric=true);





Matrix(2, 2, {(1, 1) = 2., (1, 2) = 2.666666667, (2, 1) = 4., (2, 2) = 1.416146837})


Grid[Map](int, A, x=0..2, numeric=true);



Matrix(2, 2, {(1, 1) = 2., (1, 2) = 2.666666667, (2, 1) = 4., (2, 2) = 1.416146837})





Provided the equations are linearly independent :-)
Which is the case here

Doing linear regression with Maple should not (a priori) be a complex task.
Look to Statistics:-LinearFit.

But your question leaves me dubious: why do you talk about stepwise regression in the title and not in your text?
Are you REALLY interested in stepwise regression (or an alternative like ridge or Lasso regression, ...?), i.e. a method that builds a model based on a balance between its complexity (the number of parameters it contains) and the quality of its "fit" (R^2 for example)?

I think you should provide more information about your data before expecting to get a solid answer from someone


Great, I vote up


Sorry to hear that.
I suspect that a reorganization between Assistants and Tutors must have taken place since.
Hope you will get a more appropriate answer

5 6 7 8 9 10 11 Last Page 7 of 91