On the convergence of the multivariate ``homogeneous qd-algorithm
From MaRDI portal
Publication:1347074
The convergence theorem of the multivariate homogeneous qd-algorithm is proved exploiting an analogous theorem of the univariate theory. The homogeneous form detects polar singularities ``pointwise. The convergence result is compared to a similar theorem for the general order multivariate qdg-algorithm, which detects the above singularities ``curvewise.
Recommendations
- The QD-algorithm and multivariate Padé-approximants
- A multivariate QD-like algorithm
- On convergence of a stochastic quasigradient algorithm of quantile optimization
- scientific article; zbMATH DE number 1361288
- On the convergence of the QR algorithm with multishift
- scientific article; zbMATH DE number 953050
- Convergence of the tridiagonal QR algorithm
- Convergence of the QR algorithm
- scientific article; zbMATH DE number 3898617
- The convergence of multi-shift QR algorithm for symmetric matrices
Cites work
Cited in
(5)- scientific article; zbMATH DE number 1361288 (Why is no real title available?)
- Adapted multivariate Padé approximation
- scientific article; zbMATH DE number 953050 (Why is no real title available?)
- Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate
- On the calculation of the poles of multivariate meromorphic functions using the symbolic-numeric two-point qd-algorithm
This page was built for publication: On the convergence of the multivariate ``homogeneous qd-algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1347074)
