Zur iterativen Auflösung algebraischer Gleichungen

Cited in

(23)

On using symmetric polynomials for constructing root finding methods
An effective implementation of a modified Laguerre method for the roots of a polynomial
Traub's accelerating generator of iterative root-finding methods
Comments on some recent methods for the simultaneous determination of polynomial zeros
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
On some simultaneous methods based on Weierstrass' correction
On initial conditions for the convergence of simultaneous root finding methods
Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators
A family of simultaneous zero-finding methods
A posteriori error bounds for the zeros of polynomials
Construction of zero-finding methods by Weierstrass functions
Point estimation of simultaneous methods for solving polynomial equations: A survey
New algorithms for solving nonlinear eigenvalue problems
Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
Point estimation and some applications to iterative methods
Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
On the efficiency of some combined methods for polynomial complex zeros
A family of simultaneous methods for the determination of polynomial complex zeros
On the construction of simultaneous methods for multiple zeros
On the convergence order of a modified method for simultaneous finding polynomial zeros
The self-validated method for polynomial zeros of high efficiency
On the R-order of some accelerated methods for the simultaneous finding of polynomial zeros
An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction

This page was built for publication: Zur iterativen Auflösung algebraischer Gleichungen

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