Gamboa Quintero, Guillermo (2018) Analysis of Kneser's Root Finding Algorithm for Polynomials in a Constructive Setting. Bachelor's Thesis, Mathematics.
|
Text
bMATH_2018_GamboaQuinteroGA.pdf Download (508kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (118kB) |
Abstract
This Bachelor thesis reproduces the proof of the Kneser Algorithm which is used to find roots of nonconstant polynomials as well as providing an analysis of the algorithm in a constructive setting. At first, the motivation for Mathematical Constructivism is presented. Second, the real numbers are constructed through Cauchy sequences and equivalence classes. This leads to an axiomatization of the real numbers in the proof assistant Coq through the construction of a real number structure that is composed of Cauchy sequences of rationals. This will be proven in the first part of the thesis. The second part contains a detailed proof of the Kneser Algorithm. Finally, it contains a brief section that treats an alternative method of proving the algorithm.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Renardel de Lavalette, G.R. and Top, J. |
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 12 Jul 2018 |
| Last Modified: | 24 Jul 2018 14:04 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/17828 |
Actions (login required)
 |
View Item |