Pages that link to "Item:Q4069694"
From MaRDI portal
The following pages link to Principles for Testing Polynomial Zerofinding Programs (Q4069694):
Displaying 27 items.
- A parallel algorithm for simple roots of polynomials (Q762886) (← links)
- A fast implicit QR eigenvalue algorithm for companion matrices (Q848584) (← links)
- A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
- Some parallel methods for polynomial root-finding (Q1091080) (← links)
- An analytic approach to the solution of non-linear equations (Q1096327) (← links)
- On the numerical condition of polynomials in Bernstein form (Q1098225) (← links)
- Algorithms for polynomials in Bernstein form (Q1105314) (← links)
- Fast parallel algorithms for Graeffe's root squaring technique (Q1129507) (← links)
- Parallel square-root iterations for multiple roots (Q1140408) (← links)
- Families of algebraic test equations (Q1143751) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- Polynomial zerofinding iterative matrix algorithms (Q1343560) (← links)
- Polynomial root computation by means of the LR algorithm (Q1359970) (← links)
- A real QZ algorithm for structured companion pencils (Q1697282) (← links)
- A composite polynomial zerofinding matrix algorithm (Q1903777) (← links)
- An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros (Q1917920) (← links)
- Fast QR iterations for unitary plus low rank matrices (Q2288368) (← links)
- An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
- On efficient two-parameter methods for solving nonlinear equations (Q2391884) (← links)
- An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli (Q2447014) (← links)
- Method for finding multiple roots of polynomials (Q2507024) (← links)
- An algorithm for the total, or partial, factorization of a polynomial (Q4151651) (← links)
- Determination of zeros of polynomials by synthetic division † (Q4181192) (← links)
- Checking properties of polynomials (Q4571953) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Fast and Backward Stable Computation of Roots of Polynomials (Q5265003) (← links)
- A CMV-Based Eigensolver for Companion Matrices (Q5502142) (← links)
