ComputerUser

515 Reputation

10 Badges

8 years, 284 days

Social Networks and Content at Maplesoft.com

Seldom to ask question after retired math hobby Just waiting for beauty who born in 1994 And waited for her email to mavio@protonmail.com What is the difference in ownership among different universe?

MaplePrimes Activity


These are replies submitted by ComputerUser

@vv 

sorry for missing one photo

my notebook load maple prime web very slow, I can only use iphone

start from a^2 , result different from book above photo

and aa0 can not be calculated with orbit , and how to calculate the orbit result at orbit size 3 at bottom table of the book photo

 

@vv 

i understand now

a^4 repeated for a^2

so not choose a^4

and if calculate larger than orbit size 

it will repeated too

but I do not understand , start from a^2

the result is different from the book

and aa0 , can not calculate with orbit

return error

moreover when aa[3]= a^3

but how calculate the result having 3 numbers 036, 147 etc at orbit size 3

@vv 

why orbit size 1 is 678

how to calculate this?

a^6 = a^0

how to calculate (018) .. etc at the bottom table

i use fixpoints and orbit function not work

 

and why it choose orbit size 1,2,3,6 only?

@Kitonum 

but i need a while to do a further combination 

from this result I need to choose 51 different rows

and search

@tomleslie 

I need 1 and 0 in all combination as described above

i expect larger , 10 one and 75 zero

@Mariusz Iwaniuk 

my application is quantum matrix

one of invariant value sometimes is not exactly 1.0 

i am thinking why invariant is not always invariant.

i searched that is caused by superposition 

but convolution of list and sum result is the same as distributive law

so, how to use convolution to make invariant always invariant?

@Mariusz Iwaniuk 

 

restart:
conv := proc(a, b)
c := []:
for k from 1 to nops(a)+nops(b)-1 do
 result := 0:
 for i from 1 to k do
  if k-i+1 <= nops(b) and i <= nops(a) then
  result := result + a[i]*b[k-i+1]:
  end if:
 od:
 c := [op(c), result]:
od:
return c:
end proc:
with(LinearAlgebra):
M := Matrix([[1,2,3],[4,5,6],[7,8,9]]):
X := Matrix([[x1],[x2],[x3]]);
MatrixMatrixMultiply(M,X);
something should be convsolve(conv(M, X) = a value);
row1 := conv([seq(M[1][a],a=1..nops(M[1]))], [seq(Transpose(X)[1][a],a=1..nops(Transpose(X)))]):
sum(row1[mm], mm=1..nops(row1));
row2 := conv([seq(M[2][a],a=1..nops(M[2]))], [seq(Transpose(X)[1][a],a=1..nops(Transpose(X)))]);
sum(row2[mm], mm=1..nops(row2));
row3 := conv([seq(M[3][a],a=1..nops(M[3]))], [seq(Transpose(X)[1][a],a=1..nops(Transpose(X)))]);
sum(row3[mm], mm=1..nops(row3));
solve([sum(row1[mm], mm=1..nops(row1)), sum(row2[mm], mm=1..nops(row2)), sum(row3[mm], mm=1..nops(row3))], [x1,x2,x3]);
 
 
i do not know the definition of convolution of matrix with x to form a system of equations
i guessed shown above
if above is correct, then does it mean that solve can also solve this system?
 
how to replace distributive rules with convolution in maple?
if this can not be done, can i do it when only not use bracket ( ) to do multiply?
 
is there any example to show only convolution is correct when distributive is wrong?
 

@tomleslie 

is there any one know maple 12 use which method to expand the size of display graph?

@tomleslie 

 

what is yr ?

is there an simple example using dualaxisplot 

vertical line is only x=1, x=2, x=3 etc for example around 12 lines 

because i collect these lines with

L := [op(L), 1]

L := [op(L), 2]

etc

@acer 

firstly I enabled maple security, then =0 not work then I disable security, it work but can not changed yesterday

after tried today, it work in window maple

i just curious why this command is applied globally but not session applied and it has affected after closed and open again

then I try again window discover =2 , display %1 = imaginary value before display matrix

then set =3 to solve this issue in maple 

I use =0 mainly for copying many matrix in window 

because =2 or =3 can not copy matrix

@stefanv 

but i really find invariant in 4x4

why is it pointless in more dimension?

there is no papers mention how to construct a general invariant matrix

and there is not only one kind of matrix invariant. Is there book teaching different kind of general module to find numerical invariant matrix?

@mmcdara 

i do not know the formula 

is there example code to show what happen?

If cube is not matrix

why do people solve cube game?

 

@Carl Love 

not physics this time, 

i am calculating combination of matrix 9 x 9 with 9 different elements, enumration to run all combinations

and also would like to know how the limit of maple , which size of matrix is the limit , such as 23^(23^2) combinations etc....

recently i write a function suitable for parallel computing, if one day run in amazon, how to massive install maple in amazon automatically and run script

is it manually copy script to 100 machines, and how to distributed computing this situation?

some people may guess 7 x 7 is the limit in x64 computer, but i do not believe, and would like to try

 

and also want to know whether there is technique to guess which range of combinations that have what i want to find, so that no need to run all

 

i just run , start from 30^(30^2) has zero ending

i guess limit is 29^(29^2)

@Carl Love 

is Schdinger equation correct?

I/h is a very big number

and

where is Planck h coming from?

It seems can not Ket which show error 

@Carl Love 

my old book example use this,

i forget whether linear algebra in maple 12 have matrixexponential or not

Go to main topic , how to solve the ket

is it matrix or complex number?

should I really have a physics optic lab in order to understand this?

every time i read this still can not get it

some word such polarisation seems really need a optic lab 

Can Time series data play similar things?

where is initial state and how to find ket initial state?

4 5 6 7 8 9 10 Last Page 6 of 45