Items tagged with eigenvalue eigenvalue Tagged Items Feed

Hi!

I am comptuing the eigenvalues and the characteristic polynomial of a 8 by 8 symmetric matrix, say M. Thus, we define the matrix M, and compute its charast. plynm. by

 

 

and its eigenvalues with the command

 

 

Well, Maple returns the charast. polynm. an dthe eigenvalues. But, if we compute p(E[k]), for k=1,...,8, thats is, the values of the polynomial p(x) in the eingenvalues, Maple not turns cero!!! I'm really confused ... anyone know what could be happening?

 

Maple attached file with this example. Thank very much for your help!!

 

Download exam_eigenvalues.mw

hi .how i can calculate eigenvector associated with the eigenvalue of the matrix.for example according attached file below

what are  eigenvector associated with the eigenvalue of matrix q which  determined as (2646.408147, 3142.030259, 6621.757707) respectively??

thanks...

eign.mw 

Hello everyone!

I'd like to as a question that might be very simple, but the thing is that I am completely new to Maple, and I have some homework I need to solve all of a sudden... I tried watching some tutorials and did a lot of search, but I just can't make this one work.
Briefly - my task is to derive the vibrational modal shapes of an annular disk (a circular disk with the center "missing"). So far what I know for sure is, that the radial term of the vibrational deflection is given as a linear combination of 4 types of bessel functions (Jn, Yn, In and Kn) - bessel functions of the 1st and second kind, and modified bessel functions of the 1st and second kind. Something like this:

Rmn(r) = A*Jn(kr) + B*Yn(kr) + C*In(kr) + D*Kn(kr).

Now, I need to find the values for k (the wavenumber), and the coeffitients B, C and D. I don't need coeffitient A, because I'll jus fix that to be 1. To do this, I have the following 4 boundary conditions:

1) Rmn(b) = Jn(kb) + B*Yn(kb) + C*In(kb) + D*Kn(kb) = 0

2) R'mn(b) = k(Jn'(kb) + B*Yn'(kb) + C*In'(kb) + D*Kn'(kb)) = 0

3) R''mn(a) = k2(Jn''(ka) + B*Yn''(ka) + C*In''(ka) + D*Kn''(ka)) = 0

