MaplePrimes Questions

hi,

i want to solve this equation :

 

f(n+1)(x)=f(n)(x)-int [ (s-x)^2 * ( F"(n)(s)+.5*F(n)(s) ) ds]

 integration is from  -infinity  to  x

with this initial guess   f(0)(x)=A+Bx+C*exp[-x]

i want for example F(4)(x) in terms of A,B,C

 and then calculate A,B and C with this condition

f(0)(4)=0

f'(0)(4)=0

f'(10)(4)=1


please help me

 

thancks

Dear guys

I have an expression and I solve it by "solve". It has two results and I want to choose first of them. How can I choose for example the first result? Is the order of results the same if I run the program many times?

 

For the following system:

x1 := M*(cos(phi)-a*cos(3*phi)) / (1-b*cos(2*phi))

x2 := M*(cos(phi)+a*cos(3*phi)) / (1+b*cos(2*phi))

y1 := M*(sin(phi)-a*sin(3*phi)) / (1-b*cos(2*phi))

y2 := M*(sin(phi)+a*sin(3*phi))/ (1+b*cos(2*phi))

I'd like to find M(x1,x2,y1,y2) if possible; that is, I'd like to solve for M in terms of x1, x2, y1, and y2, eliminating a, b, and phi.

I've tried

solve({x1=X1, x2=X2, y1=Y1, y2=Y2},{M,a,b,phi},AllSolutions);

Hello all,

 Is any anyone know how good is maple numeric stiff ode solver (stiff=true) ? What i mean is how many stiff ode's it can handle at a given time. I am having a hardtime solving a system of ode's (say 300 stiff ode's). Is there any other numeric stiff ode solver in maple that can handle large number of ode's?

I used islode advanced numeric solver for stiff ode's and it also has some limitations on the number of ode's and moreover it is slow.

I have been investigating Predator-Prey spatial models, e.g.

diff(N(x, t), t) = r*N(x, t)*(1-N(x, t)/K(x, t))-a*N(x, t)*P(x, t)+d[1]*(diff(N(x, t), x, x))

diff(P(x, t), t) = P(x, t)*(b*N(x, t)-c)+d[2]*(diff(P(x, t), x, x))

 

How to Plotting Matrix  8 × 8 matrix:

0, 0, 0, 0, 0, 0, 0, 0
0, 1, 1, 1, 1, 1, 1, 0
0, 1, 0, 0, 0, 0, 1, 0
0, 1, 0, 1, 1, 0, 1, 0
0, 1, 0, 0, 0, 0, 1, 0
0, 1, 0, 0, 0, 0, 1, 0
0, 1, 1, 1, 1, 1, 1, 0
0, 0, 0, 0, 0, 0, 0, 0

This matrix would correspond to the following image where 0=black and 1=white.

Gracias

independent.mw

initial/boundary conditions can only contain derivatives which are normal to the boundary

I got this message when trying to solve a system of three PDEs numerically. Does anyone knows what it mean? Thanks.

newlam

How to output a list when writing a procedure

i want to get the list c in the procedure, but "return" c not work

z := [x1, x2, x3];
symMonomial(z)

symMonomial := proc(test)
with(combinat):
h := 0;
for i from 1 to nops(test) do
    h[i] := choose(z,i);
od;

c := 0;
for k from 1 to nops(test) do
    c[k] := 0;
    for i from 1 to nops(h[k]) do
        ki := 1;

I start with a question, but not an how-to question, because I am puzzled by why such a routine is missing.

Why does Maple not have  generalized Schur (real and complex) factorizations with reordering?  The nice solution of many dynamic equations requires this factorization because the lhs is singular. MatLab does have such a routine. At the moment, it seems, one has to have accessible and connect to MatLab or NAG or LAPACK for such routines.

Is this...

Is there a way to select multiple entries in a ListBox component? 

 

Using the following script with cmaple I got a plot with three legend elements. (see img link). 

How can I remove Curve 3 and Curve 5 entries?

with(plots):
plotsetup(gif,plotoutput=`test_maple.gif`,plotoptions=`color,noborder,portrait`):

l:=10^(-3);
Vel:=(y,t)->sum(n*y*t, n = 0 .. 10);

Vel1 := plot(...

I am trying to learn how to use Maple by working simple-minded projective geometry problems. I want to define a line in terms of two points, one of which is an intersection of two other lines. Must I define the intersection before using it as an argument, or is there a way to refer to the intersection without bothering to name it, as one might do in OOP by creating an anonymous object to use as an argument of the intersection procedure?

I, too, ran into this flaw...

I multiplied 1kohm*5microF, and was surprised to find:

1. I must use mF rather than Greek microF for the capacitance. I am a novice, though, so I may have missed something.

2. The result expanded units to something ugly using [[kOmega]]. I am surprised that at this late hour in Maple development that we still see [[]] for units AND units are not automatically simplified in the unit base that we are using.

3. The examples above are clear enough, but still amount to r-clicking and selecting Units>Simplify. Typing the command doesn't remove the burden of simplifying.

4. Maple correctly suggested units of seconds for my example, so it apparently knew what to do. So where is the global option to automatically simplify units, and why are we still using [[]], and why are microFarads mF, even in light of ASCII-based history?

I looked in Help and did a web search for answers, but came up empty...

I want to show algebraically that the expected correlation is
decreasing in the tails of the distribution ie that the correlation coefficient
breaksdown when we have large moves. How can this be done?

Here is a standard example of how dcoeffs works:

> with(PDEtools);
> X := a*(diff(y(x), x, x))^2+b*(diff(y(x), x, x))+c*(diff(y(x), x));
                             2                     ...

First 1843 1844 1845 1846 1847 1848 1849 Last Page 1845 of 2434