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.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:cmc_theses-2358 |
| Date | 01 January 2016 |
| Creators | Wan, Dejun |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | CMC Senior Theses |
| Rights | © 2016 Dejun Wan, default |
Page generated in 0.0019 seconds