Hi, I have a task and I haven't found a good way to work with it. I need to solve cubic functions like this a*x^3+b*x^2+c*x+d=0, where a,b,c,d are calculated from other data by excel, thus can be changed if I changed other parameters. So I have to solve every cubic function defined by these {a,b,c,d} data. And the nature of the experiment need only positive rational root. First I tried to use maple addin for excel. The problem is, it seemed that maple addin doesn't support multiple parameters for expression. For example, it's ok to use =maple("&1*2",A1), but I can't use =maple("solve(&1*x^3+&2*x^2+&3*x+&4,x)",A2:D2). Is it possible to calculate an expression from multiple cell data?

I want to define a sequence of Vectors,for example ,n Vectors just as a1,a2,a3..an.How to do? Thanks!

restart
assume(c, 'real')
solve(272*c^3-213*c^2+52*c-4 > 0, c)
but i get the result:

why not the desired result?

{c < -(1/1632)*(101709+(3264*I)*sqrt(1407))^(1/3)-979/(544*(101709+(3264*I)*sqrt(1407))^(1/3))+71/272-(1/2*I)*sqrt(3)*((1/816)*(101709+(3264*I)*sqrt(1407))^(1/3)-979/(272*(101709+(3264*I)*sqrt(1407))^(1/3))), -(1/1632)*(101709+(3264*I)*sqrt(1407))^(1/3)-979/(544*(101709+(3264*I)*sqrt(1407))^(1/3))+71/272+(1/2*I)*sqrt(3)*((1/816)*(101709+(3264*I)*sqrt(1407))^(1/3)-979/(272*(101709+(3264*I)*sqrt(1407))^(1/3))) < c}, {(1/816)*(101709+(3264*I)*sqrt(1407))^(1/3)+979/(272*(101709

I can write evalhf(sin(.25)) and get an answer with more precision than simply writing evalf(sin(x)). When I create a loop and time it I see that evalhf is much faster. Unfortunately, I can't seem to take advantage of this when doing numeric integration. e. g. evalhf(int(sin(x),x=0..4)) doesn't work. Some numeric integration problems are very slow and it would be nice to speed them up with hardware evaluation. Any way to do this? -thanks

i wanna know about how can i build programmning in random generator cases.i'm new in this programmning field with no experience. i've to build programmning in random generator which the data is distributed randomly.can you help me?

I keep running into trouble where I try to evaluate a seemingly reasonable integral numerically and Maple (9.5) runs arbitrarily long before I have to give up on it. Sometimes tweaking the expression to simplify it fixes the problem and produces an answer promptly, sometimes it doesn't. How do I troubleshoot such a thing? It's very frustrating not being able to get an result and not knowing why. My current example is this: (often they're simpler!) evalf(int(int(log(1 + 1/((x-4)^2 + y^2)^(3/2) / (10^(-6.5) + 1/((x-4)^2+y^2)^(3/2))), y=-50..-1), x=-50..50)); Any thoughts? Thanks! --Micah

Again I'm going through chapter 4 of David J. Griffiths, Introduction to Quantum Mechanics, on the section dealing with the spherical bessel functions. Can someone look at my try at a personal creation of a procedure for the spherical bessel functions and tell whether it is correct and also recommend any critiques / improvements ? the user defined procedure is called n[l]. I'm also having trouble zooming in on the plots of the spherical bessel functions created using my procedure. can anyone also help with this problem ? thanks a lot. v/r, Here is the worksheet. View 285_quantmechchapter4sphericalbessel.mw on MapleNet or Download 285_quantmechchapter4sphericalbessel.mw
View file details

I wrote a procedure that should generate a series of functions. Now I would like to integrate over the sum of a specific series of the functions. Unfortunately I can't get Maple to evaluate the last integration command even though I can plot the sum of the functions. >iLk_waveform_func:=proc(Ue,Ua,Ia,L,T,t,n,k) > local liL; > # n := number of phase > # k := index of iLk > if not (t::numeric and n::numeric and k::numeric) then > return 'procname'(args) > end if; > > > if (t

i create an availability function for my markov model in which use constraits like 2 maintenance tresholds and some maintenance duration, mean time between failures. i want to determine the mean time between inspections value which max. the availability and plot its graph... should i have to give exact numerical values or is there any other ways to solve it..

I am trying to display some points on the same graph as a function. I first create 2 variables, P1:=plot(func(x),x=6..8):P2:=plots[pointplot](Data) where Data is a 10 x 2 Matrix. None of the x-values in DATA is less than 6 Problem is, when I execute plots[display]({P1,P2}) the plot produced ignores the range command in P1. It starts at x=0. Placing the range command directly in plots[display]({P1,P2}) generates an error, as does placing the range command in P2:=plots[pointplot](Data) Evidently plots[pointplot] does not accept a range command, and insists on starting at x=0. Is there any way around this?

I have a piecewise defined function iL1. Now I would like to define a function iL2 = ( iL1(t+2/3*T) for 0 <= t <= 1/3*T iL1(t-1/3*T) for 1/3*T < t <= T ) How can I do this in Maple? How can I change the boundaries in a piecewise defined function in order to be able to perform a time shift? The following linked worksheet shows the definition for iL1 and what I would like to achieve. Download 305_test_piecewise_timeshift.mws

I experienced a problem with OpenMaple: I want to use it in an application together with GMP (and other libraries) under C++. Now, when I just create gmp-integers from 1 to 100 and print them out, there is a strange behaviour if I do the same, but with starting a Maple-instance before: The numbers 8, 9 and everything greater equal 64 are not printed, instead some junk appears on the screen. But it looks like the number are internally correct, one can still calculate with them. Maybe MAPLE overwrites some global constants of GMP? Has somebody observed such problems and knows a fix? I'm using MAPLE 10, gmp-4.1.4 and gcc-3.3

Recently I was skimming on the Internet for algorithms for alignment of biological sequences (e.g. DNA sequences, protein sequences). The usual purpose of such comparisons is to determine the evolutionary genetic history of two sequences, which in the case of DNA you can think of as strings over the alphabet {A,G,C,T} (the nucleobases). Differences between sequences can arise though substitutions (A → G, G → A, C → T, or T → C), insertions, or deletions. In the last two cases, the resulting string differs in length from the original, and dealing with these size differences is the chief problem that alignment algorithms face. The Needleman-Wunsch algorithm is a very straightforward global sequence alignment algorithm, first proposed in 1970. It's a good example of the applicability of dynamic programming towards biological problems. Following is a Maple implementation based on this Ruby implementation. The algorithm depends on a similarity matrix which measures the "mutational distance" between two nucleobases. It takes two input strings, and returns two strings with dashes ("-") inserted to indicate insertion or deletion events between the sequences.

Suppose I want to know whether or not z is in the range of 1..10. Is there any way of finding this out without writing z twice, e. g. if (z>=1) and (z

I have recently upgraded to Maple 11 and I have been having a recurrent problem when I run documents with embedded plots that use "fieldplot". These documents functioned perfect using Maple 10. My problem is that I get the error "Invalid Plot Structure" when I run from a button the code restart: with(plots): plotxy:=fieldplot([x,y],x=-2..2,y=-2..2): SetProperty('Plot0', 'value', plotxy): end use; for the first time after the document is first opened. If the code is run again (after acknowledging the error, and without closing out the document), the field plot will be displayed as it should.