Some soliton solutions and periodic solutions of hybrid lattice, discretized mKdV lattice, and modified Volterra lattice have been obtained by introducing a new method. This approach allows us to directly construct so...Some soliton solutions and periodic solutions of hybrid lattice, discretized mKdV lattice, and modified Volterra lattice have been obtained by introducing a new method. This approach allows us to directly construct some explicit exact solutions for polynomial nonlinear differential-difference equations.展开更多
This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer ...This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer terms. Actually, all interpolations are eventually reduced to the interpolation of a list of polynomials with less terms than that of the original polynomial. Extensive experiments show that the new algorithm is much faster than the original algorithm.展开更多
基金中国博士后科学基金，国家重点基础研究发展计划(973计划)，Doctor Start-up Foundation of Liaoning Province，Science Research Plan of Liaoning Education Bureau
文摘Some soliton solutions and periodic solutions of hybrid lattice, discretized mKdV lattice, and modified Volterra lattice have been obtained by introducing a new method. This approach allows us to directly construct some explicit exact solutions for polynomial nonlinear differential-difference equations.
基金supported by the National Natural Science Foundation of China under Grant No.11688101
文摘This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer terms. Actually, all interpolations are eventually reduced to the interpolation of a list of polynomials with less terms than that of the original polynomial. Extensive experiments show that the new algorithm is much faster than the original algorithm.
