dc.contributor.author |
Shaffer, Ward J. |
|
dc.contributor.other |
Youngstown State University. Department of Mathematics. |
|
dc.date.accessioned |
2021-05-25T15:34:08Z |
|
dc.date.available |
2021-05-25T15:34:08Z |
|
dc.date.issued |
2005 |
|
dc.identifier.other |
B19736526 |
|
dc.identifier.other |
61849067 |
|
dc.identifier.uri |
https://jupiter.ysu.edu:443/record=b1973652 |
|
dc.identifier.uri |
http://hdl.handle.net/1989/16304 |
|
dc.description |
iv, 120 leaves : ill. ; 29 cm.
Thesis (M.S.)--Youngstown State University, 2005.
Includes bibliographical references (leaf 120). |
en_US |
dc.description.abstract |
Tridiagonal systems arise frequently in applied mathematics. This thesis will investigate the use of complete and truncated cyclic reduction algorithms to solve these systems. We will develop the complete cyclic reduction algorithm for tridiagonal and block tridiagonal systems. We will show the development of the Bondeli-Gander truncated algorithm for tridiagonal systems and will extend it to the case where the off-diagonal elements are not 1. Finally, we will use the work of Heller to create a truncated algorithm for block tridiagonal systems and will discuss the work necessary to extend the Bondeli-Gander algorithm to block tridiagonal systems. |
en_US |
dc.description.sponsorship |
Youngstown State University. Department of Mathematics. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.relation.ispartofseries |
Master's Theses;no. 0867 |
|
dc.subject |
Mathematics. |
en_US |
dc.subject |
Algorithms. |
en_US |
dc.title |
On the cyclic reduction of tridiagonal systems |
en_US |
dc.type |
Thesis |
en_US |