|
This article is cited in 5 scientific papers (total in 5 papers)
NUMERICAL METHODS AND DATA ANALYSIS
Fibonacci, tribonacci, …, hexanacci and parallel “error-free” machine arithmetic
V. M. Chernovab a IPSI RAS – Branch of the FSRC “Crystallography and Photonics” RAS,
Molodogvardeyskaya 151, 443001, Samara, Russia
b Samara National Research University, 34, Moskovskoye shosse, 443086, Samara, Russia
Abstract:
The paper proposes a new method of synthesis of machine arithmetic systems for “error-free” parallel computations. The difference of the proposed approach from calculations in traditional Residue Number Systems (RNS) for the direct sum of rings is the parallelization of calculations in finite reductions of non-quadratic global fields whose elements are represented in number systems generated by sequences of powers of roots of the characteristic polynomial for the n-Fibonacci sequence.
Keywords:
finite fields, n-Fibonacci and n-Lucas numbers, parallel machine arithmetic.
Received: 25.09.2019 Accepted: 14.10.2019
Citation:
V. M. Chernov, “Fibonacci, tribonacci, …, hexanacci and parallel “error-free” machine arithmetic”, Computer Optics, 43:6 (2019), 1072–1078
Linking options:
https://www.mathnet.ru/eng/co732 https://www.mathnet.ru/eng/co/v43/i6/p1072
|
Statistics & downloads: |
Abstract page: | 211 | Full-text PDF : | 148 | References: | 15 |
|