On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm
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.
- scientific article; zbMATH DE number 1639652
- On the convergence of the multivariate ``homogeneous qd-algorithm
- Calculation of poles of meromorphic functions with q-d, r-s and \(\epsilon\)-algorithms. Acceleration of these processes
- Floating-point versus symbolic computations in the qd-algorithm
- Singular rules for a multivariate quotient-difference algorithm
- \(qd\) block algorithm
- Der Quotienten-Differenzen-Algorithmus
- Generalized \(qd\) algorithm for block band matrices
- scientific article; zbMATH DE number 1639652 (Why is no real title available?)
- scientific article; zbMATH DE number 4049531 (Why is no real title available?)
- scientific article; zbMATH DE number 46780 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 1361288 (Why is no real title available?)
- Multivariate homogeneous two-point Padé approximants
- On certain applications of two-point Padé type approximants with a single pole
- On the convergence of the multivariate ``homogeneous qd-algorithm
- On the convergence of two-point Padé-type approximants
- On two-point Padé-type and two-point Padé approximants
- Padé-type approximation and general orthogonal polynomials
- Properties of multivariate homogeneous orthogonal polynomials
- Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate
- Stability of general two-dimensional recursive digital filters
- Stable multi-dimensional model reduction and IIR filter design
- Calculation of poles of meromorphic functions with q-d, r-s and \(\epsilon\)-algorithms. Acceleration of these processes
- Floating-point versus symbolic computations in the qd-algorithm
- Two-dimensional generalization of the Rutishauser qd-algorithm
- scientific article; zbMATH DE number 1361288 (Why is no real title available?)
- scientific article; zbMATH DE number 1361305 (Why is no real title available?)
- scientific article; zbMATH DE number 672004 (Why is no real title available?)
- Numerical recovery of location and residue of poles of meromorphic functions
This page was built for publication: On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780406)