Numerics of analytic functions and complexity (Q1812812): Difference between revisions

Complexity in this survey means the number of bit-operations if all computations are performed numerically with binary numbers. Upper bounds are presented for various problems concerning specific analytic functions, such as: multiplication, division, multiple evaluation, and interpolation of polynomials and rational functions; composition and inversion of power series; factorization of complex polynomials into linear factors; determining the partial fraction representation of rational functions; determining power series representations of algebraic functions given implicitly by polynomial equations; evaluation of elementary functions such as exp, ln, sin, tan, etc., and evaluation of the \(\zeta\)-function.