z-logo
Premium
Computing bounds to real eigenvalues of real‐interval matrices
Author(s) -
Leng Huinan,
He Zhiqing,
Yuan Quan
Publication year - 2007
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.2179
Subject(s) - eigenvalues and eigenvectors , interval (graph theory) , mathematics , interval arithmetic , computer science , real number , algorithm , mathematical optimization , discrete mathematics , combinatorics , mathematical analysis , physics , quantum mechanics , bounded function
Abstract In this study, a new method with algorithms for computing bounds to real eigenvalues of real‐interval matrices is developed. The algorithms are based on the properties of continuous functions. The method can provide the tightest eigenvalue bounds and improve some former research results. Numerical examples illustrate the applicability and effectiveness of the new method. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here