A Class of Globally Convergent Iteration Functions for the Solution of Polynomial Equations

DOI10.2307/2004275zbMath0143.37201OpenAlexW4230989267MaRDI QIDQ5519481

J. F. Traub

Publication date: 1966

Full work available at URL: https://doi.org/10.2307/2004275

zbMATH Keywords

numerical analysis

Related Items

A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications, Highly unique network descriptors based on the roots of the permanental polynomial, A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, On a companion operator for analytic functions, On a companion operator for analytic functions, Convergence analysis on a second order algorithm for orthogonal projection onto curves, Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface, Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Das Verfahren der abgekürzten Iteration für algebraische Eigenwertprobleme, insbesondere zur Nullstellenbestimmung eines Polynoms
• A method for approximating the zeros of analytic functions
• Some iterative methods for determining zeros of functions of a complex variable
• On the Solution of Algebraic Equations
• Solution of linear difference and differential equations
• Generalized Sequences with Applications to the Discrete Calculus
• On Lagrange-Hermite Interpolation
• Associated Polynomials and Uniform Methods for the Solution of Linear Problems
• A Type of Variation on Newton's Method
• Some numerical methods for locating roots of polynomials