scientific article; zbMATH DE number 3279131
From MaRDI portal
Publication:5563347
zbMath0175.00104MaRDI QIDQ5563347
No author found.
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Algebraic complexity of computing polynomial zeros ⋮ Sequential and parallel complexity of approximate evaluation of polynomial zeros ⋮ Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ A root-finding algorithm based on Newton's method ⋮ A parallel Wilf algorithm for complex zeros of a polynomial ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗ ⋮ Root finding of polynomials as an initial value problem
This page was built for publication:
