On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm (Q780406)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm |
scientific article; zbMATH DE number 7221108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm |
scientific article; zbMATH DE number 7221108 |
Statements
On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm (English)
0 references
15 July 2020
0 references
The Rutishauser qd (quotient-difference) algorithm is first recalled in the univariate case and it is explained how it can be applied also in two-point (or Laurent expansion) case. The bivariate extension follows by setting \((x,y)=(\lambda_1 z,\lambda_2 z)\) so that the problem becomes again univariate in \(z\) but with coefficients depending on a parametric vector \(\vec{\lambda}=(\lambda_1,\lambda_2)\). After convergence one obtains parametric curves of pole locations. This property is illustrated with several numerical examples.
0 references
two-point Padé approximants
0 references
qd-algorithm
0 references
series expansions
0 references
multivariate approximation
0 references
poles
0 references
eigenvalues
0 references
meromorphic functions
0 references
0 references
0.8748139142990112
0 references
0.8216471672058105
0 references
0.7997449040412903
0 references
0.7944790720939636
0 references