Calcution-A

with(VectorCalculus):
with(LinearAlgebra):
f := [x3*(1+x2),x1,x2*(1+x1)]:
g := [0,1+x2,-x3]:
fv := <x3*(1+x2),x1,x2*(1+x1)>:
gv := <0,1+x2,-x3>:
ad_f_g :=  MatrixAdd(MatrixVectorMultiply(Jacobian(g,[x1,x2,x3]),fv),-MatrixVectorMultiply(Jacobian(f,[x1,x2,x3]),gv)):
b := <Diff(w(x1,x2,x3),x1),Diff(w(x1,x2,x3),x2),Diff(w(x1,x2,x3),x3)>:
gv := <0,1+x2,-x3>:
c1 := DotProduct(b, gv):
c2 := DotProduct(b, ad_f_g):

Is there anyway to disable the superscript so it works exactly like in Classic Maple, so the whole equation stays inline? Having it go to where it should be makes marginally easier for me to read it, but having to press the right arrow to leave the superscript is extremely annoying and time consuming.

Edit: example: I want it to stay as 10^5 instead of 10⁵, at least while I'm writing.

Hello,

I'm new to Maple and am using it to solve linear and non-linear differential equations.

I can solve and plot linear DEs using a couple of methods. Im trying to solve a non-linear DE and i could find the series solution using dsolve. But given certain initial conditions, is there any way to plot or see the nature of the behaviour of the DE? I just want to see how the DE will look like maybe for certain points up to a certain level of accuracy. Is there any way to do that?

I need this quite often, but never found a nice way of getting the index of minimal or maximal value of a Vector (or a list or whatever). Is there an easier way than the following?

N := 15:
L := LinearAlgebra[RandomVector](N):
m := min(L):
for i to N do if L[i] = m then print(i); break end if end do;

I have a data set that represents some parameters at different locations in a (linear) system. The way the data are organized is as 1-d vectors which in turn are combined into an Array. I.e. Array[1] is the first vector; Array[2] the second and so on. Each vector represents a data subset, all subsets are against a common independent variable, call it Knob. I plot one of these subsets like this:

plot(knob,vector[1],style=point);

That works fine & I can replace...

Given Maple expressions f(g,x) and g(x) how would you replace g in f  to show a function in x.

Starting from Maple 15, the useful ?plottools/getdata command is added. It tansforms a Maple plot to a Matrix. Unfortunately, the getdata command deals only with Maple plots. The question arises: "How to get a data from bmp, jpg, tiff, pcx, gif, png and wmf formats?" This is used in medicine and engineering. Such question was asked here

c:=12+10x^4+7x^3-89x^2+65x+4sinx

how do i plot a graph of c,

calculate the roots and check the correctness of all found roots.

Thanks for your kind solutions in advance.

i have this unfinished procedure to multiply two matrices 

multmatrix:= proc(A:matrix)

local m,n,i,j,r,c,t,a;

m:=linalg[rowdim](A);

n:= linalg[coldim](A);

i:=linalg[rowdim](B);

j:=linalg[coldim](B);

K:=array(1..m,1..n);

H:=array(1..i,1..j);

Hi, these are what I have, I'm trying tot get a set of answers.

elenum:=16:

nodes:=elenum*2+1:

L:=evalf((Pi*2)/(elenum*2)):

interface(rtablesize=infinity):

E0:=Matrix([[L/3,2*L/3,L/3)],[(2*L/3,11*L/15,2*L/3)],[(L/11,2*L/3,L/110]]):

for i from 1 to elenum do
node:=(2*(i-1))+1;
E0M[node..node+2,node..node+2]:=E0M[node..node+2,node..node+2]+E0
end do:

E0M:

What should I do if i want a different outcome of...

2012.zip

Ukraine. External independent evaluation (ZNO) in 2012. Trial in Maple 16. 

html 3-interactive in Ukrainian: zno.zip

Hi all,

I try to solve the following nonlinear programming problem:

but this error message appear:

Hi all,

I have an array [1..2503] y-axis for different values,  x-axis [0..180], 

when I plot these two arrays its not possible.   but if I change x-axis [1..2503] then plot is ok... I want to plot x-axis [0..180] and y-axis [1..2503]

Regards

A.Q   Soton

How to solve the equation 2017*x^2013+2015*y^2013-2033*z^2013-2011 = 0 over the integers with Maple?
I tried it with the Direct Search v.2 package:
>with(DirectSearch):
>SolveEquations([2017*x^2013+2015*y^2013-2033*z^2013-2011 = 0], {z > -100000, x >= -100000, y >=-10000, x<= 10000, y <= 10000, z <= 10000, assume=integer, AllSolutions);

Okay so my proff wrote the following procedures to sort a list and they obviosuly work. Now I want to write a procedure that can merge two sorted lists (using SelectSort). I am trying to write merge as a procedure but to no avail. Can anyone help me out?

getListSize := proc (L)

local vv; vv := Vector(L);

return LinearAlgebra[Dimension](vv)

end proc

swap := proc (L, i, j)

local temp, vv;

vv := Vector(L);