Method for finding multiple roots of polynomials

DOI10.1016/j.camwa.2005.07.018zbMath1100.65045OpenAlexW2023155928MaRDI QIDQ2507024

Chang-Dau Yan, Wei-Hua Chieng

Publication date: 10 October 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.07.018

zbMATH Keywords

numerical examplesEuclidean algorithmroot findingmultiple rootapproximate GCDpolynomial GCDgreatest common divisor (GCD)zero findingapproximate divisibility

Mathematics Subject Classification ID

Related Items (6)

Polynomial GCD derived through monic polynomial subtractions ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial

Uses Software

• Mathematica
• Matlab

Cites Work

• Polynomial zerofinding iterative matrix algorithms
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• A composite polynomial zerofinding matrix algorithm
• Modern Computer Algebra
• Polynomial root finding using iterated Eigenvalue computation
• Principles for Testing Polynomial Zerofinding Programs
• Solving a Polynomial Equation: Some History and Recent Progress
• The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Method for finding multiple roots of polynomials