T. Mark Dunster, Amparo Gil, Diego Ruiz-Antolín, Javier Segura
{"title":"Computation of the reverse generalized Bessel polynomials and their zeros","authors":"T. Mark Dunster, Amparo Gil, Diego Ruiz-Antolín, Javier Segura","doi":"10.1002/cmm4.1198","DOIUrl":null,"url":null,"abstract":"<p>It is well known that one of the most relevant applications of the reverse Bessel polynomials <math>\n <mrow>\n <msub>\n <mrow>\n <mi>θ</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msub>\n <mo>(</mo>\n <mi>z</mi>\n <mo>)</mo>\n </mrow></math> is filter design. In particular, the poles of the transfer function of a Bessel filter are basically the zeros of <math>\n <mrow>\n <msub>\n <mrow>\n <mi>θ</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msub>\n <mo>(</mo>\n <mi>z</mi>\n <mo>)</mo>\n </mrow></math>. In this article we discuss an algorithm to compute the zeros of reverse generalized Bessel polynomials <math>\n <mrow>\n <msub>\n <mrow>\n <mi>θ</mi>\n </mrow>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msub>\n <mo>(</mo>\n <mi>z</mi>\n <mo>;</mo>\n <mi>a</mi>\n <mo>)</mo>\n </mrow></math>. A key ingredient in the algorithm will be a method to compute the polynomials. For this purpose, we analyze the use of recurrence relations and asymptotic expansions in terms of elementary functions to obtain accurate approximations to the polynomials. The performance of all the numerical approximations will be illustrated with examples.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2021-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1198","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Mathematical Methods","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cmm4.1198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 2
Abstract
It is well known that one of the most relevant applications of the reverse Bessel polynomials is filter design. In particular, the poles of the transfer function of a Bessel filter are basically the zeros of . In this article we discuss an algorithm to compute the zeros of reverse generalized Bessel polynomials . A key ingredient in the algorithm will be a method to compute the polynomials. For this purpose, we analyze the use of recurrence relations and asymptotic expansions in terms of elementary functions to obtain accurate approximations to the polynomials. The performance of all the numerical approximations will be illustrated with examples.
众所周知,反贝塞尔多项式θ n (z)最相关的应用之一是滤波器设计。特别地,贝塞尔滤波器的传递函数的极点基本上是θ n (z)的零点。本文讨论了一种计算逆广义贝塞尔多项式θ n (z;A)。该算法的一个关键要素是计算多项式的方法。为此,我们分析了用初等函数的递归关系和渐近展开式来获得多项式的精确逼近。所有数值近似的性能将用实例说明。