with(plots);
f := x -> x^3 + 3^x;
complexplot3d(f, -15 - 22*I .. 15 + 22*I);

This gives good color graph however I would like to see it like the way this cat graphed it.

https://www.quora.com/How-do-I-solve-for-x-in-x-3-3-x-17

Ive got a question about the Dutch book again. They sure did their part on finding questions with answers you cannot find in the book (maybe in later chapters or the 2nd book "part 2"). Maybe to make sure you go to the teacher, so he sees you, and he is sure you did your part, and to get some interaction between the student and the teacher.

I guess you guys/girls are the teacher... Hahah :)

It is the 3rd question. It says: "given is the funtion y=f(x) ( see the photo for the function, "voor" means "for")

a. Draw the graph of y=f(x)
b. Draw with the help of the graph of y=f(x), a graph y=f(-x),y=-2f(x),y=f(x-1), and y=(2x)"

This paragraph is about shifting graphs of functions, and how to alter them. I know how it works, ive done that quite some time ago, but now in maple it is a new challange. Is there a way to get the funtion f(x) to adhere to the rules imposed on it by the text in the book? If that can be done, the answering of the questions will be a lot easier!

Thank you!

Greetings,

the function 

Hallo, I would like to ask anyone have encountered this problem. I tried to update a matrix value using recurrence do but end up with "Error, recursive assignment". Here is the code. Any help is appreciated.

 

with(LinearAlgebra);
with(plots);
Nx := 200;
Nt := 200;
dx := 0.5e-2; dt := 0.2e-1;
A := Matrix(Nx, Nx);

for k to Nx do A[k, k] := -2.0 end do;
for j to Nx-1 do A[j+1, j] := 1.0 end do;
for j to Nx-1 do A[j, j+1] := 1.0 end do; A;
zeta := (.1*dt/dx)^2;
phi || 0 := Matrix(Nx, Nx);

fin := proc (t) options operator, arrow; cos(4*Pi*t) end proc;
phi || 0[(1/2)*Nx, (1/2)*Nx] := fin(0);
phi || 1 := (1/2)*zeta^2 . A . phi || 0; phi || 1[(1/2)*Nx, (1/2)*Nx] := fin(dt);

phinow := Matrix(Nx, Nx); phinext := Matrix(Nx, Nx); phibefore := Matrix(Nx, Nx);

phinow := phi || 1; phibefore := phi || 0;

for j from 2 to Nt do phinext := Zeta^2 . (A . phinow+phinow . A)+2.*phinow-phibefore; phi || j := Matrix(Nx, Nx); phinext[(1/2)*Nx, (1/2)*Nx] := fin(j*dt); phi || j := phinext; phibefore := phi || (j-1); phinow := phi || j end do;
Error, recursive assignment

for j to (1/5)*Nt do p || j := matrixplot(phi || j, heights = histogram, gap = 0.5e-2, labels = ["", "", ""]) end do;

plots[display](p || (1 .. 20), insequence = true);

Hi,

I solve numerically an ODE system which depends on 25 parameters.
I want to know the maximum value of the time at which a specific event is triggered, when these parameters vary (independently the one of the other) within a 25 dimensional hyperbox.

To solve this maximization problem, which I assume is local¹, I would like to use NLPSolve

The attached zip (I use Mac OSX) contains:

• a file that gives a full description of the problem (the original ".pages" file and its export as pdf),
• an m file wich contains the solution procedure plus a few other variables needed to solve the problem,
• the mw file which contains:
  • the reading of the m file,
  • the procedure (OBJ) which returns the trigerring time,
  • many attemps to find its maximum value using NLPSolve.

None of my attempts at using NLPSolve gave me the expected answer

Could you help me to fix this?

Thanks in advance

mw_and_m_files.zip

