This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm for the Machine Computation of Partial-Fractions Expansion of Functions Having Multiple Poles
October 1971 (vol. 20 no. 10)
pp. 1147-1152
The partial-fractions expansion of a function F(s)/(s-a)m, m > 1, involves the computation of m coefficients, namely (1 /i!)(diF(a)/dsi), 0 = i = m-1. Wehrhahn [1] and Karni [3] have provided a method for computing these coefficients algebraically. A new approach is taken here which involves approximating a multiple pole by neighboring simple poles. The theory deve
Index Terms:
Discrete Fourier transform (DFT), fast Fourier transform (FFT), multiple pole, partial-fractions expansion.
Citation:
S.S. Godbole, "An Algorithm for the Machine Computation of Partial-Fractions Expansion of Functions Having Multiple Poles," IEEE Transactions on Computers, vol. 20, no. 10, pp. 1147-1152, Oct. 1971, doi:10.1109/T-C.1971.223099
Usage of this product signifies your acceptance of the Terms of Use.