scientific article; zbMATH DE number 1263253

zbMath0942.68796MaRDI QIDQ4234125

Pan, Victor Y.

Publication date: 29 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Polynomial factorization through Toeplitz matrix computations, The amended DSeSC power method for polynomial root-finding, Optimal and nearly optimal algorithms for approximating polynomial zeros, Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Matrix computations and polynomial root-finding with preprocessing, Nearly optimal refinement of real roots of a univariate polynomial, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Root-finding by expansion with independent constraints, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Lifting/descending processes for polynomial zeros., Advice Coins for Classical and Quantum Computation, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, New progress in real and complex polynomial root-finding, Computation of approximate polynomial GCDs and an extension, Coefficient-free adaptations of polynomial root-finders, Real polynomial root-finding by means of matrix and polynomial iterations, Accelerated approximation of the complex roots and factors of a univariate polynomial