Return to search

Algorithms for Toeplitz Matrices with Applications to Image Deblurring

In this thesis, we present the O(n(log n)^2) superfast linear least squares Schur algorithm (ssschur). The algorithm we will describe illustrates a fast way of solving linear equations or linear least squares problems with low displacement rank. This program is based on the O(n^2) Schur algorithm speeded up via FFT. The algorithm solves a ill-conditioned Toeplitz-like system using Tikhonov regularization. The regularized system is Toeplitz-like of displacement rank 4. We also show the effect of choice of the regularization parameter on the quality of the image reconstructed.

Identiferoai:union.ndltd.org:GEORGIA/oai:digitalarchive.gsu.edu:math_theses-1047
Date21 April 2008
CreatorsKimitei, Symon Kipyagwai
PublisherDigital Archive @ GSU
Source SetsGeorgia State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceMathematics Theses

Page generated in 0.0019 seconds