Efficient Recursive Methods for Partial Fraction Expansion of General Rational Functions

Partial fraction expansion (pfe) is a classic technique used in many fields of pure or applied mathematics. The paper focuses on the pfe of general rational functions in both factorized and expanded form. Novel, simple, and recursive formulas for the computation of residues and residual polynomial c...

Full description

Saved in:
Bibliographic Details
Main Authors: Youneng Ma, Jinhua Yu, Yuanyuan Wang
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2014/895036
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Partial fraction expansion (pfe) is a classic technique used in many fields of pure or applied mathematics. The paper focuses on the pfe of general rational functions in both factorized and expanded form. Novel, simple, and recursive formulas for the computation of residues and residual polynomial coefficients are derived. The proposed pfe methods require only simple pure-algebraic operations in the whole computation process. They do not involve derivatives when tackling proper functions and require no polynomial division when dealing with improper functions. The methods are efficient and very easy to apply for both computer and manual calculation. Various numerical experiments confirm that the proposed methods can achieve quite desirable accuracy even for pfe of rational functions with multiple high-order poles or some tricky ill-conditioned poles.
ISSN:1110-757X
1687-0042