A modified Newton method for polynomials

Cited in

(only showing first 100 items - show all)

The self-validated method for polynomial zeros of high efficiency
A note on some improvements of the simultaneous methods for determination of polynomial zeros
Some parallel methods for polynomial root-finding
Initial approximations in Durand-Kerner's root finding method
Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
A family of simultaneous zero-finding methods
On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
On an iterative method for simultaneous inclusion of polynomial complex zeros
On the convergence order of a modified method for simultaneous finding polynomial zeros
On the generalization of the Alefeld-Herzberger's method
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
Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schröder's correction
Solving certain queueing problems modelled by Toeplitz matrices
On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros
Point estimation and some applications to iterative methods
A general method to generate parallel iterations for finding all zeros of polynomial simultaneously
Comments on some recent methods for the simultaneous determination of polynomial zeros
A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
The convergence of a class of parallel Newton-type iterative methods
Annular bounds for the zeros of a polynomial
The convergence of a family of parallel zero-finding methods
Family of simultaneous methods of Hansen--Patrick's type
On a modification of the Koenig theorem
Lower bounds for the \(R\)-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods
On some methods for the simultaneous determination of polynomial zeros
On some simultaneous methods based on Weierstrass' correction
On initial conditions for the convergence of simultaneous root finding methods
The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem
On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation
Iterative schemes for finding all roots simultaneously of nonlinear equations
Finding polynomial roots by dynamical systems -- a case study
How to count the number of zeros that a polynomial has on the unit circle?
Solving secular and polynomial equations: a multiprecision algorithm
On the simultaneous refinement of the zeros of H-palindromic polynomials
Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
An effective implementation of a modified Laguerre method for the roots of a polynomial
On an efficient simultaneous method for finding polynomial zeros
Eigenvalue condition numbers and pseudospectra of Fiedler matrices
Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
A highly efficient root-solver of very fast convergence
Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
On a high-order one-parameter family for the simultaneous determination of polynomial roots
Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
On region containing all the zeros of a polynomial
A family of root-finding methods with accelerated convergence
Computational efficiency of some combined methods for polynomial equations
Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
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
On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
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
On geometry of the zeros of a polynomial
On the local convergence of Ehrlich method for numerical computation of polynomial zeros
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
A family of simultaneous methods for the determination of polynomial complex zeros
A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
An algorithm for the total, or partial, factorization of a polynomial
Efficient polynomial root-refiners: a survey and new record efficiency estimates
An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros
Geometry of polynomials and root-finding via path-lifting
Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
On comparison of annuli containing all the zeros of a polynomial
On using symmetric polynomials for constructing root finding methods
On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros
An Algorithm for Quadratic Eigenproblems with Low Rank Damping
On a cubically convergent derivative-free root finding method
Traub's accelerating generator of iterative root-finding methods
On the improved Newton-like methods for the inclusion of polynomial zeros
ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
On a modification of Chebyshev's method
Point estimation of simultaneous methods for solving polynomial equations: A survey
A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
Simultaneous roots for vectorial problems
Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
A Matlab package computing simultaneous Gaussian quadrature rules for multiple orthogonal polynomials
Families of high-order simultaneous methods with several corrections
Numerical computation of polynomial zeros by means of Aberth's method
On computing the zeros of Laguerre-Sobolev polynomials
Computational aspects of simultaneous Gaussian quadrature
Jacobian-free vectorial iterative scheme to find simple several solutions simultaneously
Solving the parametric eigenvalue problem by Taylor series and Chebyshev expansion
Iteration functions re-visited
Interlacing properties of the zeros of Althammer orthogonal polynomials and their computation
Cylinder partition function of the 6-vertex model from algebraic geometry
Coefficient-free adaptations of polynomial root-finders
A modified Newton method in parallel circular iteration of single-step and double-step
Construction of zero-finding methods by Weierstrass functions

This page was built for publication: A modified Newton method for polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5527440)