4) R'''mn(a) = k3(Jn'''(ka) + B*Yn'''(ka) + C*In'''(ka) + D*Kn'''(ka)) = 0

So, four equations in four unknowns (k, B, C and D) - and I can't get it to work.

I did the following, and it gives me some totally wrong values (complex wavenumbers and such). Again, I am completely new to Maple, so I might have done something completely silly without even noticing...

b := 0.17e-1;
a := 0.8e-1;
n := 1;

R(r) := BesselJ(n,k r) + B BesselY(n, k r) + C BesselI(n, k r)  + D BesselK(n, k r) ;

eq1 := R(b) = 0;
eq2 := eval(diff(R(x), x), x = b) = 0;
eq3 := eval(diff(R(x), x, x), x = a) = 0;
eq4 := eval(diff(R(x), x, x, x), x = a) = 0;

solve([eq1, eq2, eq3, eq4], [k, B, C, D])

What is it, that I am not doing right?

Thank you very very much for the help in advance!
Andras



daer all

how can i calculate eigenvalue and eigenvectors for a big Matrix?

example Matrix 12*12.

 

thank you

Hi fellow Maple users,

I'm trying to solve an eigenvalue problem of Ax=wx, where A is a 6 by 6 Hermitian matrix with two parameters x and y. I want to solve it for w and then plot3d it with x and y as unknowns. The way I have been doing is first find the characteristic equation Determinant(A-wI)=0 and then solve it for w, and then plot3d the solutions within a range for x and y. My problem is sometimes solve(Determinant(A-wI)=0,w) would give me the 6 solutions expressed in x and y, but sometimes when the numbers in A are changed it will only give me a Rootof solution with which I cannot plot. I'm wondering if there is a better way to do this. I'm actually not very interested in the symbolic solution of w expressed in x and y, just the plot, so if there is a numerical alternative it's good too.

Thank you in advance!

worksheet/expressions/copypasteMaple

Gerschgorin := proc (A::Matrix) local Delta, m, n, AA, R, C, i, c, eig, P, Plt; Delta := proc (i, j) if i = j then 0 else 1 end if end proc; m, n := LinearAlgebra[Dimension](A); AA := Matrix(m, n, proc (i, j) options operator, arrow; Delta(i, j)*abs(A[i, j]) end proc); R := evalm(`&*`(AA, Vector(m, 1))); C := {seq(('plottools[circle]')([Re(A[i, i]), Im(A[i, i])], R[i], color = violet), i = 1 .. m)}; c := {seq(('plottools[point]')([Re(A[i, i]), Im(A[i, i])], color = blue, symbol = diamond), i = 1 .. m)}; eig := evalf(LinearAlgebra[Eigenvalues](A)); P := {seq(('plottools[point]')([Re(eig[i]), Im(eig[i])], color = red, symbol = box), i = 1 .. m)}; Plt := `union`(`union`(C, c), P); plots[display](eval(Plt), scaling = constrained) end proc

 

A := Matrix([[5, 8, 4, -3], [8, -9, 7, 5], [0, 4, 4, 2], [5, -5, 9, -9]]); evalf(LinearAlgebra[Eigenvalues](A), 3); Gerschgorin(A)

worksheet/expressions/pasteMathML

 

F := Matrix([[2, -1/2, -1/3, 0], [0, 6, 1, 0], [1/3, -1/3, 5, 1/3], [-1/2, 1/4, -1/4, 4]]); evalf(LinearAlgebra[Eigenvalues](F)); Gerschgorin(F)

Could you print A & F ?

 

regards

 

 

I have the following characteristic equation by use of maple. How do I find a condition on x, that will return real eigenvalues and complex eigenvalues?

 

 

 

If I have the following system of first order diff eq's:

x'(t)=2x(t)+3y(t)

y(t)=-3x(t)-2y(t)

then can I consider the coefficient matrix A=<<2,-3>,<3,-2>> and compute the eigenvalues of A and infer as follows:

if the eigenvalues are of the same sign- eq point is a node

if they are of opposite signs- eq point is a saddle

if they are pure imaginary- eq point is a center

if they are complex conjugates- eq. point is a spiral

I've been given these conditions but my text says for a linear system of the form x'=Ax, the eigenvalues of A can be used to identify the nature of the eq. point. I am confused as to whether this applies to the given system as well; I have obtained 5 different trajectories and drawn the phase diagram for the system

Hi,

  Is there any benchmark of the performance of maple on windows 7 64 bit vs linux, especially in solving generalized eigenvalue problem?

 

Thank you very much

I calculate eigenvalues and  eigenvectors of a floating-point square matrix M with the command Eigenvectors(M, output = 'list').  How can I estimate errors of my results?

So, newb question here. I've done my best to debug this line of code, but to no avail. For some reason this function is NOT getting solved correcting for the zeros:

cos(L*x) - x*sin(L*x)

 

This is not an extremely complex equation either, so I'm at a loss for why my while loop continues to sit there forever. I've got it set to find N number of zeros, but it'll just keep going forever never finding any zeros. I've tried mixing up the start point, and even changed the range which it's searching for them, but nothing seems to get me any closer. Please help!

 

> restart; with(plots);
> a := 0; b := 1/2; N := 5; w := 1; L := b-a;

Eigenvalue equation
> w := cos(L*x)-sin(L*x)*x;
> plot(w, x = 0 .. 50);

> lam := array(0 .. N+1);

> nn := 0; kk := 5; while nn < N do zz := fsolve(w(x) = 0, x = kk .. kk+1); if type(zz, float) then printf("lam(%d)=%f\n", nn, zz); lam[nn] := zz; nn := nn+1 end if; kk := kk+1 end do

 

Hi

i want to find the eigenvalues of this system of two equations with two unknowns:

2.097*k = .9525000000*k^.35-2.2225*b/k^.65+.2 and

(2.097-2.0955/k^.67)*b = -.2

How i can do this in Maple?

Any help will be appreciated

Eigenvectors(A, C) can be used to solve the eigenvalue problem:
A . x = lambda . C . x

if a new term " lambda^2 . D . x " is added to the right hand side, where D is a new matrix, is there a simple way to solve the new eigenvalue problem:

A . x = lambda . C . x + lambda^2 . D . x

Thank you!

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 (λ2M+S)v=0  eigenvalue problem, where λ are the eigenvalues and

1 2 Page 1 of 2