Change search
ReferencesLink to record
Permanent link

Direct link
Efficient algorithms for eigenvalue problems
2001 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In computational science symmetric eigenvalue problems are central and the need for fast and accurate algorithms are high. When solving a symmetric eigenvalue problem the easiest way is to first transform the full matrix into a tridiagonal problem and then solve it. In this thesis we studie two algoritms for the symmetric tridiagonal eginvalue problem, Cuppen's Divide and Conquer and Dhillon's O(n²). These two algorithms show better performance than the classical Bisection followed by Inverse Iteration. Issues about implementation both serial and parallell are discussed.

Place, publisher, year, edition, pages
Keyword [en]
Technology, Eigenvalues, Symmetric, Tridiagonal, Divide, Conquer, Dhillon, Eigenvectors, Numerical Linear Algebra
Keyword [sv]
URN: urn:nbn:se:ltu:diva-47476ISRN: LTU-EX--01/297--SELocal ID: 50480aee-fb3d-4e46-a1ea-c96547dea981OAI: diva2:1020801
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

fulltext(390 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 390 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link