Items tagged with series series Tagged Items Feed

Hi! I'm trying to find the way to plot the solution with series representation. I need some help to find the easiest way.

Note: I realized some typing errors, which do not change the question a lot ,and I corrected them.

I wish to study the trend of medical consultations each day during six years. Thus I expect near 2200 datas to analyse.

But some parameters are to consider :

- I don't have yet the datas per day, but the mean is about 2 consultations per day

- as it is difficult to do more than 3 or perhaps 4 consultations during one day (9h30 am - 13h pm), the others if they exist will probably be seen the next day (aso if the next day 3 news consultations occured)

- then, I don't know actually (as I expect the datas or each day but don't have now these datas) if the better distribution will be simply follow a Poisson' law, or exponential, or negative binomial, ..

- do someone have a clue for the better law given what i said ?


Further, I don't have a stastic program especially used for time trend, excepting Systran 13, but I don't believe that this program can be used with a theoric model of distribution, I recall that it does usual tasks, autocorrelations, saisonnal adjustments, .. but with continuous distributions I believe, and a linear model (removing the basic frequencies)

As such program (study of temporal series) is usually sold about 3000$ in France, that I don't expect to be a trader, with only one calculus to do, could anyone tell me how to adjust the better model to the 2200 datas that could be expected ?

Thx for your help, friendly yours;


Dear all

I have a simple question about geometric series

What's the difference between g(2) and gg(2)

 Many thanks


Dear all


If its possible in  Maple to change the integral of the sum to  the sum of integrals when I calucle the integral of a function series


Thank you

Hello there,


Suppose I have a parametric experssion like   P(ε)=1+ε+ε23 where ε is very small. How can I get P(ε)≈1+ε or P(ε)≈1+ε+ε2



Dear All

Using Lie algebra package in Maple we can easily find nilradical for given abstract algebra, but how we can find all the ideal in lower central series by taking new basis as nilradical itself?

Please see following;


with(DifferentialGeometry); with(LieAlgebras)

DGsetup([x, y, t, u, v])

`frame name: Euc`

Euc > 

VectorFields := evalDG([D_v, D_v*x+D_y*t, 2*D_t*t-2*D_u*u-D_v*v+D_y*y, t*D_v, D_v*y+D_u, D_t, D_x, D_x*t+D_u, 2*D_v*x+D_x*y, -D_t*t+2*D_u*u+2*D_v*v+D_x*x, D_y])

[_DG([["vector", "Euc", []], [[[5], 1]]]), _DG([["vector", "Euc", []], [[[2], t], [[5], x]]]), _DG([["vector", "Euc", []], [[[2], y], [[3], 2*t], [[4], -2*u], [[5], -v]]]), _DG([["vector", "Euc", []], [[[5], t]]]), _DG([["vector", "Euc", []], [[[4], 1], [[5], y]]]), _DG([["vector", "Euc", []], [[[3], 1]]]), _DG([["vector", "Euc", []], [[[1], 1]]]), _DG([["vector", "Euc", []], [[[1], t], [[4], 1]]]), _DG([["vector", "Euc", []], [[[1], y], [[5], 2*x]]]), _DG([["vector", "Euc", []], [[[1], x], [[3], -t], [[4], 2*u], [[5], 2*v]]]), _DG([["vector", "Euc", []], [[[2], 1]]])]

Euc > 

L1 := LieAlgebraData(VectorFields)

_DG([["LieAlgebra", "L1", [11]], [[[1, 3, 1], -1], [[1, 10, 1], 2], [[2, 3, 2], -1], [[2, 5, 4], 1], [[2, 6, 11], -1], [[2, 7, 1], -1], [[2, 8, 4], -1], [[2, 9, 5], -1], [[2, 9, 8], 1], [[2, 10, 2], 1], [[3, 4, 4], 3], [[3, 5, 5], 2], [[3, 6, 6], -2], [[3, 8, 8], 2], [[3, 9, 9], 1], [[3, 11, 11], -1], [[4, 6, 1], -1], [[4, 10, 4], 3], [[5, 10, 5], 2], [[5, 11, 1], -1], [[6, 8, 7], 1], [[6, 10, 6], -1], [[7, 9, 1], 2], [[7, 10, 7], 1], [[8, 9, 4], 2], [[8, 10, 8], 2], [[9, 10, 9], 1], [[9, 11, 7], -1]]])

