A modified Newton method for polynomials
From MaRDI portal
Publication:5527440
DOI10.1145/363067.363115zbMath0148.39004OpenAlexW2025026078WikidataQ61908528 ScholiaQ61908528MaRDI QIDQ5527440
Publication date: 1967
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363067.363115
Related Items
ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS, ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS, On comparison of annuli containing all the zeros of a polynomial, Family of simultaneous methods of Hansen--Patrick's type, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Point estimation of simultaneous methods for solving polynomial equations: A survey. II., Some parallel methods for polynomial root-finding, Initial approximations in Durand-Kerner's root finding method, Solving certain queueing problems modelled by Toeplitz matrices, On a cubically convergent derivative-free root finding method, On a modification of the Koenig theorem, A highly efficient root-solver of very fast convergence, Generalization and variations of Pellet's theorem for matrix polynomials, A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros, The Durand-Kerner polynomials roots-finding method in case of multiple roots, Lower bounds for the \(R\)-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods, On the local convergence of Ehrlich method for numerical computation of polynomial zeros, On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation, On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros, Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials, Iterative schemes for finding all roots simultaneously of nonlinear equations, 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, On initial conditions for the convergence of simultaneous root finding methods, On a high-order one-parameter family for the simultaneous determination of polynomial roots, A family of simultaneous zero-finding methods, Point estimation and some applications to iterative methods, A general method to generate parallel iterations for finding all zeros of polynomial simultaneously, Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method, 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, 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, On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic, Efficient polynomial root-refiners: a survey and new record efficiency estimates, Simultaneous roots for vectorial problems, On using symmetric polynomials for constructing root finding methods, Geometry of polynomials and root-finding via path-lifting, On the efficiency of some combined methods for polynomial complex zeros, The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros, Finding polynomial roots by dynamical systems -- a case study, On an iterative method for simultaneous inclusion of polynomial complex zeros, A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial, On the convergence order of a modified method for simultaneous finding polynomial zeros, How to count the number of zeros that a polynomial has on the unit circle?, On region containing all the zeros of a polynomial, A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods, On the generalization of the Alefeld-Herzberger's method, Numerical computation of polynomial zeros by means of Aberth's method, On new higher order families of simultaneous methods for finding polynomial zeros, The convergence of a class of parallel Newton-type iterative methods, Annular bounds for the zeros of a polynomial, 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, Traub's accelerating generator of iterative root-finding methods, On a modification of Chebyshev's method, The convergence of a family of parallel zero-finding methods, An iteration formula for the simultaneous determination of the zeros of a polynomial, On the improved Newton-like methods for the inclusion of polynomial zeros, Point estimation of simultaneous methods for solving polynomial equations: A survey, An algorithm for the total, or partial, factorization of a polynomial, Accelerating generators of iterative methods for finding multiple roots of nonlinear equations, On Geometry of the Zeros of a Polynomial, Iteration functions re-visited, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Computational efficiency of some combined methods for polynomial equations, An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial, Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation, On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros, The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, The self-validated method for polynomial zeros of high efficiency, Some simultaneous iterations for finding all zeros of a polynomial with high order convergence, 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, An Algorithm for Quadratic Eigenproblems with Low Rank Damping, On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial. II, On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial, A family of simultaneous methods for the determination of polynomial complex zeros, On an efficient simultaneous method for finding polynomial zeros, An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction, Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders, Coefficient-free adaptations of polynomial root-finders, A modified Newton method in parallel circular iteration of single-step and double-step, On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously, Comments on some recent methods for the simultaneous determination of polynomial zeros
