Implementing Kaltofen and Yagati's fast transposed Vandermonde solver
We present a C implementation of Kaltofen and Yagati's fast algorithm for solving a transposed Vandermonde system of equations modulo a prime p. Such systems arise in sparse polynomial interpolation algorithms. We compare the speed of our C code with a Maple implementation of Kaltofen and Yagati's algorithm and also with a C implementation of Zippel's O(n2) algorithm. The paper describes Zippel's algorithm and derives Kaltofen and Yagati's algorithm from Zippel's algorithm. A version of this paper was presented at the LALO60 Conference in London, Ontario in July 2024.
Authors
- Michael Monagan (ORCID: https://orcid.org/0000-0002-4652-2889)
- H. J. Kwon
Institutions
- Simon Fraser University (CA)
Publication Details
- Journal
- Maple Transactions
- Published
- 2025-02-23
- DOI
- https://doi.org/10.5206/mt.v5i1.21229
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00