Re: Signs of eigenvalues after a positve row transformation



Thank you Robert,

Going back to your negative example about (1) (2) (3) will the situation change
if $M$ is positive?


In article <dief05$3hk$1@xxxxxxxxxxxxxxxxxxxxxx>, Robert Israel says...
>
>In article <die67i01qp@xxxxxxxxxxxxxxx>,
>Aditya Bhat <aditya_bhat59@xxxxxxxxxxx> wrote:
>>I'm wondering if you can help me (an unfortunate economist)
>
>>I have two questions:
>>
>>A) If M is an mxm real matrix with non-zero eigenvalues a1 a2 .. an
>>and we multiply one of the rows of M by a positive scalar, then
>>is it the case that
>>
>>1) the number of complex eigenvalues of the new matrix is greater than or equal
>>to the number
>> of complex eigenvalues of the old matrix M
>
>I assume by "complex" you mean "non-real".
>No. For example, consider
>
>[ 0 1 ]
>[ -1 1 ]
>
>which has two complex eigenvalues. Multiply the top row by 1/5 and
>you have two real eigenvalues.
>
>>2) the number of positive eigenvalues of the new matrix is not greater than the
>>number of positive
>>eigenvalues of the old matrix M
>
>No: same example.
>
>>3) the number of negative eigenvalues of the new matrix is not greater than the
>>number of negative
>>eigenvalues of the old matrix M
>
>No: consider -M in the previous example.
>
>>B) If m is odd and M is a positive matrix can I perturb M so that all but one
>>(obviousely a positive one)
>>eigenvalue is complex.
>
>It may depend on what you mean by "perturb". A small enough change
>will not be able to do it, if the initial M has more than one simple real
>eigenvalue. A large change can give you anything you want.
>
>Robert Israel israel@xxxxxxxxxxx
>Department of Mathematics http://www.math.ubc.ca/~israel
>University of British Columbia Vancouver, BC, Canada

.



Relevant Pages

  • inverse iteration for complex eigenvalues
    ... i have been using the 'inverse algorithm' to find eigenvalues of a real ... but it seems to only converge satisfactorily for real eigenvalues. ... for complex eigenvalues it seems to give spurious and widely converging ...
    (sci.math.num-analysis)
  • Re: Signs of eigenvalues after a positve row transformation
    ... >1) the number of complex eigenvalues of the new matrix is greater than or equal ... >3) the number of negative eigenvalues of the new matrix is not greater than the ... It may depend on what you mean by "perturb". ...
    (sci.math)
  • Re: generalized eigenvalue problem
    ... a regular EVP. ... eigreturns the eigenvalues 1/5 and Inf. ... possible to get complex eigenvalues from a symmetric pencil though. ... Hermitian condition too. ...
    (comp.soft-sys.matlab)
  • Re: QR algorithm for eigenvalues
    ... I don't remember this but I think there are some modifications of the QR algorithm for computing complex eigenvalues. ... See e.g. Golub: Matrix Computations. ...
    (sci.math.num-analysis)
  • Re: Tetration / Powertowers again
    ... that the sequence of negative eigenvalues might have ... of the geometric series for negative argument r. ... finite dimension examples of Bs), ...
    (sci.math.research)