Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Calculation of Fibonacci polynomials for GFSR sequences with low discrepancies
HTML articles powered by AMS MathViewer

by Shu Tezuka and Masanori Fushimi PDF
Math. Comp. 60 (1993), 763-770 Request permission

Abstract:

Fibonacci polynomials are defined in the context of the two-dimensional discrepancy of Tausworthe pseudorandom sequences as an analogue to Fibonacci numbers, which give the best figure of merit for the two-dimensional discrepancy of linear congruential sequences. We conduct an exhaustive search for the Fibonacci polynomials of degree less than 32 whose associated Tausworthe sequences can be easily implemented and very quickly generated.
References
Similar Articles
Additional Information
  • © Copyright 1993 American Mathematical Society
  • Journal: Math. Comp. 60 (1993), 763-770
  • MSC: Primary 65C10; Secondary 11B39, 11Y99
  • DOI: https://doi.org/10.1090/S0025-5718-1993-1160278-0
  • MathSciNet review: 1160278