MaplePrimes Questions

i want to solve a system , A.b+B.X=0 , which A is 5*5 known matrix, B is 5*2 known matrix , and b is 5*1 and X is 2*1 unknown arbitary matrices ! i want to have solution for b and X . whatever they can be ! just equation to be solved !

restart:

A:=Matrix(5,[[-0.9800,0,0,-0.0160,0],[1.0000,0,0,0,0],[-2.1900,-9.7800,-0.0280,0.0740,0],[77.3600,-0.7700,-0.2200,-0.6700,0],[0,-79.9700,-0.0300,0.9900,0]]);

A := Matrix(5, 5, {(1, 1) = -.9800, (1, 2) = 0, (1, 3) = 0, (1, 4) = -0.160e-1, (1, 5) = 0, (2, 1) = 1.0000, (2, 2) = 0, (2, 3) = 0, (2, 4) = 0, (2, 5) = 0, (3, 1) = -2.1900, (3, 2) = -9.7800, (3, 3) = -0.280e-1, (3, 4) = 0.740e-1, (3, 5) = 0, (4, 1) = 77.3600, (4, 2) = -.7700, (4, 3) = -.2200, (4, 4) = -.6700, (4, 5) = 0, (5, 1) = 0, (5, 2) = -79.9700, (5, 3) = -0.300e-1, (5, 4) = .9900, (5, 5) = 0})

(1)

B:=Matrix((5,2),[[-2.44,0.58],[0,0],[0.18,19.62],[-6.48,0],[0,0]]);

B := Matrix(5, 2, {(1, 1) = -2.44, (1, 2) = .58, (2, 1) = 0, (2, 2) = 0, (3, 1) = .18, (3, 2) = 19.62, (4, 1) = -6.48, (4, 2) = 0, (5, 1) = 0, (5, 2) = 0})

(2)

b:=Matrix((5,1),[y[1],y[2],y[3],y[4],y[5]]);

b := Matrix(5, 1, {(1, 1) = y[1], (2, 1) = y[2], (3, 1) = y[3], (4, 1) = y[4], (5, 1) = y[5]})

(3)

X:=Matrix((2,1),[[x[1]],[x[2]]])

X := Matrix(2, 1, {(1, 1) = x[1], (2, 1) = x[2]})

(4)

M:=A.b+B.X

M := Matrix(5, 1, {(1, 1) = -.9800*y[1]-0.160e-1*y[4]-2.44*x[1]+.58*x[2], (2, 1) = 1.0000*y[1], (3, 1) = -2.1900*y[1]-9.7800*y[2]-0.280e-1*y[3]+0.740e-1*y[4]+.18*x[1]+19.62*x[2], (4, 1) = 77.3600*y[1]-.7700*y[2]-.2200*y[3]-.6700*y[4]-6.48*x[1], (5, 1) = -79.9700*y[2]-0.300e-1*y[3]+.9900*y[4]})

(5)

eval(M,y[1]=0)

Matrix([[-0.160e-1*y[4]-2.44*x[1]+.58*x[2]], [0.], [-9.7800*y[2]-0.280e-1*y[3]+0.740e-1*y[4]+.18*x[1]+19.62*x[2]], [-.7700*y[2]-.2200*y[3]-.6700*y[4]-6.48*x[1]], [-79.9700*y[2]-0.300e-1*y[3]+.9900*y[4]]])

(6)

 

 

 

Download solve.mw


actually the problem to be solved is M=0 ! which directly goes to y[1]=0;
after that , how can i find other unknowns so that M=0 is ok. tnx

I have a worksheet (.mw) file that I want to export using a statement to avoid tedious GUI clicking.

How to export a worksheet (.mw) to Maple Input (.mpl) using a statement in the worksheet, so I can just execute the worksheet, and then the Maple Input (.mpl) file is generated?

 

How to get directory name of current worksheet file ?

 

So for example if my current worksheet .mw file is saved at "c:\temp\temp\work.mw" I can get the directory part as "c:\temp\temp\".

 

I am getting the error that maple was unable to allocate enough memmory for the computation. I have seen that some of the values could have been stored in a remember table so that they are accessed whenever needed. I am however using arrays and maple cannot tell when the entries in an array change, how about option cache? can that be useful? if not, how can I optimize my storage space?

Is it possible to stop simplifying the expressions automatically in Maple in the following case:

> 2*x-5>3*x-6;

Thank you.

in internet or maple, is there a neural network package in maple?

i find example link after googled, however, still feeling not easy to apply to data.

is there the most simplest version for two columns of data ?

which algorithm can be used to mining data set in maple after feature extraction

hope systematic and automatic doing this instead of using eyes

 

i feel derived attributes are unlimited, how to know sufficient?

Hi,

 

Can Maple solve mathematical models? And can I use it to solve LP and NLPs?

in real practice, 

what is application of the cycles in algcurves[homology] ?

is there any book teaching about the use of this function in maple?

I want to define a function f in Maple such that $f(x[1,2]^{-1/3})=\{1,2\}, f(x[1,2])=\{1,2\}, f(x[1])=\{1\}, f(x[1]^{1/3}) =\{1\}$, f(x)=empty set. How could I do this in Maple? Thank you very much.

Running the code costs a lot of time, I need some suggestions to make faster and more accurate. Thanks!

sonkok.mw

how to convert (a+b)^3 to a list [a+b, a+b, a+b]?

for example

(a+b)^2 to [a+b, a+b]

I would like work in Riemann Normal Coordinates, and derive expansion in number of derivatives of the metric.

For example, starting with the expansion of the metric in Riemann Normal Coordinates (assuming this needs not be derived)

\displaystyle  \begin{array}{rcl}  g_{ij}(x)&=& \delta_{ij} -\frac 1 3 R_{iklj}x^kx^l -\frac 1 6 R_{iklj;m} x^kx^lx^m\\ &&+ (\frac2{45} R_{ilmk}R_{jpqk}- \frac 1 {20} R_{ilmj;pq})x^lx^m x^p x^q\\ &&+(-\frac 1{90} R_{iklj;mpq}+\frac 2{45} R_{iklr;m}R_{jpqr})x^kx^lx^mx^px^q\\ && +(-\frac 1 {504}R_{iklj;mpqr}+ \frac{17}{1260}R_{ikls;pq}R_{jmps}+ \frac{11}{1008}R_{ikls;q}R_{jmps;r}\\ && +\frac 1{315}R_{ilms}R_{jqrt}R_{kspt})x^kx^lx^mx^px^qx^r +O(|x|^7). \end{array}

I would like to express the lapliacian, or square-root of the determinant ... etc., in terms of this metric and derive an expansion for them.

However, I cannot even define the metric as such in Maple-Physics, because the coefficients of xk depend themselfs upon the metric to be defined.

Is there a way to do such calculations in Maple ?

how to count how many terms or items are equal when compare two lists of polynomial terms when length of two list may not be equal

cannot find the error in loop

 

 

> restart; u[0] := (4/3)*c^2*cos((1/4)*x)^2; alpha := 2;
 
> iteration := 3;
> for k from 0 while k <= Iteration do u[s] := eval(u[k], t = xi); u[k+1] := simplify(u[k]-(int(diff(u[s], [`$`(xi, alpha)])+diff(u[s]*u[s], x)+diff(u[s]*u[s], x, x, x), xi = 0 .. t))) end do;

First 963 964 965 966 967 968 969 Last Page 965 of 2308