1: Initializing a local method (see the explanation file) with different points gave me different optimizers but all of them led to rather close values of the objective function. Thus the problem is either global instead of local, or convergence might not be achieved for all the initialization points (but keep in mind that I'm not interested in the location of the minimizer(s) but in the maximum value of if the time when the event is triggered).

Hi Every one. I was trying to solve three point boundary value problem but cound't get the solution. any help? 
u1 need to plot  -1..0 and u2 from 0..1 and shown in a single doamin -1..1


 

Hi!

I am so pleased to be here to look for help in using Maple.

I am trying to find solutions to a set of nonlinear systems of equations using fsolve.

This code I am tried to solve is shown as follow:

 nonlinearsystemforallsolution.mw

I can get one solution for three variables, however, it's clear there are some solutions missed.

My questions are listed as:

1) How do I get all solutions for a fixed variable of sigma?

2) How do I create a  loop to obtain the solutions for various values of sigma?

3) How to plot solution of each variables versus sigma? 

3) How do I determine the stability of each solution?

Many thanks in advance.

sincerely

I have some more questions, now i get some more odd situations where an obvious answer cannot be given by solve. And a funtion cannot be plotted somehow. 

Here is the file. I tried to understand why, but it is not happening. They did it on purpose (i guess) to get simple questions, and show you that Maple sometimes does not have the answer right away. So you run into the "limitations" of the program right away so you are aware what could go wrong.

Download Applied_Math_Part_1_questions_part_two.mw

The function

Hi!

The so called Haar system is given as the follwoing sequence of functions:

Someboy know how to code the above functions? For a given n, I think that the rpoblem is to find the numbre k in the above definition.

Many thanks in advance for you comments.

How to attach an m-file to a question?
Does it exist a rspecific repository where I can put an m-file? 

Suppose we have a function that we want to plot in different styles and to finally put all these different plots in one single plot.

When we use the plot command, it is easy to gather several plots in one single plot but when it commes to another special kind of plots (namely, DiscretePlot from DynamicSystems), there I am stuck.

Would you like help me to solve this problem? Thank you.

Here attached the corresponding worksheet.

altogether.mw

When I was drawing a plane graph, I found that the labels  of vertices were not displayed  and some edges even overlap when drawing because they were too close due to embedding.

So I thought that  option  Interactive  can adjust the position manually, but  at the same time I found that the style of  edges, such as the color and thickness, etc., is lost.  How to handle it? Is this a bug?

Hello, ive got some trouble calculating this problem. Ive been looking at it for quite some time. I suspect you first need to differentiate to get the minimum value and then make it back to p. Time is ticking away, and i can just cant get it right. Its 2 questions out of some Dutch mathbook from 2007. It has a lot of Maple in it too. Just so to get a broad a view on maple as possible. I must say these maplebooks have quite the repertoirs. The other book "Advanced Problem Solving Using Maple" book turns you into some British chap. And this book:"toegepaste Wiskunde voor het hoger beroepsonderwijs deel 1"(translated applied math for higher job education part 1), turns you into the odd obnoxious Dutch mathematician... Well what can i say??

Here are the questions: 

1st Question:
For which values of p does the graph of the function: y=f(x)=(p*x^2)+3*p*x+1 have one intersection with the x-axis? When does it have two intersections with the x-axis? When does it have no intersections with the x-axis. 

2nd Question:
Given functions are: y=f(x)=(x^2)-6x+p+3, and y=g(x)=(4x^2)-(p-8)x+7. When do these functions have the same minimum value. Calculate p and the minimum value.

Greetings,

Download Applied_Math_Part_1_questions.mw

the function

I am looking for an output without denominator. I.e.:  2^(-1/3) instead of 2^(2/3)/2

Thank you

Given some intert expression like 4%*5 %+ 3 is there a way to progressively convert it to a non-inert expression(and evaluated expression)?

I'd like to see the stages without having to hard code it all. Value simply converts the expression all the way down. I'd like to see intermediate stages. Ideally it should followthe order of operations and hault when it reaches a fixed point(when the output equals the input).

e.g., value(exp, 3) will value the expression 3 times carrying out one one reduction of inert operations.

Hello

I have seen some examples of linear programming or integer programming in Maple. But, I am wondering how to solve a mixed-integer program when just some of the decision variables are integer and the rest are continuous? I would be thankful if you can share an example. 

Thanks