Fast and simple modular interpolation using factorial representation

G. L. Mullen, D. Panario, D. Thomson

Research output: Contribution to journalArticlepeer-review

Abstract

We study a representation for polynomial functions over finite rings. This factorial representation is particularly useful for fast interpolation, and we show that it is computationally preferable to the Lagrange Interpolation Formula (LIF) and to Newton interpolation over finite fields and rings. Moreover, over arbitrary finite rings the calculation of the factorial representation aborts naturally when a given mapping does not arise as a polynomial function.

Original languageEnglish (US)
Pages (from-to)471-480
Number of pages10
JournalAmerican Mathematical Monthly
Volume123
Issue number5
DOIs
StatePublished - Jan 1 2016

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Fast and simple modular interpolation using factorial representation'. Together they form a unique fingerprint.

Cite this