We present a novel method for calculating Pad\'e approximants that is capable of eliminating spurious poles placed at the point of development and of identifying and eliminating spurious poles created by precision limitations and/or noisy coefficients. Information contained in in the eliminated poles is assimilated producing a reduced order Pad\'e approximant (PA). While the [m+k/m] conformation produced by the algorithm is flexible, the m value of the rational approximant produced by the algorithm reported here is determined by the number of spurious poles eliminated. Spurious poles due to coefficient noise/precision limitations are identified using an evidence-based filter parameter applied to the singular values of a matrix comprised of the series coefficients. The rational function poles are found directly by solving a generalized eigenvalue problem defined by a matrix pencil. Spurious poles place at the point of development, responsible in some algorithms for degeneracy, are identified by their magnitudes. Residues are found by solving an overdetermined linear matrix equation. The method is compared with the so-called Robust Pad\'e Approximation (RPA) method and shown to be competitive on the problems studied. By eliminating spurious poles, particularly in functions with branch points, such as those encountered solving the power-flow problem, solution of these complex-valued problems is made more reliable.
翻译:我们提出了一种新型方法,用于计算pad\'e approstomants(pad\'e aproximant(PA)),该方法能够消除在发展点放置的虚假极,并查明和消除精确限制和(或)噪音系数产生的虚假极。被消除的极中所含的信息被同化,产生一个缩略顺序Pad\'e apoloximant(PA) (PA) 。虽然算法产生的[m+k/m]相符合性是灵活的,但此处所报告算法产生的理性正方程式的米值取决于被消除的假极数。由于系数噪音/精度限制而形成的纯极使用一个基于证据的过滤器参数,用于由序列系数组成的矩阵单数的单值。理性函数直接通过解决由矩阵铅笔界定的普遍偏差值问题而找到。在开发点的[m+k/m] 纯极位置,对一些对脱色性算法负责的数值根据其规模确定。通过解决一个定的线性矩阵方方方程式方程式等而发现。该方法与所谓的Brust-rust 比较具有竞争力,在研究的解决这些分中显示的平流问题,这些方法,这些方法是这些冲式的,这些冲式式式的解式的解式式式式式的解式方法。