Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
From MaRDI portal
Publication:597271
DOI10.1016/S0898-1221(03)90227-6zbMath1054.65049MaRDI QIDQ597271
Xingyuan Wu, Yiran Zhu, Rong Shao
Publication date: 6 August 2004
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
superlinear convergenceBroyden's methodpolynomial zerosimultaneous approximation of real zerosVieta's method
Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Cites Work
- Unnamed Item
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem
- A family of simultaneous zero-finding methods
- A high-order iterative formula for simultaneous determination of zeros of a polynomial
- Point estimation and some applications to iterative methods
- Practical quasi-Newton methods for solving nonlinear systems
- Finding roots of a real polynomial simultaneously by means of Bairstow's method
- On initial conditions for the convergence of simultaneous root finding methods
- Simultaneous inclusion of the zeros of a polynomial
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- On the Global Convergence of Broyden's Method
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Solving a Polynomial Equation: Some History and Recent Progress
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A New Method of Solving Nonlinear Simultaneous Equations
- The Convergence of Single-Rank Quasi-Newton Methods
- The simultaneous approximation of polynomial roots
This page was built for publication: Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
