Computer Science ›› 2019, Vol. 46 ›› Issue (5): 298-303.doi: 10.11896/j.issn.1002-137X.2019.05.046
Previous Articles Next Articles
DENG Guo-qiang, TANG Min, LIANG Zhuang-chang
CLC Number:
[1]CUYT A,LEE W.Sparse interpolation and rational approximation[M]∥Modern Trends in Constructive Function Theory.2016:229-242. [2]CUYT A,LEE W,WANG X.On tensor decomposition,sparse interpolation and Padé approximation[J].Jaen Journal on Approximation,2016,8(1):33-58. [3]HU J,MONAGAN M.A fast parallel sparse polynomial GCD algorithm[J].Journal of the ACM,2017,1(1):1-41. [4]MONAGAN M,TUNCER B.Using Sparse Interpolation inHensel Lifting[C]∥International Workshop on Computer Algebra in Scientific Computing.Bucharest:Springer,2016:381-400. [5]BRIANI M,CUYT A,LEE W.Sparse Interpolation,the FFTAlgorithm and FIR Filters[C]∥International Workshop on Computer Algebra in Scientific Computing.Cham:Springer,2017:27-39. [6]PLONKA G,WANNENWETSCH K,CUYT A,et al.Deter-ministic sparse FFT for M-sparse vectors[J].Numerical Algorithms,2018,78(1):133-159. [7]ISTRATOV A,VYVENKO O.Exponential analysis in physical phenomena[J].Review of Scientific Instruments,1999,70(2):1233-1257. [8]ZIPPEL R.Probabilistic algorithms for sparse polynomials. Symbolic and Algebraic Computation[M]∥Symbolic and Algebraic Computation.Berlin:Springer,1979:216-226. [9]BEN-OR M,TIWARI P.A deterministic algorithm for sparsemultivariate polynomial interpolation[C]∥Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing.New York:ACM,1988:301-309. [10]GRIGORIEV D,KARPINSKI M,SINGER M.Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields[J].SIAM Journal on Computing,1990,19(6):1059-1063. [11]HUANG M,RAO A.Interpolation of sparse multivariate polynomials over large finite fields with applications[J].Journal of Algorithms,1999,33(2):204-228. [12]RAYES M,WANG P,WEBER K.Parallelization of the sparse modular GCD algorithm for multivariate polynomials on shared memory multiprocessors[C]∥ Proceedings of the International Symposium on Symbolic and Algebraic Computation.New York,NY,USA:ACM,1994:66-73. [13]KALTOFEN E,LEE W.Early termination in sparse interpolation algorithms[J].Journal of Symbolic Computation,2003,36(3-4):365-400. [14]KALTOFEN E,LEE W,LOBO A.Early termination in Ben-or/Tiwari sparse interpolation and a hybrid of Zippel’s algorithm[C]∥Proceedings of the International Symposium on Symbolic and Algebraic Computation.New York,ACM:2000:192-201. [15]JAVADI S,MONAGAN M.Parallel sparse polynomial interpolation over finite fields[C]∥Proceedings of the 4th International Workshop on Parallel and Symbolic Computation.New York,ACM:2010:160-168. [16]ARNOLD A,GIESBRECHT M,ROCHE D.Faster sparse multi-variate polynomial interpolation of straight-line programs[J].Journal of Symbolic Computation,2016,75:4-24. [17]ARNOLD A,GIESBRECHT M,ROCHE D.Sparse interpola-tion over finite fields via low-order roots of unity[C]∥ International Symposium on Symbolic and Algebraic Computation.ACM,2014:27-34. [18]CUYT A,LEE W.Multivariate exponential analysis from the minimal number of samples[J].Advances in Computational Mathematics,2017(9):1-16. [19]HAO Z,KALTOFEN E,ZHI L.Numerical Sparsity Determination and Early Termination[C]∥ACM on International Symposium on Symbolic and Algebraic Computation.ACM,2016:247-254. [20]HUANG Q L.An improved early termination sparse interpolation algorithm for multivariate polynomials[J].Journal of Systems Science and Complexity,2018,31(2):1-13. |
|