Fast Algorithms for Partial Fraction Decomposition

DOI10.1137/0206042MaRDI QIDQ4133118zbMATH OpenOpenAlexWikidataFDO

Authors H. T. Kung, D. M. 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)

Cited in

(13)

• Important algebraic calculations for \(n\)-variables polynomial codes
• Fast Hensel's lifting implementation using partial fraction decomposition
• The equivalence of decimation in time and decimation in frequency in FFT computations
• \(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\)
• A fast algorithm for computing the number of magic series
• Efficient recursive methods for partial fraction expansion of general rational functions
• Filtering, prediction and simulation methods for noncausal processes
• scientific article; zbMATH DE number 3687497 (Why is no real title available?)
• A fully discrete high-order fast multiscale Galerkin method for solving boundary integral equations in a domain with corners
• Polynomial algebra for Birkhoff interpolants
• \texttt{LinApart}: optimizing the univariate partial fraction decomposition
• Computing discrete residues of rational functions
• A computational approach to rational summability and its applications via discrete residues

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133118)