Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
From MaRDI portal
Publication:4768561
DOI10.2307/2005621zbMath0282.65037OpenAlexW4230809322WikidataQ61908529 ScholiaQ61908529MaRDI QIDQ4768561
Publication date: 1973
Full work available at URL: https://doi.org/10.2307/2005621
Numerical computation of solutions to single equations (65H05) Polynomials and rational functions of one complex variable (30C10) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items
Family of simultaneous methods of Hansen--Patrick's type, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, 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, Computing roots of polynomials on vector processing machines, Practical problems arising for finding roots of nonlinear equations, Point estimation of simultaneous methods for solving polynomial equations: A survey. II., Some parallel methods for polynomial root-finding, The Durand-Kerner method for trigonometric and exponential polynomials, Solving certain queueing problems modelled by Toeplitz matrices, 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, Relationships between order and efficiency of a class of methods for multiple zeros of polynomials, On the local convergence of Ehrlich method for numerical computation of polynomial zeros, Solving systems of algebraic equations by a general elimination method, A note on the convergence of the Weierstrass SOR method for polynomial roots, Simultaneous factorization of a polynomial by rational approximation, On efficient two-parameter methods for solving nonlinear equations, Computing curve intersection by means of simultaneous iterations, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation, On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously, On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation, Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation, Finding roots of a real polynomial simultaneously by means of Bairstow's method, Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials, Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros, Polynomial root finding by means of continuation, Optimal and nearly optimal algorithms for approximating polynomial zeros, A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously, On some methods for the simultaneous determination of polynomial zeros, Construction of zero-finding methods by Weierstrass functions, On some simultaneous methods based on Weierstrass' correction, A family of simultaneous zero-finding methods, Point estimation and some applications to iterative methods, Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method, A new family of adaptive methods with memory for solving nonlinear equations, Torus partition function of the six-vertex model from algebraic geometry, Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods, Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering, Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros, The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis, Efficient polynomial root-refiners: a survey and new record efficiency estimates, A fitting algorithm for real coefficient polynomial rooting, An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations, The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros, Suboptimal Kronrod extension formulae for numerical quadrature, On an iterative method for simultaneous inclusion of polynomial complex zeros, A method for finding the zeros of polynomials using a companion matrix., How to count the number of zeros that a polynomial has on the unit circle?, On region containing all the zeros of a polynomial, Computer visualization and dynamic study of new families of root-solvers, A high-order iterative formula for simultaneous determination of zeros of a polynomial, On a family of Weierstrass-type root-finding methods with accelerated convergence, Balanced convergence of iterative methods to a multiple zero of a complex polynomial, Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications, Numerical computation of polynomial zeros by means of Aberth's method, On new higher order families of simultaneous methods for finding polynomial zeros, A hybrid approach for the integration of a rational function, Annular bounds for the zeros of a polynomial, Stability of IMEX Runge-Kutta methods for delay differential equations, A family of root-finding methods with accelerated convergence, Solving secular and polynomial equations: a multiprecision algorithm, On the simultaneous refinement of the zeros of H-palindromic polynomials, Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions, On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros, An efficient higher order family of root finders, Relations between roots and coefficients, interpolation and application to system solving, On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros, On the new fourth-order methods for the simultaneous approximation of polynomial zeros, The convergence of a family of parallel zero-finding methods, An iteration formula for the simultaneous determination of the zeros of a polynomial, Accelerating generators of iterative methods for finding multiple roots of nonlinear equations, On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Computational efficiency of some combined methods for polynomial equations, Multiplicity estimating algorithm for zeros of a complex polynomial and its applications, On the guaranteed convergence of new two-point root-finding methods for polynomial zeros, 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}\)], A parallel algorithm for simple roots of polynomials, The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem, Iterative methods for multiple zeros of a polynomial by clustering, The self-validated method for polynomial zeros of high efficiency, On dynamics of iterative techniques for nonlinear equation with applications in engineering, On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial, Cylinder partition function of the 6-vertex model from algebraic geometry, A note on some improvements of the simultaneous methods for determination of polynomial zeros, An effective implementation of a modified Laguerre method for the roots of a polynomial, Solving multivariate algebraic equation by Hensel construction, Two observations on Durand-Kerner's root-finding method, On an efficient simultaneous method for finding polynomial zeros, A topology optimisation of acoustic devices based on the frequency response estimation with the Padé approximation, 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, Coefficient-free adaptations of polynomial root-finders, On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously, A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously, Comments on some recent methods for the simultaneous determination of polynomial zeros, ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS, On comparison of annuli containing all the zeros of a polynomial, Scaled parallel iterative method for finding real roots of nonlinear equations, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Generalization and variations of Pellet's theorem for matrix polynomials, The Durand-Kerner polynomials roots-finding method in case of multiple roots, On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots, A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence, Characterizations of the maximum likelihood estimator of the Cauchy distribution, ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS, On using symmetric polynomials for constructing root finding methods, Geometry of polynomials and root-finding via path-lifting, Real arithmetic versions of simultaneous iteration methods for polynomial root finding, Point estimation of simultaneous methods for solving polynomial equations: A survey, An algorithm for the total, or partial, factorization of a polynomial, On Geometry of the Zeros of a Polynomial, Durand-Kerner method for the real roots, A method for computing all the zeros of a polynomial with real coefficients, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, An Algorithm for Quadratic Eigenproblems with Low Rank Damping, Computer tools for the construction and analysis of some efficient root-finding simultaneous methods, Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders
Cites Work
