Principles for Testing Polynomial Zerofinding Programs

Cited In (27)

An effective implementation of a modified Laguerre method for the roots of a polynomial
A study of accelerated Newton methods for multiple polynomial roots
Bibliography on the evaluation of numerical software
Fast QR iterations for unitary plus low rank matrices
An analytic approach to the solution of non-linear equations
On efficient two-parameter methods for solving nonlinear equations
A fast implicit QR eigenvalue algorithm for companion matrices
On the numerical condition of polynomials in Bernstein form
Algorithms for polynomials in Bernstein form
Fast parallel algorithms for Graeffe's root squaring technique
Polynomial zerofinding iterative matrix algorithms
A composite polynomial zerofinding matrix algorithm
An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
An algorithm for the total, or partial, factorization of a polynomial
Families of algebraic test equations
Polynomial root computation by means of the LR algorithm
A CMV-Based Eigensolver for Companion Matrices
A parallel algorithm for simple roots of polynomials
Method for finding multiple roots of polynomials
Some parallel methods for polynomial root-finding
Determination of zeros of polynomials by synthetic division †
Fast and Backward Stable Computation of Roots of Polynomials
Checking properties of polynomials
Computing multiple roots of inexact polynomials
A real QZ algorithm for structured companion pencils
Parallel square-root iterations for multiple roots
An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli

This page was built for publication: Principles for Testing Polynomial Zerofinding Programs

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