Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
From MaRDI portal
Publication:4044060
DOI10.1137/0711083zbMath0292.65024OpenAlexW2085828026MaRDI QIDQ4044060
Publication date: 1974
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0711083
Related Items
Relaxed NewtonSLRA for approximate GCD, Polynomial zerofinding iterative matrix algorithms, A composite polynomial zerofinding matrix algorithm, Trajectory-following methods for large-scale degenerate convex quadratic programming, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, Approximate square-free part and decomposition, Numerical computation of polynomial zeros by means of Aberth's method, Toward the best algorithm for approximate GCD of univariate polynomials, A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis, An algorithm for the total, or partial, factorization of a polynomial, Determination of zeros of polynomials by synthetic division †, Locating multiple zeros interactively
