A method for finding the zeros of polynomials using a companion matrix.
From MaRDI portal
Publication:1421154
DOI10.1007/BF03170428zbMath1040.26005OpenAlexW2061075368MaRDI QIDQ1421154
Xiao-Ming Niu, Tetsuya Sakurai
Publication date: 2003
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03170428
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10)
Related Items (11)
Family of simultaneous methods of Hansen--Patrick's type ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ Bounds on the moduli of polynomial zeros ⋮ Moment-based, univariate \(n\)-point quadrature rules in application to the full network model of rubber elasticity ⋮ New higher-order methods for the simultaneous inclusion of polynomial zeros ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ A family of root-finding methods with accelerated convergence ⋮ An efficient higher order family of root finders ⋮ A new fourth-order family of simultaneous methods for finding polynomial zeros ⋮ A higher order family for the simultaneous inclusion of multiple zeros of polynomials ⋮ Sigmoid-like functions and root finding methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A real symmetric tridiagonal matrix with a given characteristic polynomial
- Construction of unitary and normal companion matrices
- Polynomial zerofinding iterative matrix algorithms
- An error analysis of two related quadrature methods for computing zeros of analytic functions.
- Polynomial roots: The ultimate answer?
- Simultaneous factorization of a polynomial by rational approximation
- A composite polynomial zerofinding matrix algorithm
- On locating clusters of zeros of analytic functions
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- Polynomial root finding using iterated Eigenvalue computation
- A fast algorithm for solving a Toeplitz system of equations
- Solving a Polynomial Equation: Some History and Recent Progress
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- An Algorithm for the Inversion of Finite Hankel Matrices
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- The Triangular Decomposition of Hankel Matrices
This page was built for publication: A method for finding the zeros of polynomials using a companion matrix.
