solve matrix equation Ax+xB=C ? where X_(n\times n), and  A,B,C \ in M_n(R) we are given. write maple procedure and check by a 3* 3 case.

Hint( USE MATRIX  CRAMER RULE), OR GAUSS-ELIMINATION.

Hi there,

I'm quite new to Maple so please forgive me! I have a system of partial differential equations I'm trying to solve in Maple as such below 

df/dt = f(1-f) - f * h

dg/dt = g(1-g) * Gradient(1-f * gradient(g))

dh/dt = (g - h) + Laplacian(h),

where f,g,h are functions of space and time (i.e. f(x,y,z,t)). I guess my first question is - is this possible in Maple to evaluate? (I'm currently unsure on ICs as I'm figuring it out from the model - it's a model for cancer growth I'm trying to evaluate but have a rough idea of what I'd use).

If it is possible, can you please share how I'd write this? Everytime I've tried I seem to be failing to define anything properly, so your expertise would be greatly appreciated!

Hi,

I have a problem in which i have to integrate Bessels function of first kind of order 1 from 0 to infinity. The answer that i m getting is -1, but when i am solving it numerically then the answer is close to 1. I dont know why it is happening. Please help me out for it.

Regards

Sunit

The value of Pi can be approximated by the infinite series 4-(4/3)+(4/5)-(4/7)+(4/9)-(4/11)+... . Write a procedure that takes as an input the integer n and uses a for-loop to return the decimal point approximation of using the n^th partial sum of the infinite series. Determine the minimum value of n that gives the true value of to 5 decimal places.  

the 99 bottles of beer on the wall for loop is alot easier than this one. can some one walk me through it? i only have a general idea how to implement it.

What is a bit surpiring,  although the manual doesn't mention it,  the following code produces

the same plots in the 2. and 3. case.  And what about the use of FAIL in similar situations? 

for is_continouos in [true, false, FAIL] do
dc := not is_continouos;
plot(1/x, x=-1..1, discont= dc, thickness=2, color = blue, legend = '1/x')
end do;

im having issues with a problem on my homework. we are supposed to find all primes between 1000 through 1015. using the for loop, for in loop and while loop. 

the while loop seemed the easiest.

i:=1000;
1000
while i<=1015 do
i, "Is it a prime?", isprime(i);
i:=i+1;
end;

the for loop and the for in loop have gotten me abit comfused ive tried several times with each and nothing.

and  x have range=(0 to 2),the y have range = (2,3),follow when the x=(3 to 4),so the y=(3 to -3) how to implement the title's function 

still the x and y have variability value and variability number

such as the list [[0,2],[3,-2],[7,6],.....,[x,y]]

and change to piecewise 

http://www.mathsisfun.com/puzzles/gardens-solution.html
I need help filling in the Con gaps. rgds

GardensLogicProb.mw

i assign 

seta := [x+1, x^2]

setb := [x^3, 2*x+5]

does morphism mean that

i use card_prod

to get

(x+1, x^3)

(x+1, 2*x+5)

(x^2, x^3)

(x^2, 2*x+5)

such that i composite each of 4 sets still satisfy F(f o g) = f o g

example

subs(x=x^3, x+1)

(A o C) o Colimit = (B o C) o Colimit

if known A, B, C and framework of Colimit

can it be said colimit?

Bonus, what are A,B,C? <- this can be not answered

Hi,

I want (Maple) to do a series of time consuming computations while I sleep so I create a Vector V of length 50 say and make each computation an entry in V.

An occasional entry will turn out to be an error-that is, I get an error message and the calculations stop. Not a serious problem if the first 47 entries have been calculated but if the thrd calcuation fails I have little to show for a night's work.

What I want if for Maple to skip any computaion that fails (produce the appropriate  error message if possible) and then continue with the other computations.  Any suggestions?

Here is an unrelated question. If I have an Array T say
>T:=Array(3..5,7..17,(i,j)->i^2*j):

then T[4,10] returns the appropriate entry. T(2,4) returns the same thing. What type of object is T(-,-)?

Hello, 

So I have two simultaneous equations, 

T= n1/(1+|T-S|) and S=n2/(n3+|T-S|) 

Where n1, n2 and n3 are constant parameters (from here on I fix n1=1 and n3=0.3). So I want to plot T, S against n2 for different values of n2. 

If I also fix n2 (say, n2=1.5) I  can get values for T and S no problem. 

But I've no idea (after many hours of searching) how to progresss. I know I need the program to put various values of n2 into the two equations and then plot the solutions numerically but I'm unsure what to try next.

Could anyone please shed some light on this?!

Thanks!

I'm trying to numerically calculate the following:

int(e^(-1.5*t)/sqrt(t*(t+1)), t = 1 .. infinity)

But Maple can't do it.

I then made it a lot simpler and tried to calculate the following:

evalf(int ((e^(-t)), t=1..infinity));

Thats just e^(-t), integrated from t=1 to t=infinity.

Maple just gives me back the original equation in the first case, and in the second gives me a limit that I can see has a numerical answer, but Maple can't. Is this something Maple should be able to do and I'm just now pushing the right buttons? I'm using Maple 12, which I know is old and limited, but these really aren't very complicated numerical integrations.

solve matrix equation Ax+Bx=C,x is n*n matrix ,forA,B,C is n*n matrix . write maple procedure and check a 2*2 case.