Euc > 


`Lie algebra: L1`

L1 > 


L1 > 

N := Nilradical(L1)

[_DG([["vector", "L1", []], [[[1], 1]]]), _DG([["vector", "L1", []], [[[2], 1]]]), _DG([["vector", "L1", []], [[[4], 1]]]), _DG([["vector", "L1", []], [[[5], 1]]]), _DG([["vector", "L1", []], [[[6], 1]]]), _DG([["vector", "L1", []], [[[7], 1]]]), _DG([["vector", "L1", []], [[[8], 1]]]), _DG([["vector", "L1", []], [[[9], 1]]]), _DG([["vector", "L1", []], [[[11], 1]]])]

L1 > 

Query(N, "Nilpotent")


L1 > 

Query(N, "Solvable")



Taking N as new basis , how we can find all ideals in lower central series of this solvable ideal N?


Download [944]


This question is related to the recent post

1. Consider the following fast convergent series:


As expected, the sum of the series is obtained very fast (with any precision), same results for S1 and S2.

2. Now change the series to a very slowly convergent one:


evalf(S1) is computed also extremely fast, because the acceleration algorithm works here perfectly.
But evalf(S2) demonstrates a bug:

Error, (in evalf/Sum1) invalid input: `evalf/Sum/infinite` expects its 2nd argument, ix, to be of type name, but received ...

3. Let us take another series:


Now evalf(S1) does not evaluate numerically and evalf(S2) ==> same error.
Note that I do not know whether this series is convergent or not, but the same thing happens for the obviously convergent series


(because it converges slowly (but absolutely) and the acceleration fails).
I would be interested to know a method to approximate (in Maple) the sum of such series.

Edit. Now I know that the mentioned series 

