Emporia ESIRC

Methods of finding the eigenvalues of a real matrix.

ESIRC/Manakin Repository

Show simple item record

dc.contributor.author Saiedian, Hossein.
dc.date.accessioned 2012-08-24T19:05:00Z
dc.date.available 2012-08-24T19:05:00Z
dc.date.created 1983 en_US
dc.date.issued 2012-08-24
dc.identifier.uri http://hdl.handle.net/123456789/2066
dc.description 51, [11] leaves en_US
dc.description.abstract Certain numerical analyses primarily concern themselves with problems normally found in the subjects classified as Linear Algebra and Matrix Theory. One of the problems is the determination of the spectrum (set of eigenvalues) and the eigenspaces for a square matrix. Considering the matrix equation Ax = AX, the problem is to determine those values of A for which the equation has a nonzero solution X. These values of A are called eigenvalues of A. The problem of finding the eigenvalues for A is equivalent to analyzing when the square homogeneous linear system (A -AI)X = 0 has a nonzero solution X. This can occur when the system has infinitely many solutions which is equivalent to this condition: IA -AIl = 0 (called the characteristic equation). Therefore one way to determine the spectrum of the matrix is to find the roots of the characteristic equation. However this method is inherently unstable since very small errors in the coefficients of characteristic equation lead to large deviations of spectrum of the matrix. Therefore, we try to use some strategies to reduce the original matrix to a specialized matrix having the same eigenvalues but with more accuracy, and less work. en_US
dc.language.iso en_US en_US
dc.subject Eigenvalues. en_US
dc.subject Matrices. en_US
dc.title Methods of finding the eigenvalues of a real matrix. en_US
dc.type Thesis en_US
dc.college las en_US
dc.advisor Marion Emerson en_US
dc.department mathematics, computer science, and economics en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record