|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||From quotient-difference to generalized eigenvalues and sparse polynomial interpolation|
|Citation:||Lee W (2007) From quotient-difference to generalized eigenvalues and sparse polynomial interpolation. In: SNC '07 Proceedings of the 2007 international workshop on Symbolic-numeric computation. Symbolic-Numeric Computation 2007 (SNC 2007), London, Ontario, Canada, 25.07.2007-27.07.2007. New York: ACM, pp. 110-116. https://dl.acm.org/citation.cfm?id=1277518|
|Conference Name:||Symbolic-Numeric Computation 2007 (SNC 2007)|
|Conference Dates:||2007-07-25 - 2007-07-27|
|Conference Location:||London, Ontario, Canada|
|Abstract:||The numerical quotient-difference algorithm, or the qd-algorithm , can be used for determining the poles of a meromorphic function directly from its Taylor coefficients. 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.|
|Status:||VoR - Version of Record|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Lee07.pdf||Fulltext - Published Version||224.91 kB||Adobe PDF||Under Permanent Embargo Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.