Below I successfully employed the is command to compare Q1 & Q2.  However, attempting to compare T1 & T2 which is essentially Q1 & Q2 but defined as a functions dependent on m does not work so well.  Can I do this comparison?  If so what is the proper syntax to do this?

Download is_command.mw

In MAPLE 12 there is an option in the dropdown menu for the conversions command to convert a complex exponential expression into the cartesian form of a + bi.  However, when I review the HELP menu for the convert command I do not see this option.  Below is an example.  How do I execute the conversion via command line option as opposed to the GUI option?

convert_complex_exponential.mw

Hi,

I am writing a simple program on Maple with the command :

som:=0;

for a from 3000 to 5000 by 100 do

for b from 100 to 1000 by 100 do

for c from 3000 to 3000 by 100 do

for d from 1000 to 1000 by 100 do

for e from 1000 to 10000 by 1000 do

for f from 200 to 2000 by 100 do

for p from 1 to 10 by 1 do

tot:=0;

C2:=c*d-N^2*(f^2-b*d);

C3:=a*d-e*f;

C4:=c*e-N^2*(a*f-e*b);

if (C2>0 and C3>0 and C4>0)

then

print(a,b,c,d,e,f,p);

som:=som+1;

fi;

od;od;od;od;od;od;od;

som;

That gives me the error messsage: Error, numeric exception: division by zero

Is there a simple way to say to the program to continue to execute even it falls at some point to « bad » parameter constellations with division by zero ?

Thank you for your help !

Best regards,

Basak

Dear All,

I am having problem in plotting two function(which themselves are functions of elliptical integrals of first and third kind) together.

If I plot them separately, it has no issues but while combining it plots just one.

I am attaching the maple worksheet here, I have to plot alpha and beta together with 'z' as independent variable.

Please reply asap.
 

Download deflection-angle-comd.mw

Below is a link to my worksheet that evaluates 6 expressions that are presumably equivalent.  However, there seems to be a region for 7<n<100 where the results diverge.  All other values of n yield identical results.  I am at a TOTAL loss as to what is happening.  I hope that someone here might shed some light on this quirk.

divergent_behavior.mw

CodeTools:-Usage lists information on CPU time & memory used in later versions of MAPLE.  I do not see Usage as an option for MAPLE 12.  Is there a comparable command & can you provide an example so that I have the proper syntax?

Am I applying improper syntax for the is command?  Out of the 5 attempts to equate X with the time derivative of S11 only the combine command yields the expected result.  If only combine works then why do the others not work?
 

Download syntax_for_is.mw

Below is an attempt to evaluate an integral from t to ZERO.  I believe the issue is that sin(x) in the denominator is causing a problem.  However, in actuality sin(nx) is in the numerator so at the lower integral bound approaching ZERO the factor of n remains.  So how can I get MAPLE to evaluate this correctly?
 

Download evaluating_integral.mw

In the link below I attempt to solve 2 trig series which are essentially equivalent as indicated by the numerical output of eq (5).  The series  represented by S13 & S14 has arguments of the trig functions that realizes that only the odd terms for k yield non-zero results.  The case represented S11 & S12 by makes no such presumption; nonetheless, all cases agree within reason numerically.  Now to find min/max values taking the derivative is needed which is simply done by removing the integral as indicated by Q1 through Q6.

Now resolving the roots works OK for Q6 because beta = 2*pi *t/T conveniently collapsed the numerator into factorable expressions.  Resolving the roots for Q3 did not work so well because what I think is that the expression in red has multiple roots so it only spits out t as the solution?  I expressed the angle alpha in terms of beta & probably need to resolve kappa to somehow get the expression in red to collapse into a factored expression, but I am not sure how to execute this.  When I solve for kappa I get ZERO.

Does anyone have suggestions?  Remember I demonstrated that both series are practically idendical numerically; hence, there derivatives should be as well as long as both series are well behaved functions.  So the solutions must be the same as well.

trig_series_solns.mw

See below, why the difference + what is the distinction between the 2?  Notice that they yield different results with the is command.

Download sum_versus_Sum.mw

Below is the output from test relation that seems contradictory.  All I did was swap the order of operation from summing an integral to taking the integral of the sum.  The summation and integration variables are independent so I would think the statement for S4 would yield a TRUE result.  Also, I got a FALSE return on a well known trig identity.

Am I missing something subtle or even obvious?

equivalence_discrepancy.mw

I am still working on the worksheet linked below.  But I have run into trouble solving the equation symbolicly within for the variable t.  I think this is due to the fact there are multiple solutions and the commands I employed through the GUI interface is not capable of handling this issue?  For example, the solutions for sin(pi*t/T) would be N*T.  MAPLE is simply stating t=0.  So I think this is why my solutions are failing to produce results.

What other commands should I be employing?

solving_transcendental.mw

with(LinearAlgebra):
test1 := Matrix([[1,-1],[-1,1]]);
for i from 1 to 20 do
print(Eigenvectors(test1)[2]);
od:

i run the same command 20 times, but sometimes left has negative 1 , sometimes right has negative 1

why position is like random , is my maple has virus?

the result are not consistent, i am learning quantum computation, will this influence the quantum computation and result?

i am doing up and down and change to a differential equation, Pauli equation

It seems only one Pauli equation

i find 3*3 matrix 

has 3 different kinds of matrix

one is row 1 and row 2

second is row 1 and row 3

Third is row 2 and 3

column 1 is constant 

Is there any one has the same experience to predict these 3 kind of matrix, and know what I mentioned?

I executed finding the roots of the derivative of a series expansion containing 500 terms.  I did it 2 ways.  The 1st using fsolve & the 2nd using RootFinding.  The fsolve took over 20 minutes to find a single root within a specified range while the RootFinding took less than 60 seconds to find all roots within a larger range.  I do not know of the inner mechanisms of either command, but why is this the case?  Why would the algorithms differ?  My results are in the link below.

fsolve_vs_RootFinding.mw