Numerics of analytic functions and complexity
From MaRDI portal
Publication:1812812
zbMath0797.68090MaRDI QIDQ1812812
Publication date: 25 June 1992
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
rational functionspower serieselementary functionsevaluation functionalgebraic functionsbit complexityinterpolation of polynomialsfactorization of complex polynomials into linear factorspartial fraction representation of rational functions
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Analytic computations (11Y35)
Related Items
On the worst-case arithmetic complexity of approximating zeros of polynomials, Effective asymptotics of linear recurrences with rational coefficients, Computing Dirichlet character sums to a power-full modulus, A fast algorithm to compute \(L(1/2, f\times \chi_q)\), A nearly-optimal method to compute the truncated theta function, its derivatives, and integrals, Fast methods to compute the Riemann zeta function, New Computations of the Riemann Zeta Function on the Critical Line, A refined model of computation for continuous problems, Estimating the extremal eigenvalues of a symmetric matrix, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Multiplication is the easiest nontrivial arithmetic function
