The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Software » comp.soft-sys.matlab

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Generalized Eigenvalue Problem
Replies: 5   Last Post: Dec 12, 2012 1:58 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 15
Registered: 4/23/08
Re: Generalized Eigenvalue Problem
Posted: Aug 22, 2008 4:10 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

What is this method called? I'm struggling with a similar
problem, Ax=lBx, where B has a huge range.

When performing a QZ-factorization, I get one value of
beta=0, which gives me infinite eigenvalues...

Greg Heath <> wrote in message
> On Aug 19, 2:28=A0pm, "Reza " <> wrote:
> > I'm trying to find smallest eigenvalue of A & B matrices by
> > solving (Ax=3DLBx) using eig(A,B) command. The only special
> > thing about my problem is that elements of A have a large
> > range from -10^13 to 10^13. It seems that Matlab procedure
> > is not so efficient for the problems of this type. I'm
> > pretty sure that it's missing some of the smaller

> You can rescale the problem.
> You don't give the range of B, so what follows is rather

> Any matrix, D can be factored into the form
> U =3D R*V*C
> Where R (row multiplier) and C (column multiplier) are
> nonsingular diagonal matrices with elements that are
> exact powers of 2 and abs(V) <=3D 1 (or any other power of 2).
> For constant L, A =3D R*D*C, B =3D E*C, x =3D C\y
> A*x =3D L*B*x =3D=3D> D*y =3D L*(R\E)*y
> Hope this helps.
> Greg

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.