Efficient recursive methods for partial fraction expansion of general rational functions
From MaRDI portal
Publication:2336814
DOI10.1155/2014/895036zbMath1442.65013DBLPjournals/jam/MaYW14OpenAlexW2053142889WikidataQ59054172 ScholiaQ59054172MaRDI QIDQ2336814
Yuan Yuan Wang, Youneng Ma, Jinhua Yu
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/895036
Related Items (2)
\(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\) ⋮ Maximum of exponential random variables, Hurwitz's zeta function, and the partition function
Cites Work
- Partial fractions expansion: A review of computational methodology and efficiency
- Matrix formulation for partial -fraction expansion of transfer functions
- Incomplete partial fractions for parallel evaluation of rational matrix functions
- A cover-up approach to partial fractions with linear or irreducible quadratic factors in the denominators
- Partial fractions decompositions of some rational functions
- Partial fraction expansion without derivative evaluation
- An<tex>O(N^2)</tex>algorithm for partial fraction expansion
- Fast Algorithms for Partial Fraction Decomposition
- The Partial Fraction Expansion Problem and Its Inverse
- A Noniterative Method for the Partial Fraction Expansion of a Rational Function with High Order Poles
This page was built for publication: Efficient recursive methods for partial fraction expansion of general rational functions
