Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

I got an MS Excel file where the matrix (7054x60) is created and the last row of the matrix is used for optimization of its (the matrix) values. In Maple you can create the matrix as follows:

M := Matrix(7054, 60):
for i to 10 do M[1, i] := 1 end do:

Mat_proc := proc(x)
  local i, j;
  global M;
  for i from 2 to 7054 do

How does this  function  work:

rtable_scanblock( M, [rtable_dims(M)],

    (val,ind,res) -> `if`(val > res[2],[ind,val],res),

    [[1,1],-infinity]);

 

Please could comment on each statement.


Taken from  http://www.mapleprimes.com/questions/131889-Finding-A-Max-In-A-3d-Plot#comment131997

Gracias

xsys11demo.mw

The attached worksheet (xsys11demo.mw, first-order non-linear ODE system) is ~x100 (one hundred) times slower that the "same" program in Mathematica 8. Both give the same/satisfactory numerical results and have similar/identical structure (I can supply the Mathematica 8 notebook, if requested).

I assume that my attached worksheet must be sub-optimally programmed and would be grateful...

Like this! Some error. How to do it

[IMG]http://i730.photobucket.com/albums/ww309/ytyyutianyun/Capture-6.png[/IMG]

I have the function which I run well in Maple V
but in maple 15 .It's wrong. How can it be? and please help me to edit it.

for i from 0 to 15 do
t:=1+i/16;
p.i:=plot(sin(x*t),x=-10..10,axes=none):
od:
display(array(1..4,1..4,[[p0,p1,p2,p3],[p4,p5,p6,p7],
[p8,p9,p10,p11],[p12,p13,p14,p15]]));

Hi everyone,

I guess the question I am asking is quite common, however I am still not able to figure it out. I have several (right now three) non-linear inequalities. Given these inequalities, I try to plot them in one graph and then color the different areas with different colors. It would be also ok, if just the area where all inequalities hold is plotted. To do this I have already tried several things. With implicitplot and transparency it is generally working, but...

I have a 6 x 6 matrix. I want to employ Cramer's rule to solve Gx=Θ. I need to sequently substitute column Vector Θ into the matrix columns. I can't get this to work. I have only being using Maple for a couple of weeks so still finding my way.

myf:=(mu,sigma)->int(exp(-(x-mu)^2/2/sigma^2)/sigma/sqrt(2*Pi)/(1+exp(-x)),x=-infinity..infinity);

plot3d('myf(mu,sigma)',mu=-5..5,sigma=0.5..10);

This plot was never created. I think it's taking too long to evaluate it when it's divegent.

 

Hi all,

For my research purpose, I need to integrate this function. I understand that there maybe values for which this integration is divegent. But is there a way to look into it? Say creat...

how to write a procedure to ceiling a number such as 3.5 to 4

I have a set of multi variate polynomial  equations. I need to setup a matrix [G][x]=[Θ]  Θ is a function of c1 and c2 up to 4th order terms

 My problem x=[c15, c14c2 , c13c22 , c12c23 , c1c24 , c25 ] these 6 5th order terms...

Hi,

 

I'm trying to plot a few phase portraits for this four equation system but maple wont let me...

> restart;

> s := 10; d[T] := 0.2e-1; k1 := 2.4*10^(-5); k2 := 3*10^(-3);
> N := 5; delt := .24; c := 2.4; T0 := 1; 
with(DEtools); 
with(plots);
 

[INSERT YOUR CODE HERE BY COPY-PASTING IN 1-D FORMAT]


Can someone please help me? Thanks

Hi everyone,

 

I want to create a Gaussian PDF so I need to calculate Determinant(sigma) with sigma the covariance matrix of a gaussian variable.

If we call this variable alpha (which is a 12 dimension vector and represents the noise in a discrete dynamical equation), then sigma_ij=ExpectedValue(alpha_i*alpha_j)-ExpectedValue(alpha_i)*ExpectedValue(alpha_j)

and this is zero most of the time! So the covariance matrix is singular and the determinant is zero. 

Hello,

Could you please help me with the following system of equations:

> restart; with(student);
> Z[0] = 377;
> solve({Z = 1/(j*w*C[1]+1/(j*w*L[1])+1/R)+1/(j*w*C[2]+1/(j*w*L[2])), C[1] = w[c]*(w[0]^2-w[c]^2)*(w[2]^2-w[1]^2)/(2*Z[0]*(w[1]^2-w[c]^2)*(w[0]^2-w[1]^2)), C[2] = w[c]*(w[0]^2-w[c]^2)*(w[2]^2-w[1]^2)/(2*Z[0]*(w[1]^2-w[c]^2)*(w[2]^2-w[c]^2)*(w[2]^2-w[0]^2)), L[1] = 1/(w[1]^2*C[1]), L[2] = 1/(w[2]^2*C[2]), R[1] = subs(w = w[1], 2*Z[0]*(1-S[21...

I'm trying to write a program that solves sudoku's using a Groebner basis. I introduced 81 variables x1 to x81, this is a linearisation of the sudoku board.

The space of valid sudokus is defined by:


for i=1,…,81 : Fi=(xi−1)(xi−2)⋯(xi−9) This represents the fact that all squares have integer values between 1 and 9.

for all xi and xj which...

circle_line_intersec.mw

i'm trying to write some code that will output an angle phi when a null event is reached.

see worksheet

First 1625 1626 1627 1628 1629 1630 1631 Last Page 1627 of 2249