converges (but note that Leibniz' test cannot be used).

Before version 2016 Maple was incredibly good at evaluating an infinite power series and returning a simple function, e.g. 1/(3x+2).  Now version 2016 just returns the input sum expression with no change.  Is there some new command to get the old results?

Hello, I have a somewhat math and Maple question I'm hoping some can help with.

I have this curve,


and if I solve this system (numerically);

sol:= solve([curve=0,diff(curve,beta)=0],[alpha,beta]);

I get 6 special points (8 actually but two are critical). So I'll refer to them by subscript "i".

If I then do a coordinate transformation by;



and convert the 6 coordinates and curve, I'll get everything in terms of (u,v) coordinates.


soluv:=map(ln,sol);  (this is just pseudo - I don't know how to do it this way)

So now the 6 points are referred to by (u_i,v_i).

Next, I want to expand this curve locally around these six points, using the following (where "z" is the local coordinate);

u -> u_i + z^2

v -> v_i + sum(a_j*z^j,j=1..n)

where n is reasonable, though around 15.

curve3(i):=subs(u=z^2 + cat(Ubp,i),curve2);


Here, I'm not sure of the pros/cons of cat() vs a[i,j]....


Anyway, I'll then have an equation in terms of only the local coordinate "z". If I then solve each coefficient of "z", at each order, I should then be able to determine the power series v(z). I reason that since the curve is initially equal to zero, that every non-zero power of z will have a coefficient/equation (in terms of unknowns a[i,j]) that should be equal to zero.

This is analagous to solving differential equations with power series...


However, I'm a little lost in implementing this,

I am currently trying, for instance,

l1:= series(curve4(1,10),z,0,9);

e1:= seq(coeff(l1,z,i),i=1..4):



I believe I am doing something wrong though bcause every odd power is zero.


Thank you a lot for any suggestions and/or help,



Ubp and Vbp are those 6 points - I just kept them as symbols initially because I was still getting odd-powered coefficients as zero, regardless of their actual values. Hence a little bit of the "math" side of the problem...

I want to make sense of the expression

Int(t^2/ln(t)*exp(-t), t=0..infinity);

The denominator vanishes at t=1.  The singularity at t=1 is not integrable.  I want to see whether the integral is defined in the sense of Cauchy principal value.  Thus, I let

K := Int(t^2/ln(t)*exp(-t), t=0..1-a) + Int(t^2/ln(t)*exp(-t), t=1+a..infinity);

and wish to see whether the following limit exists:

limit(K, a=0, right);

Maple cannot evaluate this.  Nor can I.  Alternatively, we may try:

series(K, a=0);


series(K, a=0) assuming a>0, a<1;

In both cases Maple says that it is unable to compute the series.

So my question is: Does the Cauchy principal value exist, and can Maple help one to determine that?


@Markiyan Hirnyk 


Thanks for helping.

(1) But how to find period using code?

(2) how did you determine n=29 ?

(3) I don't need sequence of numbers, but would like to extract the coefficients of exp(..) terms. For example in the follwoing expression, how to extract the coefficients: (note that the expression is missing one more term and i don't know how to fix?)



Dear all;

I open this good discussion, and hope can get a nice and strong idea in this domain of approximation of Hankel funciton and order truncation of infinite series. Thanks for all idea, can improve the discussion. 

Using the asymptotics of Hankel function for large argument and large orders ( both together) and
find   an order of truncation N of the obove series so that we can ensure an error bound  of epsilon( epsilon very small given).  abs(sum ( c[m]*HankelH1(m,x)*exp(I*m*theta), m=-infinity..infinity)-sum ( c[m]*HankelH1(m,x)*exp(I*m*theta), m=-N..N))<epsilon.

A first idea come in mind: the series converge, so that the general terms of this series converge to zero, and in particularity,  abs(c[m]* HankelH1(m,x))<1:
then abs(c[m])<1/ abs(HankelH1(m,x)).
So we can ensure an error bound of epsilon on the coefficient c[m] by imposing  (HankelH1(m,x))<epsilon  this lead to abs(c[m])<epsilon.
I consider the case where m and x are very large, I can suppose for example m=x*(1+zeta), with 0<zeta<1. zeta parameter. So that our truncation N depend on zeta.
And then how can I find and approximation of the inverse of Hankel function for large argument and large order. using m=x*(1+zeta). I think this give us N the truncation order.
I hope get a good discussion in this subjet.
Of course maybe there are other strong idea to compute the truncation series.
I get the following error in the code:

Error, (in MultiSeries:-multiseries) unable to expand with respect to parameter




###### Code### and error

assume(0 <= x);

assume(0 <= zeta<1);


sum(c[m]*HankelH1(m, x)*exp(I*m*theta),m=-infinity..infinity);


MultiSeries:-asympt(%,x, 4);

eval(%, O=0);



I am having difficulty helping someone series expand an eigenvector solution.  I can expand the eigenvalues easily but get a numeric exception divide by zero when I attempt to expand a component of an eigenvector.  Mathematica seems to have no problem solving this problem.  Any help would be appreciated.






assume(varepsilon > 0)

H := Matrix(3, 3, {(1, 1) = 0, (1, 2) = -epsilon, (1, 3) = epsilon, (2, 1) = -epsilon, (2, 2) = 2-2*epsilon, (2, 3) = 0, (3, 1) = epsilon, (3, 2) = 0, (3, 3) = 2+2*epsilon})

Matrix(%id = 18446744078100429630)



evals, evecs := Eigenvectors(H):

e1 := convert(simplify(series(evals[1], varepsilon = 0, 4)), polynom)



e2 := convert(simplify(series(evals[2], varepsilon = 0, 4)), polynom)



e3 := convert(simplify(series(evals[3], varepsilon = 0, 4)), polynom)



simplify(series(evecs[1][1], epsilon = 0, 4))

Error, (in simplify/sqrt/local) numeric exception: division by zero





I am trying to extract the coefficients of z from its series expansion. In two cases I succeed in finding the coefficients, but in the last one I fail to get the correct coefficients. Some garbage value is obtained. What is the reason behind this? I have attached my maple program.


When I execute the command


and then refer to the equation in a new execution group using a equation label (CTRL-L on Windows), the equation is shown in Maple 18, but in Maple 2015 I get an error message: 'Error, missing operator or ';'. Using the % instead does work for both versions.

Is this intended behaviour or a bug in Maple 2015?



1 2 3 4 5 6 7 Page 1 of 8