Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
From MaRDI portal
Publication:4768561
DOI10.2307/2005621zbMath0282.65037WikidataQ61908529 ScholiaQ61908529MaRDI QIDQ4768561
Publication date: 1973
Full work available at URL: https://doi.org/10.2307/2005621
65H05: Numerical computation of solutions to single equations
30C10: Polynomials and rational functions of one complex variable
65D99: Numerical approximation and computational geometry (primarily algorithms)
Related Items
Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, Point estimation of simultaneous methods for solving polynomial equations: A survey, Durand-Kerner method for the real roots, Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros, Numerical computation of polynomial zeros by means of Aberth's method, Relations between roots and coefficients, interpolation and application to system solving, A parallel algorithm for simple roots of polynomials, Two observations on Durand-Kerner's root-finding method, Coefficient-free adaptations of polynomial root-finders, Computing curve intersection by means of simultaneous iterations, Construction of zero-finding methods by Weierstrass functions, An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations, Suboptimal Kronrod extension formulae for numerical quadrature, On new higher order families of simultaneous methods for finding polynomial zeros, Accelerating generators of iterative methods for finding multiple roots of nonlinear equations, The self-validated method for polynomial zeros of high efficiency, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial, A note on some improvements of the simultaneous methods for determination of polynomial zeros, Computing roots of polynomials on vector processing machines, Practical problems arising for finding roots of nonlinear equations, Some parallel methods for polynomial root-finding, The Durand-Kerner method for trigonometric and exponential polynomials, Solving systems of algebraic equations by a general elimination method, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, A family of simultaneous zero-finding methods, On an iterative method for simultaneous inclusion of polynomial complex zeros, A high-order iterative formula for simultaneous determination of zeros of a polynomial, Balanced convergence of iterative methods to a multiple zero of a complex polynomial, A hybrid approach for the integration of a rational function, On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros, An iteration formula for the simultaneous determination of the zeros of a polynomial, Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Solving multivariate algebraic equation by Hensel construction, An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction, Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems, Solving certain queueing problems modelled by Toeplitz matrices, A note on the convergence of the Weierstrass SOR method for polynomial roots, Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation, Polynomial root finding by means of continuation, Point estimation and some applications to iterative methods, A method for finding the zeros of polynomials using a companion matrix., Comments on some recent methods for the simultaneous determination of polynomial zeros, The convergence of a family of parallel zero-finding methods, Multiplicity estimating algorithm for zeros of a complex polynomial and its applications, Iterative methods for multiple zeros of a polynomial by clustering, Family of simultaneous methods of Hansen--Patrick's type, Relationships between order and efficiency of a class of methods for multiple zeros of polynomials, Simultaneous factorization of a polynomial by rational approximation, Finding roots of a real polynomial simultaneously by means of Bairstow's method, Optimal and nearly optimal algorithms for approximating polynomial zeros, On some methods for the simultaneous determination of polynomial zeros, On some simultaneous methods based on Weierstrass' correction, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials, Point estimation of simultaneous methods for solving polynomial equations: A survey. II., Complexity of real root isolation using continued fractions, A highly efficient root-solver of very fast convergence, A posteriori error bound methods for the inclusion of polynomial zeros, Stability of IMEX Runge-Kutta methods for delay differential equations, A family of root-finding methods with accelerated convergence, An efficient higher order family of root finders, Computational efficiency of some combined methods for polynomial equations, The Durand-Kerner polynomials roots-finding method in case of multiple roots, Real arithmetic versions of simultaneous iteration methods for polynomial root finding, A method for computing all the zeros of a polynomial with real coefficients, An algorithm for the total, or partial, factorization of a polynomial
Cites Work
