A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
From MaRDI portal
Publication:4069691
DOI10.1007/BF01933657zbMath0311.65036MaRDI QIDQ4069691
No author found.
Publication date: 1975
Published in: BIT (Search for Journal in Brave)
Related Items
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 Schröder's families of root-finding methods, A note on a paper by G.Pólya, The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros, On the convergence order of a modified method for simultaneous finding polynomial zeros, Approximate GCD and its application to ill-conditioned algebraic equations, A high-order iterative formula for simultaneous determination of zeros of a polynomial, The improved Farmer–Loizou method for finding polynomial zeros, On the rediscovery of Halley's iterative method for computing the zero of an analytic function, Higher-order iteration functions for simultaneously approximating polynomial zeros, Comments on a root finding method using Padé approximation, An algorithm for the total, or partial, factorization of a polynomial, Iteration functions re-visited, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, A method for computing all the zeros of a polynomial with real coefficients, An iteration method with maximal order based on standard information, On rediscovered iteration methods for solving equations, A family of simultaneous methods for the determination of polynomial complex zeros, Two observations on Durand-Kerner's root-finding method, An algorithm for the computation of zeros of a special class of entire functions, Locating multiple zeros interactively
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A posteriori error bounds for the zeros of polynomials
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- Circular arithmetic and the determination of polynomial zeros
- Roots of equations by functional iteration
- A Machine Method for Solving Polynomial Equations
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- A modified Newton method for polynomials
- Certain modifications of Newton's method for the approximate solution of algebraic equations
- On Lehmer's Method for Finding the Zeros of a Polynomial
- Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
