Iterative methods for multiple zeros of a polynomial by clustering
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- A note on some improvements of the simultaneous methods for determination of polynomial zeros
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
Cited in
(8)- Zero-clusters of polynomials: best approach in supercomputing era
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- Simultaneous factorization of a polynomial by rational approximation
- scientific article; zbMATH DE number 1254284 (Why is no real title available?)
- Multiplicity estimating algorithm for zeros of a complex polynomial and its applications
- Balanced convergence of iterative methods to a multiple zero of a complex polynomial
- Computing multiple roots of inexact polynomials
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
This page was built for publication: Iterative methods for multiple zeros of a polynomial by clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824355)