Cart (Loading....) | Create Account
Close category search window
 

Upper Bounds on Eigenvalue Variation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guoxing Wu ; Dept. of Math., Northeast Forestry Univ., Harbin, China ; Yinyin Huang ; Duanmei Zhou ; Yanjun Yan

Let A and à = D1*AD2 be two n × n diagonalizable matrices with eigendecomposition A = XΛX-1 and A = X̃Λ̃X̃-1, where D1, D2, X and X̃ are nonsingular, and Λ = diag(λ1,⋯, λn) and Λ̃ = diag(λ̃1L ⋯, λ̃n). Li [1] proved that if λ1 ≥ λ2 ≥ ⋯ ≥ λn ≥ 0 and λ1 ≥ λ2 ≥ ⋯ ≥ λn ≥ 0, then max1 ≤ j ≤ nj-λ̃jj| ≤ ∥X-12∥X̃∥2∥D22 × ∥X̃-1 (D1*-D2-1)X∥2, max1≤ j ≤ nj-λ̃j/λ̃j| ≤ ∥X-12∥X̃∥2∥D1-*2 × ∥X̃-1(D1*-D2-1)X∥2. In this note, we show that the bounds are valid under slightly more general conditions.

Published in:

Computational Sciences and Optimization (CSO), 2011 Fourth International Joint Conference on

Date of Conference:

15-19 April 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.