Efficient recursive methods for partial fraction expansion of general rational functions (Q2336814): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/jam/MaYW14, #quickstatements; #temporary_batch_1731530891435
 
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jam/MaYW14 / rank
 
Normal rank

Latest revision as of 22:17, 13 November 2024

scientific article
Language Label Description Also known as
English
Efficient recursive methods for partial fraction expansion of general rational functions
scientific article

    Statements

    Efficient recursive methods for partial fraction expansion of general rational functions (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    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.
    0 references

    Identifiers