Hi everyone.

I'm going to solve a problem with HPM in Maple. I wrote some initial codes but now I'm confused becouse of P^0 coefficients in A1 and B1. I mean I can't reach to f0 and g0.

I upload that file. these are codes that i typed. could you please help me how can I reach to them(f0 & g0)?

http://www.filehosting.org/file/details/573095/Maple%20Project+.mw

Hi all,

Using the Physics package, I have defined a density operator, shown in the image below:

(I did assume(s ≠i), assume(v≠h).

I then operate on it with the Bracket as shown in the next image:

I think this should evaluate to (|Y,s,h><Y,s,h|)/2; or at least that's the result I want. However, Maple evaluates this to zero.

Is there a where to convince Maple to evaluate this to what I want/expect?

Thanks in advance,

Kevin

why the current luca_amplificatore_retroazione.msimand voltage is egual to zero?

how i can solve equations and gain{p1,p2,q1,q2}?

thanks

solve.mw

Download solve.mw

how i can differential with respect to ''y'' variable

thanks...help_(2).mw

Download help_(2).mw

I don't know the use to me of having PDF exports having animations requiring huge emails since I don't own website. Yet, I've been fooling with Apple textbook maker app that has movie imort to PDFs. Someday, I'll use google drive links...

So, action item, maybe Maple would like to have a worksheet drop in to this apple textbook app Like movies. I hope it's easy from Apple taunting html5.

Hi,

I am trying to solve a simple system of the form AX=0, where A is a N*N matrix, X is an N*1 vector (and the right-hand side of the equation is an N*1 vector of zeros, I apologize for the inexact notation). The difficulty comes from the fact that the values of A are parameterized by 2*N parameters (that I will write as the 2*N vector P), and I would like to get a solution in the form X=f(P).

One solution is to try to use LinearAlgebra[LinearSolve], but it only returns the trivial solution X=0, which I am not interested in.

Another solution is to compute analytically the Moore-Penrose pseudoinverse A^g of A, as the general solution is of the form

(I - A^g A)f ;

where f is a vector of free parameters. However, even for a small matrix size (N=4), Maple is still computing after 3 hours on my (fairly powerful) machine, and it is taking more and more memory over time. As the results are polynomial/rational equations in the parameters P, I was actually expecting Maple to be more powerful than other softwares, but for this particular problem, Matlab's symbolic toolbox (muPAD) gives quick solutions until N=6. I need, in the end, to solve additional polynomial/rational equations that are derived from the solutions X=f(P), where Matlab fails. This is why I would really like to be able to solve the above-mentioned problem AX=0 with Maple in order to try to solve the subsequent step of the problem (polynomial system) with Maple.

Any suggestions on how to do this would be highly appreciated! Thank you very much for your time and help.

Laureline

I would prefer that all the polynomials generated in my workbook by MAPLE were in expanded form.  For instance, it the elements of a matrix are polynomials, I want to see the expanded form for all of them.  What do I type into a workbook to make this happen.  (I am a new user of MAPLE.) 

12pt type is difficult for me to read.  I would like to fix a workbook so that everything yet to appear will be in 18pt type, without my having to enlarge things one at a time.   (I am a new MAPLE user.)  

When I print 2 matrix it always try to multiply them. How to force just to show?

Hi

Given two lists I and J of the same size, how can we find all perfect mathings of two lists? 

In other way, how can we find all pairing of elements of I and J? 

For exapmle, given I = [1,2,3] and J = [4,5,6], i would like to get 

[[1,4],[2,5],[3,6]], [[1,4], [2,6],[3,5]], [[1,5],[2,4],[3,6]], [[1,5],[2,6],[3,4]], [[1,6],[2,4],[3,5]], [[1,6],[2,5],[3,4]]

I can see how I can use the permutation of one list and match component-wise in order will do it, but would there be more efficient way to complete  the task? 

Ultimately, I would like do this for a list of lists, that is, for example,

I = [[3,5],[6,7,9,12]] and J = [[8,10], [1,2,4,11]] then I would like to get 

[[3,8],[5,10],[6,1],[7,2],[9,4],[12,11]] and by the above example, get 24 of product of disjoint cycles like such.

Thanks

I have seen several animated avatars on MaplePrimes. How is this done? I tried to make an animated GIF file my avatar, but it only shows the first frame. Here is the animation:

Please help me to differentiate function "u" wrt t in following manner:

Download [1063]_Sub-equation_Method.mw

Regards

hi all,

How could I write long commands in Maple?

For instance: a long vector in Matlab could be written in this way:

A=[ 3, 4, 5, 6, 6, 45, 37...

5, 4, 67, 39, -967 ];

But what is that in Maple??? 

Hi all,

I drew a undirected graph using Maple

restart;
with(GraphTheory);
with(SpecialGraphs);
with(RandomGraphs);
G := Graph(undirected, {[{1, 2}, 4], {1, 4}, {2, 3}, {2, 5}, {3, 4}});
DrawGraph(G, style = circle);

I want to import this graph to picturebox or panel on C#, please help me!