Higher-order iteration functions for simultaneously approximating polynomial zeros
From MaRDI portal
Publication:3311583
Cites work
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
- An algorithm for the total, or partial, factorization of a polynomial
- scientific article; zbMATH DE number 3786064 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3437326 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Lower bounds for the Perron root of a non-negative irreducible matrix
- Multiple solutions of nonlinear equations: Roots of polynomials
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- Über Simultanverfahren zur Bestimmung reeller Polynomwurzeln
Cited in
(4)- On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
This page was built for publication: Higher-order iteration functions for simultaneously approximating polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3311583)
