Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
Introduction to numerical analysis: 2nd edition
Introduction to numerical analysis: 2nd edition
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIAM Journal on Scientific Computing
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
A Stable Numerical Method for Inverting Shape from Moments
SIAM Journal on Scientific Computing
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Sparse multivariate polynomial interpolation via the quotient-difference algorithm
ACM Communications in Computer Algebra
Reconstructing sparse trigonometric functions
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
The numerical quotient-difference algorithm,or the qd-algorithm, can be used for determining the poles of a meromorphic function directly from its Taylor coeffcients. We show that the poles computed in the qd-algorithm, regardless of their multiplicities,are converging to the solution of a generalized eigenvalue problem. In a special case when all the poles are simple,such generalized eigenvalue problem can be viewed as a reformulation of Prony 's method,a method that is closely related to the Ben-Or/Tiwari algorithm for interpolating a multivariate sparse polynomial in computer algebra.