An improved early termination sparse interpolation algorithm for multivariate polynomials

DOI10.1007/S11424-017-6143-3OpenAlexW2601780183MaRDI QIDQ1621169FDOQ1621169

Authors: Qiao-Long Huang 

Publication date: 8 November 2018

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-017-6143-3

zbMATH Keywords

Ben-Or and Tiwari's algorithmearly termination algorithmrecursive sparse interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Early termination in sparse interpolation algorithms
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• Sparse Polynomial Interpolation in Nonstandard Bases
• A new algorithm for sparse interpolation of multivariate polynomials
• Symbolic-numeric sparse interpolation of multivariate polynomials

Cited In (3)

• Robust algorithms for sparse interpolation of multivariate polynomials
• Faster sparse multivariate polynomial interpolation of straight-line programs
• Sparse interpolation in terms of multivariate Chebyshev polynomials

This page was built for publication: An improved early termination sparse interpolation algorithm for multivariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621169)