国家数学与交叉科学中心合肥分中心报告【杨争峰】

发布者:系统管理员发布时间:2015-07-23浏览次数:13

 
报告题目:Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
报告人:杨争峰,华东师范大学

  间:2015726    下午2:30―3:10

  点:东区管理科研楼  365英国上市官网1218

内容提要:

The problem of sparse interpolation with arbitrary orthogonal bases can be regarded as a generalization of sparse 
interpolation with the Chebyshev basis. In Lakshman and Saunder [1996], an algorithm, based on Prony/Blahut's method
 is provided to interpolate polynomials that are sparse in the Chebyshev basis (of the first kind). In this talk, we will 
present new algorithms for interpolating a univariate black-box univariate polynomial that has a sparse representation
 by allowing arbitrary orthogonal bases. This is joint work with Erich L. Kaltofen.
Baidu
sogou