...
首页> 外文期刊>Numerical Algorithms >Connection coefficients for orthogonal polynomials: symbolic computations, verifications and demonstrations in the Mathematica language
【24h】

Connection coefficients for orthogonal polynomials: symbolic computations, verifications and demonstrations in the Mathematica language

机译:正交多项式的连接系数:Mathematica语言中的符号计算,验证和演示

获取原文
获取原文并翻译 | 示例
           

摘要

We deal with the problem of obtaining closed formulas for the connection coefficients between orthogonal polynomial sequences and, also, the canonical sequence, using a recursive methodology based on symbolic computations, verifications and demonstrations in the Mathematica ® language. We present the corresponding software that is available in Netlib and, with it, we derive new formulas for the connection coefficients for some semi-classical of class 1 families.
机译:我们使用基于符号计算,验证和论证的递归方法,以Mathematica®语言为基础,解决了正交多项式序列以及规范序列之间的连接系数的封闭式问题。我们介绍了Netlib中可用的相应软件,并使用它为一些半经典的1类族推导了连接系数的新公式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号