mech_problem.mw

Hi

I solve a mechanical exercise but i had a problem.

I know M (mass) and S (stifness) matrices (6x6).

I want to solve the (λ²M+S)v=0  eigenvalue problem, where λ are the eigenvalues and

In a string, how can I find a letter of both upper and lower case?

ie/ something like

StringTools[SearchAll]("h" and "H" , string)

convergence_solution.mw

Hi all,

Is it possible to get convergent solution in the coupled equations, here i have attached my file , i want to solve equations to get a value for f ' and theta , i am solving these two equations using pade approximant with limit tends to infinity, in my worksheet im trying to  solve coupled equations, is that coding is correct or still there is any possiblity...

Hi, this  must have been asked numerous time, but I cannot find it in MaplePrimes:

How does one "collect" sqrt terms? collect(expression,sqrt) does not work because sqrt is actually represented as ^(1/2) in  Maple. collect on '^' does not work either... ??

Mac Dude

Hey guys..

I need some help on determining the correlation coefficient between my data points for an Influenza epidemic and the SIR model, with my estimated parameters Beta and Alpha. The initial conditions for the equations are defined at the beginning of my worksheet:

SIR_model.mw

Hope someone can help me ;)

Hello,

I am working on a Maple project and it require me to pass a differential equation in a specific order like

x'=y & y'=x^2.(It is differentaiting w.r.t 't'(say))

However when I convert the equation into string it converts something as

diff(x(t),t)=y(t) & diff(y(t),t)=x(t)^2

Is there any way to stop maple from evaluating into maple/math format?

Is there any way to pass an equation without changing it's existing form?...

How to successfully deploy Matlab function [B, IX] = sort (A, ...)
IX is a permutation vector of the corresponding column of A

M := Matrix(6, 3, [2, 3, 3, 5, 7, 8, 12, 5, 9, -3, 4.1, 7, 7, 7, -3, 9, 3, 8]):
M;
L := <(seq(op(convert(sort(M[() .. (), j]), list)), j = 1 .. op(M)[2]))>;
L := ArrayTools[Alias](L, [op(M)[1 .. 2]], Fortran_order);
P := Matrix(op(M)[1 .. 2],  (i, j)-> ListTools[Search](L[i, j], M[() .. (), j]));
# from Matlab

I had MAPLE 12 on WINDOWS VISTA machine and the harddrive crashed.  Now I have a newer WINDOWS 7 machine & would lke to put my individually licensed MAPLE 12 on this machine.  I do not have a DVD because the original installation occurred via MAPLESOFT website if I recall correctly.

Can anyone direct me as to what I need to do?

THANKS

Hi,

I'm having some problems with the generation of the typical stiffness matrices seen in FEA formulations. I have got an elementary matrix that is looped through the entire stiffness matrix to generate it. As there is juxtaposition between the elementary matrices, there is some recursive assignment involved that I can't handle properly. Here is the code for a 6x6 elementary matrix with a 3x3 juxtaposition. n is the nombre of recursions needed to fill the stiffness matrix. M is the elementary matrix

On my keyboard, Cntrl = action for evaluating an expression inline does not work. The reason is that = is the upper level action (with the shift key) on a key with 0 at the lower level. Doing Cntrl Shift = does not work either. How do I get this done on my keyboard?

What is the number of all the solutions of the equation frac(x*floor(x)) = 1/2 belonging to RealRange(1,100)? How to count it with Maple?

Hi,

is the series expansion for the following expression bugged in maple or am I missing some crucial thing of series?

series((1/epsilon-log(4)),epsilon=0);

results in epsilon^-1 -2 -2*ln(2)

for xmaple 16.01. The console version does not add the wrong term "-2".

Apparently it works here: 

i got two density, the part of it is similar the pattern of gamma, how to convert it into an expression of gamma times something?

test2 := x*Diff(P,x$2)+(a+1-x)*Diff(P,x)+mu*P=0;
Density := int(exp(-X*(I*u-a*i))*(-i*X)^(-a), X = -infinity .. infinity);

test2 := x*Diff(P,x$2)+(a+b-x)*Diff(P,x)+mu*P=0;
Density := int(-exp(-X*(I*u-a*i-b*i+i))*(-i*X)^(-a-b)*i*X, X = -infinity .. infinity);

How is it possible to let multiple cores compute a loop faster?

For exaple:

for i = 1 to 1000 do

*computation(i)*

end do

The goal is to let a quad core cpu split the 1000 independant computations in 4 packages of 250 each to speed up the computation by the factor 4 so that core1 computes i from 1 to 250, core2 from 251 to 500 and so on, at the same time. Is this possible?

A triangle is given.The points