Publication Date
1988
Document Type
Dissertation/Thesis
First Advisor
Ammar, Gregory S.
Degree Name
M.S. (Master of Science)
Legacy Department
Department of Mathematical Sciences
LCSH
Algorithms; Equations; Toeplitz matrices
Abstract
We describe a method for solving a linear system of equations Mx = y, where M is an n X n Toeplitz matrix, which takes 0(n log² n) arithmetic operations. The algorithm discussed in this thesis is based on the method developed independently by de Hoog and Musicus. We show that when M is (Hermitian) positive definite the algorithm reduces to the Generalized Schur algorithm as discussed by Ammar and Gragg. Finally, since the above algorithms require n to be a power of 2, we show how this constraint can be relaxed to include other values of n for the positive definite case.
Recommended Citation
Nagy, James, "Superfast algorithms for solving Toeplitz systems of equations" (1988). Graduate Research Theses & Dissertations. 5142.
https://huskiecommons.lib.niu.edu/allgraduate-thesesdissertations/5142
Extent
69 pages
Language
eng
Publisher
Northern Illinois University
Rights Statement
In Copyright
Rights Statement 2
NIU theses are protected by copyright. They may be viewed from Huskie Commons for any purpose, but reproduction or distribution in any format is prohibited without the written permission of the authors.
Media Type
Text
Comments
Bibliography: pages [68]-69.