Institutional Repository of Vilnius University
Rymano dzeta funkcijos skaičiavimo algoritmų realizacijų efektyvumo palyginimas /
Abstract
dc:descriptionThe main goal of this work is to compare the efficiency of different realizations of the Riemann zeta function. In this work the following problems are solved: comparison of K. Fischer Zetafast algorithm [1], Belovas, Sakalauskas and Starikovičius asymptotic approximation algorithm [2] and Belovas, Sabaliauskas, Kuzma algorithm [3] which uses a Gaussian modification to the Borwein algorithm [4], realizations of the mentioned algorithms using C++ and Python programming languages and assessing the algorithms’ efficiency by interpreting data collected during the conducted experiments. The results show that the most efficient algorithm in the scope of the performed analysis is the algorithm Zetafast, suggested by K. Fischer [1] while Belovas, Sabaliauskas, Kuzma algorithm which is a Gaussian modification on the MB algorithm [3] performs best when the imaginary part of the Riemann zeta function argument is at a lower value. I also encourage to do additional analysis on these algorithms using a large interval of the real part of the argument as this work does not analyze such a scenario.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Jokubauskas, Andrius,
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD146238789&prefLang=en_US