Erdal Imamoglu
- Andrew Arnold and Erich L. Kaltofen. Error-correcting sparse interpolation in the Chebyshev basis. In ISSAC'15 Proc. 2015 ACM Internat. Symp. Symbolic Algebraic Comput., pages 21.28, New York, N. Y., 2015. Association for Computing Machinery. URL: http://users.cs.duke.edu/.elk27/bibliography/15/ArKa15.pdf. Google Scholar
Digital Library
- S. Garg and É. Schost. Interpolation of polynomials given by straight-line programs. Theoretical Computer Science, 410(27-29):2659.2662, 2009. Google ScholarDigital Library
- Erdal Imamoglu, Erich L. Kaltofen, and Zhengfeng Yang. Sparse polynomial interpolation with arbitrary orthogonal polynomial bases. In Carlos Arreche, editor, ISSAC '18 Proc. 2018 ACM Internat. Symp. Symbolic Algebraic Comput., pages 223.230, New York, N. Y., 2018. Association for Computing Machinery. In memory of Bobby F. Caviness (3/24/1940.1/11/2018). URL: http://users.cs.duke.edu/~elk27/bibliography/18/IKY18.pdf. Google ScholarDigital Library
- Erich Kaltofen and Wen-shin Lee. Early termination in sparse interpolation algorithms. J. Symbolic Comput., 36(3.4):365.400, 2003. Special issue Internat. Symp. Symbolic Algebraic Comput. (ISSAC 2002). Guest editors: M. Giusti & L. M. Pardo. URL: http://users.cs.duke.edu/.elk27/bibliography/03/KL03.pdf. Google ScholarDigital Library
- Erich L. Kaltofen and Clément Pernet. Sparse polynomial interpolation codes and their decoding beyond half the minimal distance. In Katsusuke Nabeshima, editor, ISSAC 2014 Proc. 39th Internat. Symp. Symbolic Algebraic Comput., pages 272.279, New York, N. Y., 2014. Association for Computing Machinery. URL: http://users.cs.duke.edu/.elk27/bibliography/14/KaPe14.pdf. Google ScholarDigital Library
- Erich L. Kaltofen and Zhi-Hong Yang. Sparse interpolation with errors in Chebyshev basis beyond redundant-block decoding. IEEE Trans. Information Theory, accepted, September 2020. URL: http://users.cs.duke.edu/.elk27/bibliography/19/KaYa19.pdf, https://arxiv.org/abs/1912.05719.Google Scholar
- Lakshman Y. N. and B. D. Saunders. Sparse polynomial interpolation in non-standard bases. SIAM J. Comput., 24(2):387.397, 1995. Google ScholarDigital Library
- Rudolf Lidl, Gary L. Mullen, and Gerhard Turnwald. Dickson polynomials, volume 65. Chapman & Hall/CRC, 1993.Google Scholar
- R. Prony. Essai expérimental et analytique sur les lois de la Dilatabilité de fluides élastiques et sur celles de la Force expansive de la vapeur de l'eau et de la vapeur de l'alkool, à différentes températures. J. de lÉcole Polytechnique, 1:24.76, Floréal et Prairial III (1795). R. Prony is Gaspard(-Clair-François-Marie) Riche, baron de Prony.Google Scholar
- Qiang Wang and Joseph L. Yucas. Dickson polynomials over finite fields. Finite Fields and Their Applications, 18(4):814 . 831, 2012.Google Scholar
Index Terms
- A note on sparse polynomial interpolation in Dickson polynomial basis
Index terms have been assigned to the content through auto-classification.
Recommendations
Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases
ISSAC '18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic ComputationAn algorithm for interpolating a polynomial f from evaluation points whose running time depends on the sparsity t of the polynomial when it is represented as a sum of t Chebyshev Polynomials of the First Kind with non-zero scalar coefficients is given ...
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980s. These polynomials generalize Schur polynomials and form a linear basis of multivariate polynomials. In 2003, Lenart and ...
Gauss–Legendre polynomial basis for the shape control of polynomial curves
Highlights- We propose the Gauss–Legendre polynomials.
- We also propose the Gauss–Legendre curve as the barycentric combination of the control points with the weights given by the Gauss–Legendre polynomials.
- We discuss the shape control of ...
AbstractThe Gauss–Legendre (GL) polygon was recently introduced for the shape control of Pythagorean hodograph curves. In this paper, we consider the GL polygon of general polynomial curves. The GL polygon with n + 1 control points determines a ...
Comments