Peter Kirrinnis

Learn More
The subject of this paper is fast numerical algorithms for factoring univariate polynomials with complex coefficients and for computing partial fraction decompositions (PFDs) of rational functions in C(z). Numerically stable and computationally feasible versions of PFD are specified first for the special case of rational functions with all singularities in(More)
In this paper the problem of computing the numerical value of the integral (P q(z)/p(z)dz, where q and p are polynomials, .-. given by their coefficients, and 17is a curve in the complex plane, is investigated from the point of view of (serial) bit coraplezity, i.e., finite precision arithmetic is used. The first algorithm presented computes this integral(More)
  • 1