The Padé matrix pencil method with spurious pole information assimilation

by   Daniel Tylavsky, et al.

We present a novel method for calculating Padé 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é 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é 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.


page 1

page 2

page 3

page 4


Algorithms for the rational approximation of matrix-valued functions

A selection of algorithms for the rational approximation of matrix-value...

The Method of Gauss-Newton to Compute Power Series Solutions of Polynomial Homotopies

We consider the extension of the method of Gauss-Newton from complex flo...

Optimal Polynomial Approximation to Rational Matrix Functions Using the Arnoldi Algorithm

Given an n by n matrix A and an n-vector b, along with a rational functi...

A rational Even-IRA algorithm for the solution of T-even polynomial eigenvalue problems

In this work we present a rational Krylov subspace method for solving re...

Solving the Cauchy problem for a three-dimensional difference equation in a parallelepiped

The aim of this article is further development of the theory of linear d...

Solving Laplace problems with the AAA algorithm

We present a novel application of the recently developed AAA algorithm t...

On the Approximation of Singular Functions by Series of Non-integer Powers

In this paper, we describe an algorithm for approximating functions of t...

Please sign up or login with your details

Forgot password? Click here to reset