Graduation Year

2016

Date of Submission

4-2016

Document Type

Campus Only Senior Thesis

Degree Name

Bachelor of Arts

Department

Mathematics

Reader 1

Deana Needell

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Rights Information

© 2016 Dejun Wan

Abstract

This paper will demonstrate the principles and important facts of the randomized Kaczmarz algorithm as well as its extended version proposed by Zouzias and Ferris. Through the analysis made by Strohmer and Vershynin as well as Needell, it can be shown that the randomized Kaczmarz method is theoretically applicable in solving over-determined linear systems with or without noise. The extension of the randomized Kaczmarz algorithm further applies to the linear systems with non-unique solutions. In the experiment section of this paper, we compare the accuracies of the algorithms discussed in the paper in terms of making real-world macroeconomic analyses and predictions. The extended randomized Kaczmarz method outperforms both the randomized Kaczmarz method and the randomized Gauss-Seidel method on our data sets.

This thesis is restricted to the Claremont Colleges current faculty, students, and staff. It is not available for interlibrary loan. Please send a request for access through Contact Us.

Share

COinS