In this section

    Generalised eigenvalue problem for tridiagonal symmetric interval matrices.

    (1997) Generalised eigenvalue problem for tridiagonal symmetric interval matrices. Masters thesis, King Fahd University of Petroleum and Minerals.

    [img]
    Preview
    		 PDF
    10306.pdf
    Download (1MB) | Preview

    Arabic Abstract

    -

    English Abstract

    Analgorithm to determine the eigenintervals of the generalized eigenvalue problem A¹ x =λB¹ x, where (A¹, B¹) is a pair of real tridiagonal symmetric interval matrices is presented. The eigenintervals are exactly calculated. The algorithm requires twice as much computational effort as the Sturm algorithm which is used for real point matrices.

    Item Type: Thesis (Masters)
    Subjects: Math
    Department: College of Computing and Mathematics > Mathematics
    Committee Advisor: El-Gebeily, Mohamed
    Committee Members: Selim, Shokri Z. and El-Gindi, Mohamed
    Depositing User: Mr. Admin Admin
    Date Deposited: 22 Jun 2008 14:01
    Last Modified: 01 Nov 2019 13:59
    URI: http://eprints.kfupm.edu.sa/id/eprint/10306