The Divide-And-Conquer Method for the Solution of the Symmetric Tridiagonal Eigenproblem and Transputer Implementations
This thesis describes a divide-and-conquer method for solving the symmetric tridiagonal eigenproblem and its parallel implementation on a transputer network.The method was first developed by Cuppen based on previous ideas of Bunch et al. who showed how to compute the eigensystem of a diagonal matrix...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Dissertation |
| Jazyk: | angličtina |
| Vydáno: |
ProQuest Dissertations & Theses
01.01.1994
|
| Témata: | |
| ISBN: | 9798380492997 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This thesis describes a divide-and-conquer method for solving the symmetric tridiagonal eigenproblem and its parallel implementation on a transputer network.The method was first developed by Cuppen based on previous ideas of Bunch et al. who showed how to compute the eigensystem of a diagonal matrix which is perturbed by a rank-one matrix.We develop a new approach to the theory for arriving at the secular equation, the roots of which are the eigenvalues of a given symmetric tridiagonal matrix. We present new proofs for the convergence of the iterative method which finds these roots. We incorporate into the solution process an alternative way of computing any root when it is found to be very close to the right endpoint of the interval, generated from data for the unperturbed matrix, within which it is located. When this situation occurs the computation of the corresponding eigenvector is obstructed. Our reformulation circumvents this difficulty and, used in conjunction with the original means of computing the roots, produces generally more accurate results.We have implemented the Divide-and-Conquer algorithm on a network of transputers organized in a rectangular grid. This organization works well, while remaining straightforward to program. Because of the way the Divide-and-Conquer method works, our implementation is best suited to a number of processors which is a power of two. The maximum number of transputers for which the program was tested was 16.The Divide-and-Conquer method was found to be faster than the QL algorithm, even when executed in sequential mode. An explanation for this is suggested by complexity models, which we have developed. The method was also found to have good scalability when the number of processors is increased; that is we still obtain good speed-up values when more processors are used. A further feature is its superlinearity performance: efficiencies greater than 1 have been obtained. To some extent our complexity model explains this; it does not, however, take into account communication issues, which will be the subject of future work. |
|---|---|
| AbstractList | This thesis describes a divide-and-conquer method for solving the symmetric tridiagonal eigenproblem and its parallel implementation on a transputer network.The method was first developed by Cuppen based on previous ideas of Bunch et al. who showed how to compute the eigensystem of a diagonal matrix which is perturbed by a rank-one matrix.We develop a new approach to the theory for arriving at the secular equation, the roots of which are the eigenvalues of a given symmetric tridiagonal matrix. We present new proofs for the convergence of the iterative method which finds these roots. We incorporate into the solution process an alternative way of computing any root when it is found to be very close to the right endpoint of the interval, generated from data for the unperturbed matrix, within which it is located. When this situation occurs the computation of the corresponding eigenvector is obstructed. Our reformulation circumvents this difficulty and, used in conjunction with the original means of computing the roots, produces generally more accurate results.We have implemented the Divide-and-Conquer algorithm on a network of transputers organized in a rectangular grid. This organization works well, while remaining straightforward to program. Because of the way the Divide-and-Conquer method works, our implementation is best suited to a number of processors which is a power of two. The maximum number of transputers for which the program was tested was 16.The Divide-and-Conquer method was found to be faster than the QL algorithm, even when executed in sequential mode. An explanation for this is suggested by complexity models, which we have developed. The method was also found to have good scalability when the number of processors is increased; that is we still obtain good speed-up values when more processors are used. A further feature is its superlinearity performance: efficiencies greater than 1 have been obtained. To some extent our complexity model explains this; it does not, however, take into account communication issues, which will be the subject of future work. |
| Author | Fachin, Maria Paula Gonҫalves |
| Author_xml | – sequence: 1 givenname: Maria surname: Fachin middlename: Paula Gonҫalves fullname: Fachin, Maria Paula Gonҫalves |
| BookMark | eNotj8tOwzAQRS0BCyj9AxaWWCe1Jy97WYVCK4pYENaVHdutUWKHxAHx9xiV1Wjmjo7OvUGXzjuN0B0lKQCBfPXu7LN2YUVoSiAFSnl-gZa84ixjJOfAeXWNvpuTxg_2yyqdrJ1Kau8-Zz3iFx1OXmHjRxzix5vv5mC9w96c95--12G0LW5Gq6w4eic6vLFH7YbRy073WDgVQ-GmYQ4RuOuHeI0-4o8z3aIrI7pJL__nAjWPm6beJvvXp1293ieyoiyRkmnJWwWkFKaAzNBStiaDkhkiDKiCF7k0bU5oWRqqCG8NjxnInLCMijZboPszNlrFXlM4fPh5jK7TAVjFoKQFZdkvr_Rf1w |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 0BH CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI |
| DOI | 10.22024/UniKent/01.02.21194 |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Dissertations & Theses Europe Full Text: Science & Technology ProQuest One Academic Middle East (New) ProQuest One Academic UKI Edition ProQuest One Academic Eastern Edition ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global |
| DatabaseTitleList | Dissertations & Theses Europe Full Text: Science & Technology |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 0BH CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI |
| ID | FETCH-LOGICAL-b718-bb8eb9cd206af523f16bcf3268f0af2d5954bfc40166f1d09cf968f2b40831ac3 |
| IEDL.DBID | G20 |
| ISBN | 9798380492997 |
| IngestDate | Tue Jul 22 13:53:55 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-b718-bb8eb9cd206af523f16bcf3268f0af2d5954bfc40166f1d09cf968f2b40831ac3 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| OpenAccessLink | https://doi.org/10.22024/UniKent/01.02.21194 |
| PQID | 2878261518 |
| PQPubID | 51922 |
| ParticipantIDs | proquest_journals_2878261518 |
| PublicationCentury | 1900 |
| PublicationDate | 19940101 |
| PublicationDateYYYYMMDD | 1994-01-01 |
| PublicationDate_xml | – month: 01 year: 1994 text: 19940101 day: 01 |
| PublicationDecade | 1990 |
| PublicationYear | 1994 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| Score | 1.2622757 |
| Snippet | This thesis describes a divide-and-conquer method for solving the symmetric tridiagonal eigenproblem and its parallel implementation on a transputer... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Chemical reactions Decomposition Economic models Eigenvalues Eigenvectors Epidemiology Iterative methods Linear algebra Mathematics Partial differential equations Tuberculosis |
| Title | The Divide-And-Conquer Method for the Solution of the Symmetric Tridiagonal Eigenproblem and Transputer Implementations |
| URI | https://www.proquest.com/docview/2878261518 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagMAADb_GWB1arie2m9oRQH2KgFUOFulV-xKhDE0gKiH_P2XEBCYmFMXKkRNbl7rtzvu9D6JolxkppKGE504QbqohQjhHaVdYrhKkkDPQf77vjsZhO5UMcuNXxt8pVTgyJ2pbGz8jbgOwBCUN9EjfPL8S7RvnT1WihsY42PLs2kH1po-QkBROAfiHbdhvGHIU2n7cByUEGW7YbqU4vb8Z_ZeFQWoa7_32pPbTT_3Gmvo_W8uIAbY--5FjrQ_QOwYD7nniVk9vCkl5ZwFMqPAr20RhwK4a78WpEhkvXXH8sFt5wy-BJNYc4evKoHQ-8fmf0ocGqsLjRR_fWEDhoDS8inamoj9BkOJj07kh0XCAaahTRWuRaGkuTTDnoUF2aaeMA4AmXKEdtR3a4dgZasixzqU2kcRLWqOber0wZdoxaRVnkJwgD7OLcmZxb7rhkgENdqqlWJtUCQIg4RRerHZ3Fr6aefW_n2d_L52ir0TT2o5AL1FpWr_kl2jRvy3ldXYUg-ATk_L55 |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB2xSSwHdrEU8AGOVlPHbe0DQqgFUXURhwhxi7zEqIem0BQQH8U_Mk4aQELixoFj5CiSM87zm4nnPYDTMDBWSsNomISacsMUFcqFlDWV9QphKsgL-ne95mAg7u_l7Ry8l70w_lhliYk5UNux8TXyKjJ7ZMK4P4mLxyfqXaP839XSQqNYFt3k7RVTtuy808b4njF2fRW1bujMVYBqxGGqtUi0NJYFDeUwC3O1hjYOSYxwgXLM1mWda2cw7Wg0XM0G0jiJY0xz78mlTIiPnYdF7pXufG8xK4SjpAgFkm0E92bRoMcY7n5VJI4ImNNqoQzq1dT4D9DPd7Lr9X_2DjZgrf3txMAmzCXpFqz2P8Vms214xaVO2r6tLKGXqaWtcYqTmpB-bo5NkJUTvJuUBUAydsX122jk7cQMiSZD_EoefE5Crrw66cxlh6jUkkL93RtfkFxJeTRr1kqzHYj-Yta7sJCO02QPCJJKzp1JuOWOyxBZtqtpppWpaYEUS-xDpQxgPMOELP6K3sHvwyewfBP1e3GvM-gewkqh3uyLPhVYmE6ekyNYMi_TYTY5ztcfgfiPY_0Bur8bbQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=The+Divide-And-Conquer+Method+for+the+Solution+of+the+Symmetric+Tridiagonal+Eigenproblem+and+Transputer+Implementations&rft.DBID=053%3B0BH%3BCBPLH%3BEU9%3BG20%3BM8-%3BPHGZT%3BPKEHL%3BPQEST%3BPQQKQ%3BPQUKI&rft.PQPubID=51922&rft.au=Fachin%2C+Maria+Paula+Gon%D2%ABalves&rft.date=1994-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9798380492997&rft_id=info:doi/10.22024%2FUniKent%2F01.02.21194&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9798380492997/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9798380492997/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9798380492997/sc.gif&client=summon&freeimage=true |