Numerics of analytic functions and complexity (Q1812812)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerics of analytic functions and complexity |
scientific article |
Statements
Numerics of analytic functions and complexity (English)
0 references
25 June 1992
0 references
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.
0 references
bit complexity
0 references
evaluation function
0 references
interpolation of polynomials
0 references
rational functions
0 references
power series
0 references
factorization of complex polynomials into linear factors
0 references
partial fraction representation of rational functions
0 references
algebraic functions
0 references
elementary functions
0 references