New Structured Matrix Methods for Real and Complex Polynomial\n Root-finding

2013/11/23 by Victor Y. Pan, Pan, Victor Y., Ai-Long Zheng +1
Computer Science · #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical Methods and Algorithms #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1311.6077

openalex publication_date 2013/11/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

We combine the known methods for univariate polynomial root-finding and for\ncomputations in the Frobenius matrix algebra with our novel techniques to\nadvance numerical solution of a univariate polynomial equation, and in\nparticular numerical approximation of the real roots of a polynomial. Our\nanalysis and experiments show efficiency of the resulting algorithms.\n

Citations

• Rank-revealing 𝑄𝑅 factorizations and the singular value decomposition

Related

• Novel Approach to Real Polynomial Root-finding and Matrix Eigen-solving
• Real Polynomial Root-finding by Means of Matrix and Polynomial Iterations
• Accelerated Approximation of the Complex Roots of a Univariate\n Polynomial (Extended Abstract)
• Polynomial Root-Finding and Algebraic Eigenvalue Problem
• Real root refinements for univariate polynomial equations