Diversification improves interpolation

DOI10.1145/1993886.1993909zbMath1323.65010OpenAlexW2071252649MaRDI QIDQ5254162

Daniel S. Roche, Mark W. Giesbrecht

Publication date: 9 June 2015

Published in: Proceedings of the 36th international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993886.1993909

zbMATH Keywords

interpolationsymbolic-numeric algorithmsparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Randomized algorithms (68W20)

Related Items (7)

Sparse polynomial interpolation based on diversification ⋮ Faster sparse multivariate polynomial interpolation of straight-line programs ⋮ Sparse polynomial interpolation based on derivatives ⋮ Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs ⋮ On the evaluation of some sparse polynomials ⋮ Deterministic sparse FFT for \(M\)-sparse vectors ⋮ A fast parallel sparse polynomial GCD algorithm

This page was built for publication: Diversification improves interpolation