scientific article; zbMATH DE number 3309631
From MaRDI portal
zbMath0194.46902MaRDI QIDQ5590393
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Root radii and subdivision for polynomial root-finding, On the worst-case arithmetic complexity of approximating zeros of polynomials, Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain, Optimal and nearly optimal algorithms for approximating polynomial zeros, A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial, Computational complexity of real functions, Computing the real roots of a polynomial by the exclusion algorithm, Fehlerschranken zu Näherungswerten von Polynomwurzeln, Circular arithmetic and the determination of polynomial zeros, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, New Practical Advances in Polynomial Root Clustering
