MaplePrimes Questions

Search Questions:

Hi!

I am working on a chemical engineering problem and trying to find a value (Ua) that does not result in a reactor temperature (T) exceeding 398.15 K.

I am employing a system of ode's, secondary functions, variables, starting conditions etc., and the dsolve function to determine these parameters.

Some values are given or calculated, UA is not. So for now I have just been guessing at the value (needed to preform the dsolve initially) and plotting to see relations to T and other parameters. My teacher has directed us to employ this trial and error apporach, which I find time consuming.

There is of course a smarter, more time efficient way of doing this and I was wondering how one could implement this? Moreover, how does one find the values of all the other variables at this Ua value? Is there a one-liner?

I tried implementing a loop to check for max UA values <= 398.15, but was not able to implement it..

Any help would be kindly appreciated.

FindingExtractingvaluesdsolvewithspecificconditions.mw

So my file got corrupted, i have no clue how to fix it. The file i was able to restore from OneDrive is 2 days old and is missing most of the information, i only have the backup files for the later version. Is there someone with expertice who can help me out? 

Can anyone explain me the reason of the last result?
Thanks in advance

restart

kernelopts(version)

`Maple 2015.2, APPLE UNIVERSAL OSX, Dec 20 2015, Build ID 1097895`

(1)

a/n^b;
den := denom(%);
print(cat(`_`$50));

3/n^2;
den := denom(%);
print(cat(`_`$50));

1.23/n^1.65;
den := denom(%);
num := numer(%%);

a/n^b

 

n^b

 

__________________________________________________

 

3/n^2

 

n^2

 

__________________________________________________

 

1.23/n^1.65

 

1

 

1.23/n^1.65

(2)
 

 

Download What-does-happen-here.mw

Lb1 represents a number of lengths, but I don't want to use a number to replace it now, but directly using eval, the variable in it becomes Lb1, unlike the following values show, how to write it like a number?

Hi:

I want to copy some Maple output elsewhere in the form of Maple input.

Usually, if I highlight the output expression I can copy it with CTLR-C, and paste it elsewhere where it appears as Maple input.

Just like you'd expect and just like you'd want.

But if the expression is fairly long and complicated (it covers two lines on my screent this time), the highlight insists on including the > symbol on the next line and when I paste, all I get is the Maple output that I started with.

If I write the output expression name to a temporary file and read it in another worksheet, the same thing happens when I ask for the name of the output expression - it appears as Maple output. But I need the expression in the form of Maple input so I can modify it.

All this makes me think that there is a limit to the size of the copy buffer, but I can't find anywhere to change that.

Does anyone know how to do this very simple task which usually works reliably for small expressions?

Thank you.

Hi everyone!

I'm double checking a result from maple.  When I substitute maple's solution into the differential equation, left side does no equal right side.  Does anyone have some insight into this?

thanks

the maple file is below

is_this_correct.mw

Is it possible in maple to resume an asymptotic expansion from a specific order onwards.

To be more specific.

Let's assume that I have the asymptotic expansion to say Order 20 already calculated or can import it from file.

Is it possible for Maple to use the expansion I already have and immediately start calculating Order 21 onwards ?

This will save a lot of time for numerical  expansions that can take literally days to complete.

Hey guys, 

I am working with Maple 2024. I have to solve many systems of polynomial equations symbolically. I have 8 equations, 8 variables and 14 inequalities (which also implies that I only want real solutions). In my opinion the equations are not too difficult. However there is a maximum of up to 4 variables multiplied together which could be a problem. Since I have to solve thousand of those systems I need to reduce the amount of time needed. While many of the systmes only take a few seconds, there are a few systems (10%) that need way to much time (multiple houres, sometimes I stop the process before the computation is over). 

In my attached file you can see the kind of equations I have. While "equations_500 union inequalities" only needs a few seconds, "equations_1162 union inequalities" needs more than 2 houres (than I stopped). 
I also tryed a second approach. At first I just solved the 8 equations. Then I took every solution, combined it with the set of inequalities and solved it again. Not only does it not work for equations_1162 eather, but it also sometimes brings the warning "solutions may have been lost" which is not really convincing. For that process I also used "with(RealDomain) since I only want to find real solutions when solving the eight equations in the first step. 

I figured out, that for the normal and simpel solve command it cqn help to rename the variables so the lexigraphic order as the initial situation playes a role. But when I understood the pages explaining SolveTools or Groebner, this optimal order of the variables is completed automatically inside these environments. 

So my question is: Is there any way to accelerate the process (in this case for equations_1162)? Waiting some minutes isfine, but I cant wait houres for one solution. 

Thank you in advance. 

solve_system_of_polynomials_with_inequalities.mw

Suppose I want to run several systems of equations as below, however, the processing time exceeds 45 thousand seconds (reaching hours of calculations)

  • What is better, buying a new processor (new notebook) or buying a new stick of RAM?
  • Or does none of this affect Maple? Therefore, it is just a computational disadvantage (the delay time), characterizing the slowness of the program for very large systems as an imminent characteristic.
  • Another question: The newer Maples (new versions) seem to be heavier to run. Is it just me? What seems to me is that the previous versions of Maple, because they contain fewer resources, are lighter and run certain calculations faster. Would this be correct?
  • Last question: Is it possible to do parallel processing in Maple? So that calculations on huge systems can be run faster

Thank you so much! :)

Help me, I want to make this system be stable on graphs? How to make this system stable in plot?

This is my model:

dx/dt=\[Alpha]*
  x[t]*(1 - (x[t]/n)) - ((\[Beta]*x[t]*
     y[t])/(1 + (\[CapitalTau]*\[Beta]*x[t]))) - (x[
    t]*\[CapitalEpsilon]);
dy/dt=y'[t] == -\[Gamma]*y[t];

Prove: If a is an irrational number, then the function y = cos (ax) + cos x is not periodic.
Is it possible to graphically represent or calculate this fact using an example?

I try to get some Bilinear form for some PDE equation  and already i have algorithm by writing in lecture but i can't apply i don't what is mistake i did, and i didn't seen some of this lecture code in maple  like (myint(expr,var))
 i  do upload PIcture of algorithm and example which they get Bilinear form 

Bilinear.mw

thanks for any help

I have a 2-parameters quartic equation in n (where n>=2 and integer) and want to find for which parameter values it is zero, if any exists.

Here I am analyzing the signs of each coefficient, but is there a faster way to solve my problem?
Thanks.

quartic_equation_in_n.mw

I am creating an algebra that includes shift operators. These operators commute with one another, but do not commute with anything else. I know that the Physics package enables you to make symbols non-commutative, but I would still like these operators to commute with one another. How can I do that?

Maple code example p.136 programming guide.

Explain the function of the word "divisible" in this maple code?

Why isn't divisible defined with an operator like -> ?

 

>L:= [seq( i, i=2..100)]:

> divisor := 2:

>while ( numelems( L ) > 0 )

do

divisible, L := selectremove( i->(i mod divisor = 0), L ):

n := numelems( divisible );

if ( n > 0 ) then

printf( "%d integer%s whose smallest prime divisor is %d\n",

n, `if`( n > 1, "s", "" ), divisor ):

end if;

divisor:=nextprime(divisor);

end do:

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