scientific article; zbMATH DE number 1859220

zbMATH Open1015.65021MaRDI QIDQ4789203

Victor Y. Pan

Publication date: 23 April 2003

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmscomputational complexityPadé approximationunivariate polynomialsnumerical factorizationrootfindingGraeffe's lifting

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding 👍 👎
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots 👍 👎
• On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors 👍 👎
• Efficient absolute factorization of polynomials with parametric coefficients 👍 👎
• The approximate irreducible factorization of a univariate polynomial 👍 👎
• Towards factoring bivariate approximate polynomials 👍 👎
• Univariate polynomials 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789203)