Maple 14 Questions and Posts Maple 14 Questions and Posts Feed

These are Posts and Questions associated with the product, Maple 14

Hi,


Is it possible to solve linear matrix inequality in Maple?
For example, using Matlab and yalmip we can easily
solve Lyapunov equation
  
    A'P + P * A <0, P> 0

Is it possible to solve this equation in the Maple?


Regards,

 

paths in graph ...

July 11 2014 alpha041 30
Hi i have two questions about paths in graph package: 1. suppose we have: path1=[1,3,5,7,9] path2=[1,2,3,6,7,8,9] if we want to create a graph that it's edges are edges of path1 and edges of path2,how can we do this? edge set of our graph should be {[1,3],[3,5],[5,7],[7,9],[1,2],[2,3],[3,6],[6,7],[7,8],[8,9]} 2. suppose p is an arbitrary path on a given weighted graph G how can i calculate weight of p (that is sum of it's edges weights) in maple ? thanks very much for your help

Hi,

RTABLE(151446624,MATRIX([[tf[1,1] = 24110714285.0000/(1000000000000*s+1071534859*218^(1/2))], [tf[2,1] = .843883770817266e20*218^(1/2)/(2500000000000000000000000*s^2+4870187206000000000000*218^(1/2)*s+487482532797170793867)], [tf[1,2] = .841458646091250e19*218^(1/2)/(125000000000000000000000*s^2+350952468875000000000*218^(1/2)*s+50692506828944068713)], [tf[2,2] = 87390625000.0000/(5000000000000*s+3705223967*218^(1/2))]]),Vector[column])

 

How can I read the individual elements tf[1,1], tf[2,1], tf[2,1], tf[2,2] form this RTABLE?

Regards,

i have 2 questions:

Question 1. suppose we have generated a random weighted graph with 100 vertices and 2300 edges and found shortest path frome node 1 to node 100 using function ShortestPath(G,1,100). this function returns a path like [1 3 8 2 9 100] but don't get us value of shortest path!

in other words if weights are costs of travelling on edges,we want to find minimum cost of travelling from node 1 to node 100.

how can i find value of shortest path (minimum weight/cost) ?

Question 2. i want to create a sub graph of G by removing the edge that has maximum weight on shortest path found in Question 1. how can i find such edge and how to create such sub graph?

thanks

I want to create a NxN circulant matrix of a system with fixed boundaries. This is an idea of what I'm trying to do (but it doesn't work):

> N := 8;

> A := Matrix(N, shape = Circulant[[2, VectorCalculus[`-`](1), ZeroVector[row](VectorCalculus[`+`](N, VectorCalculus[`-`](3))), VectorCalculus[`-`](1)]]);

>A[1,N]:=0;

>A[N,1]:=0;

In other words, I want to make a circulant matrix of the elements 2, -1, 0, 0, ..., -1 (with N-3 zeros). Then I want to set the top right and bottom left elements to zero (that's the fixed boundary portion). The first command almost works for N=4 -- except with extra square brackets in the matrix -- but doesn't work for N=8 or 16 (N is always a power of 2). The second and third commands seem to be bad syntax (I haven't really tried to figure them out yet).

hi dears. i cant solve this question by Analytical method such variational itteration method (VIM) or homotopy perturbation method (HPM), homotopy analysis method(HAM)

hi, :

  1)  diff(f(eta),eta$3)+(1)/(2)*f(eta)*diff(f(eta),eta$2- K* (diff(f(eta),eta)-1)=0

 

 

boundary conditions: 1)  f(0) = 0   2)  D(f)(0) = 0   3)  D(f)(infinity=10) = 1

                             

    K=0.2

write down the mapple procedure that finds the shape operator plus
gauss and primative curvatores and determines the surface characteristic
of a parametically given surface

 

best regards, ty

Need an answer ASAP...

March 25 2014 mapmap 0

hi, i need the anwswer of the question below, thanks

 

