Fast Algorithms for Partial Fraction Decomposition

DOI10.1137/0206042zbMath0357.68036OpenAlexW2019258322WikidataQ56210195 ScholiaQ56210195MaRDI QIDQ4133118

H. T. Kung, Dian-Min Tong

Publication date: 1977

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8cdcb1df732ad144f3aad53ecf7e96d9a8de68c6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (10)

A fast algorithm for computing the number of magic series ⋮ The equivalence of decimation in time and decimation in frequency in FFT computations ⋮ Unnamed Item ⋮ A fully discrete high-order fast multiscale Galerkin method for solving boundary integral equations in a domain with corners ⋮ Polynomial algebra for Birkhoff interpolants ⋮ \(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\) ⋮ Filtering, Prediction and Simulation Methods for Noncausal Processes ⋮ Efficient recursive methods for partial fraction expansion of general rational functions ⋮ Important algebraic calculations for \(n\)-variables polynomial codes ⋮ Fast Hensel's lifting implementation using partial fraction decomposition

This page was built for publication: Fast Algorithms for Partial Fraction Decomposition