Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Language: English

You searched for subject:(Dhillon). One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Luleå University of Technology

1. Hellström, Pär. Efficient algorithms for eigenvalue problems.

Degree: 2001, Luleå University of Technology

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.

Validerat; 20101217 (root)

Subjects/Keywords: Technology; Eigenvalues; Symmetric; Tridiagonal; Divide; Conquer; Dhillon; Eigenvectors; Numerical Linear Algebra; Teknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hellström, P. (2001). Efficient algorithms for eigenvalue problems. (Thesis). Luleå University of Technology. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hellström, Pär. “Efficient algorithms for eigenvalue problems.” 2001. Thesis, Luleå University of Technology. Accessed August 08, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hellström, Pär. “Efficient algorithms for eigenvalue problems.” 2001. Web. 08 Aug 2020.

Vancouver:

Hellström P. Efficient algorithms for eigenvalue problems. [Internet] [Thesis]. Luleå University of Technology; 2001. [cited 2020 Aug 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hellström P. Efficient algorithms for eigenvalue problems. [Thesis]. Luleå University of Technology; 2001. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.