Cited in
(6)- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials
- When are two numerical polynomials relatively prime?
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm
- Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method
- High order analysis of the limit cycle of the van der Pol oscillator
- A lookahead algorithm for the solution of block Toeplitz systems
This page was built for software: VECTOR_PADE
