首页> 外文OA文献 >Computing recurrence coefficients of multiple orthogonal polynomials
【2h】

Computing recurrence coefficients of multiple orthogonal polynomials

机译:计算多个正交多项式的递归系数

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (r+2)-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence relation) and there is a system of r recurrence relations connecting the nearest neighbors (the so-called nearest neighbor recurrence relations). In this paper we deal with two problems. First we show how one can obtain the nearest neighbor recurrence coefficients (and in particular the recurrence coefficients of the orthogonal polynomials for each of the defining measures) from the step-line recurrence coefficients. Secondly we show how one can compute the step-line recurrence coefficients from the recurrence coefficients of the orthogonal polynomials of each of the measures defining the multiple orthogonality.
机译:多个正交多项式满足许多递归关系,尤其是存在一个(r + 2)项递归关系,将对角线附近的II型多个正交多项式连接起来(所谓的阶梯线递归关系),并且存在一个系统连接最近邻居的r递归关系(所谓的最近邻居递归关系)。在本文中,我们处理两个问题。首先,我们说明如何从阶梯线递归系数中获得最接近的邻居递归系数(尤其是每个定义量度的正交多项式的递归系数)。其次,我们展示了如何从定义多重正交性的每个量度的正交多项式的递归系数中计算出阶梯递归系数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号