The polynomial pivots as initial values for a new root-finding iterative method

DOI10.1155/2015/413816zbMath1435.65074OpenAlexW1991929681WikidataQ59111827 ScholiaQ59111827MaRDI QIDQ2336929

Yanyan Li

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/413816

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (1)

Critical damping in nonviscously damped linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• Three-point methods with and without memory for solving nonlinear equations
• The point zoro symmetric single-step procedure for simultaneous estimation of polynomial zeros
• New progress in real and complex polynomial root-finding
• The guaranteed convergence of Laguerre-like method
• A supplementary bibliography: on roots of polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Choosing starting values for certain Newton-Raphson iterations
• Numerical methods for roots of polynomials. Part I
• A family of simultaneous zero-finding methods
• A family of root finding methods
• A bibliography on roots of polynomials
• A 2002 update of the supplementary bibliography on roots of polynomials
• Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
• Improved initialization of the accelerated and robust QR-like polynomial root-finding
• Point estimation of a family of simultaneous zero-finding methods
• An updated supplementary bibliography on roots of polynomials
• On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step
• Initial approximations in Euler-Chebyshev's method
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Computation of eigenvalues in proportionally damped viscoelastic structures based on the fixed-point iteration
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• A family of root-finding methods with accelerated convergence
• 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
• The fundamental theorem of algebra and complexity theory
• Solving a Polynomial Equation: Some History and Recent Progress
• Finding zeros of a polynomial by the Q-D algorithm
• Mean Value Theorems for Vector Valued Functions
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• How to find all roots of complex polynomials by Newton's method.

This page was built for publication: The polynomial pivots as initial values for a new root-finding iterative method