首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Fast conversion algorithms for orthogonal polynomials
Authors:Alin Bostan  Bruno Salvy
Institution:a Algorithms Project, INRIA Paris-Rocquencourt, 78153 Le Chesnay Cedex, France
b ORCCA and Computer Science Department, Middlesex College, University of Western Ontario, London, Canada
Abstract:We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse operation.
Keywords:2C05  05E35  11Y16  68Q25  68W40
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号