Principles for Testing Polynomial Zerofinding Programs
From MaRDI portal
Publication:4069694
DOI10.1145/355626.355632zbMath0311.65039OpenAlexW2069524360WikidataQ113767826 ScholiaQ113767826MaRDI QIDQ4069694
Publication date: 1975
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355626.355632
Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)
Related Items
Some parallel methods for polynomial root-finding, Polynomial zerofinding iterative matrix algorithms, An analytic approach to the solution of non-linear equations, On the numerical condition of polynomials in Bernstein form, A fast implicit QR eigenvalue algorithm for companion matrices, Algorithms for polynomials in Bernstein form, Polynomial root computation by means of the LR algorithm, A composite polynomial zerofinding matrix algorithm, On efficient two-parameter methods for solving nonlinear equations, Checking properties of polynomials, An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros, Fast parallel algorithms for Graeffe's root squaring technique, Parallel square-root iterations for multiple roots, Families of algebraic test equations, A real QZ algorithm for structured companion pencils, An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli, Computing multiple roots of inexact polynomials, A study of accelerated Newton methods for multiple polynomial roots, An algorithm for the total, or partial, factorization of a polynomial, Method for finding multiple roots of polynomials, Fast QR iterations for unitary plus low rank matrices, Bibliography on the evaluation of numerical software, Determination of zeros of polynomials by synthetic division †, A parallel algorithm for simple roots of polynomials, A CMV-Based Eigensolver for Companion Matrices, An effective implementation of a modified Laguerre method for the roots of a polynomial, Fast and Backward Stable Computation of Roots of Polynomials
