Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

Hi everyone,

I've been having a problem with this question:

"The system of cities and roads in Connected Graphs on page 246 splits naturally into two components: the Canadian cities and roads between them, and the European cities and roads between them. In each component you can travel between any two cities, but you cannot travel between the two components. Write a procedure that, given a table of neighbors, splits the system into such components. Hint : Think about the form in which the procedure returns its result."

I have to separate a table into two tables based on the connectivity of the cities, that is, I want a table just for the cities from Canada and another one for the cities from Europe. Can anyone help me with this? I really have no idea how to tell Maple what I want it to do.

Anyway, here's the link with the soon-to-be program:

6.9.mw

Hello,
I need help on plotting in for loop.

> N := 10; h := 1/N;
> for i from 0 to 10 do x[i] := i*h; p1 := evalf(cos(x[i])) end do;
> f1 := [seq([x[i], p1], i = 1 .. N)];
> plot([cos(x), f1], x = 0 .. 1, y = 0 .. 1);



The above code gives me  cos x plot and line plot, but I want plot of points and cos x.



Hello fellow members. I recently got a new laptop, and installed Maple of course. Everything went smoothly until I attempted to approximate an answer.

I got the error message:

"[5] Error, invalid input: expected evalf[] index to be of type posint but received %ARG1"

Approximation works perfectly on my other computer and old laptop.

Any help?

I need to apply the midpoint method to an initial value problem. Heres my code:

>mp := proc (f, a, b, N)
local x, k1, k2, y, i, h;
y := array(0 .. N); k1 := array(0 .. N); k2 := array(0 .. N); x := array(0 .. N);
h := evalf(b-a)/N;
x[0] := 0; y[0] := .85;

k1[0] := h*f(0, .85);

k2[0] := h*f(0, .85+.5*k1[0]);

from i = 1 to N do

x[i] := x[i-1]+h;

k1[i] := h*f(0, y[i]);

k2[i] := h*f(0, y[i]+.5*k1[i]);
y[i] := y[i-1]+k2[i-1];
print(x[i], y[i]) end do
end proc

>f := (x,y)-> 1.3/(1+y^2);

>mp(f,0,1,10);

But i get an error message saying "Error, (in mp) initial value in for loop must be numeric or character"

Hello everybody!

My name is Mathew and I am a new member of this forum, and this is my first post, so please be lenient towards me:) I wanted to ask for help since my adventure with Maple 18 was supposed to start yesterday, unfortunately I encountered a problem I couldn't solve myself so far- my Maple 18 does not integrate. At all. It has no problem with differentiating, adding, subtracting and such, unfortunately any type of integral is unsolvable by Maple. I tried typing the easiest functions, such as e2xdx under the integral, unfortunately it is met with following message:

Error, (in int) wrong number (or type) of arguments: invalid option value passed to indefinite integration: {}.

I understood from several tutorials on the internet that this program should not have any problems with dealing with such form of formulas. What could be wrong? How to make  it work as it is supposed to?

Please help me. As I mentioned in the beginning, I am a new member, so in case I did something wrong or placed this post in wrong category- please forgive me;)

The algorithm that I need to replicate is as follows:

real function f(x,y)

integer n; real a,b,c,x,y

f<-max(|x|,|y|)

a<-min(|x|,|y|)

for n=1 to 3 do

b<-(a/f)^2

c<-b/(4+b)

f<-f+2*c*f

a<-ca

end for

end function f

How can I define f,a as  functions that I am later using as variables(in f=f+2cf,b=(a/f)^2)? also, is n just a variable for iteration? 

 

I've got a function f(x_n) = (x_n-1)^3

and need to show that for the iterative method

x_(n+1)= x_n - f(x_n)/(sqrt(f'(x_n)^2-f(x_n)*f''(x_n), at a simple root we have cubic convergence while at a multiple root, it converges linearly.

I understand that the approach is to write either a recursive function or a sequence, but i'm confused about the structure since both x and n are being incremented

 

I need to show what happens to the zero r=20 of f(x)= (x-1)(x-2)..(x-20)-(1/10^8)*(x^19) and the hint given is that the secant method in double precision gives an approximate in [20,21].

At present, I'm calling the secant method on f with a tolerance of 1/(10^12) with an initial x=20, but I'm stuck as to what the second initial value would be. What is the right approach to this question?

 

I've plotted the graph for this max function. Is there any way I can find the points of discontinuity in general and then use that to compute the derivatives at points where it exists?

I'm trying to get the RHL of exp1:=(2/(1+e^(-1/x)) as x->0+

and have l2:=limit(exp1,x=0,right) but that isn't giving me a value. How do I correct this? 

 

I have several plots and I'm using the display procedure,

display(seq(p1[i], i = 1..3), pts1, pts2);

to draw them. I want them to be displayed in the specified order, i.e., pts1 and pts2 should be in the foreground. Unfortunately, the display procedure ignores the order. How to enforce the specified order?

I am facing a kind of strange problem. Whenever I enter Int(exp(-s t) t^2,t) and try to see full solution using Student[Calculus1]:-ShowSolution(), it gives empty square brackets [ ] as superscripts of e. If I restart Maple engine and perform the same, sometimes it produces right solution. Kindly help, what is this? Same integral does not give problem if done with parameter 'r' instead of 's'.

At the internet site of The Heun Project, a strong declaration is made that only Maple incorporates Heun functions, which arise in the solution of differential equations that are extremely important in physics, such as the solution of Schroedinger's equation for the hydrogen atom.  Indeed solutions appear in Heun functions, which are highly obscure and complicated to use because of their five or six arguments, but when one tries to convert them to another function, nothing seems to work.  For instance, if one inquires of FunctionAdvisor(display, HeunG), the resulting list contains

"The location of the "branch cuts" for HeunG are [sic, is] unknown ..." followed by several other "unknown" and an "unable". Such a solution of a differential equation is hollow.

Incidentally, Maple's treatment of integral equations is very weak -- only linear equations with simple solutions, although procedures by David Stoutemyer from 40 years ago are available to enhance this capability.

When can we expect these aspects of Maple to work properly, for applications in physics?

hi, is there a way to collect all commands in one place which have been used during a clickable math session of a document? in fact this would help in creating automated tasks.

I paste below a simple code illustrating what I want to create: two lists from a set with pairs. I wonder it is a very simple task but I my lists aren't create in the end. 

 

 

> restart;
>
> lista:=[[1,10],[2,20],[3,30]]:
> x:=[]:
> y:=[]:
>
> for i from 1 to nops(lista) do
>     for j from 1 to 2 do
>
>         if j = 1 then
>             x[i,j]:=op(1,op(i,lista));
>        fi;
>        if j = 2 then
>             y[i,j]:=op(2,op(i,lista));
>       fi;
>    od;
> od;
>
> x;
> y;

 

 

In resume then after the for loop is terminated I want to be left with two lists:

x:= [1,2,3] and y:=[10,20,30]. I'm sure it has a quick fix but I'm stuck and would appreciate any help/advice.  

Thanks in advance!

First 1300 1301 1302 1303 1304 1305 1306 Last Page 1302 of 2250