write a mapple procedure that finds substantive and gauss curtavores and surface and the shape operator, determines the characteristics of a parametrically given surface

I am running a set of diffrential equation , but i receive below error

"Error, (in LL) cannot evaluate the solution past the initial point, problem may be complex, initially singular or improperly set up"

I can't understand the problem

hi, I am new here I want to solve these toe coupled equations with the following boundary condition numerically:

  1)  diff(f(eta),eta$3)+(1)/(2)*f(eta)*diff(f(eta),eta$2)-Pe*(2*f(eta)*(diff(f(eta),eta))*

(diff(f(eta),eta,eta))+f(eta)^2*(diff(f(eta),eta,eta,eta))+eta*(diff(f(eta),eta))^2*(diff(f(eta),eta$2)))-K*

(diff(f(eta),eta)-1)=0

2)   diff(theta(eta),eta,eta)+(1)/(2)*Pr*f(eta)*(diff(theta(eta),eta))=0

boundary conditions: 1)  f(0) = 0   2)  D(f)(0) = 0   3)  D(f)(infinity=8) = 1

                               1) theta(infinity=8) = 1      2) theta(0)=0

Pe=0.1..1    K=0.2,0.5  Pr=0.7

hi, I am new here I want to solve these toe coupled equations with the following boundary condition numerically:

  1)  diff(f(eta),eta$3)+(1)/(2)*f(eta)*diff(f(eta),eta$2)-Pi*(2*f(eta)*(diff(f(eta),eta))*

(diff(f(eta),eta,eta))+f(eta)^2*(diff(f(eta),eta,eta,eta))+eta*(diff(f(eta),eta))^2*(diff(f(eta),eta$2)))-K*

(diff(f(eta),eta)-1)=0

2)   diff(theta(eta),eta,eta)+(1)/(2)*Pr*f(eta)*(diff(theta(eta),eta))=0

boundary conditions: 1)  f(0) = 0   2)  D(f)(0) = 0   3)  D(f)(infinity=10) = 1

                               1) theta(infinity=10) = 1      2) theta(0)=0

Pi=0.1    K=0.2

Trace  on computing the distinct-degree decomposition of the squarefree polynomial
f=x^17+2x^15+4x^13+x^12+2x^11+2x^10+3x^9+4x^4+3x^3+2x^2+4x belong to F_5[x].tell from the output only how many irreducible factors of degree i the polynomial f has, for all i.

 

I am new to Maple and I have difficulties simplifying expressions like the following: (exp(a+b)+exp(a+c))*exp(-a).

I would expect to see exp(b)+exp(c) but nothing happens when I use the simplify() function.

I googled but didn't find a solution.

hey i am new here and i have a question,

i have an partial differential equation diff(u(t,x),t$2)=diff(u(t,x),x$2) with the intial value problem u(0,x)=f(x)=1/(1+x^2) and diff(u(0,x),t)=0

and now my question i have already programm it:


> with(inttrans);

with(DEtools);

with(plots);


> with(PDETools);

> k := diff(u(t, x), `$`(t, 2)) = diff(u(t, x), `$`(x, 2));
bc := u(0, x) = 1/(1+x^2);
v := diff(u(0, x), t) = 0;
d / d \ d / d \
--- |--- u(t, x)| = --- |--- u(t, x)|
dt \ dt / dx \ dx /
1
u(0, x) = ------
2
1 + x
0 = 0

> pdsolve(k, u(t, x));
print(`output redirected...`);
u(t, x) = _F1(x + t) + _F2(x - t)

> c := pdsolve({bc, k, v}, u(t, x));
print(`output redirected...`); # input placeholder

 and now question at the last there is nothing does it means that maple can´t solve it with the intial value problem and how can solve it with Fourier-Transformation to x???

can anyone help me please and sorry my englisch is not so good ;)

1 2 3 4 5 6 7 Last Page 1 of 34