Fast computation of contour integrals of rational functions

DOI10.1006/jcom.1999.0531zbMath0948.65020OpenAlexW1993200051MaRDI QIDQ1977145

Peter Kirrinnis

Publication date: 22 June 2000

Published in: Journal of Complexity (Search for Journal in Brave)

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

zbMATH Keywords

algorithmcontour integralrational functionfast algorithmLaurent seriespartial fraction decompositionbit complexityrunning timeclusters of roots

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Integration, integrals of Cauchy type, integral representations of analytic functions in the complex plane (30E20) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
• Asymptotic behavior of automatic quadrature
• The Arithmetic-Geometric Mean and Fast Computation of Elementary Functions

This page was built for publication: Fast computation of contour integrals of rational functions