Eigenvalues bounds for symmetric interval matrices
by Sukhjit Singh; D.K. Gupta
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 4, 2015

Abstract: The aim of this paper is to approximate the eigenvalues bounds of real symmetric interval matrices as sharp as possible. Using the concepts of interval analysis, this is done by solving the standard interval eigenvalue problem by applying the interval extension of the single step eigen perturbation method. The deviation amplitude of the interval matrix is considered as a perturbation around the nominal value of the interval matrix. The mathematical formulation of the method is described. Two numerical examples are worked out and the results obtained are compared with the results of existing methods. It is observed that our method is reliable, efficient and gives better results for all examples considered.

Online publication date: Sat, 19-Sep-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com