Root finding methods for Polynomials.

  • Context: Undergrad 
  • Thread starter Thread starter mhill
  • Start date Start date
  • Tags Tags
    Polynomials Root
Click For Summary
SUMMARY

The discussion focuses on root finding methods for polynomials, specifically addressing the identification of complex roots with distinct real parts. The user highlights the need for a method to determine roots such as 1+3i and 0.6+8i, emphasizing the importance of the real part's magnitude. MATLAB is mentioned as an effective tool for numerically finding polynomial roots by transforming the problem into an eigenvalue problem, which converges quickly and accurately, particularly when eigenvalues are well-separated. Additionally, Bairstow's method is recommended for finding both real and complex roots efficiently.

PREREQUISITES
  • Understanding of polynomial equations and their roots
  • Familiarity with MATLAB for numerical computations
  • Knowledge of eigenvalue problems in linear algebra
  • Experience with Bairstow's method for root finding
NEXT STEPS
  • Research MATLAB's polynomial root-finding functions
  • Study the implementation of Bairstow's method in detail
  • Explore numerical stability in eigenvalue problems
  • Investigate alternative root-finding algorithms for polynomials
USEFUL FOR

Mathematicians, engineers, and computer scientists involved in numerical analysis, particularly those working with polynomial equations and seeking efficient methods for root finding.

mhill
Messages
180
Reaction score
1
Hi , is there a method to obtain the roots of Polynomials:

P(x)=a_{0}+a_{1}x+a{2}x^{2}+...+a_{n}x^{n}

i know there are , but my problem is this if we knew that are complex roots of the form z=a+ib , would be a method to obtain the complex root with BIGGER and SMALLER real part ?? , i mean for example if a POlynomial has complex root:

1+3i 1-3i 0.6+8i 0.6-8i 0.01+34i 0.01-34i ...

my question is if we could use a root finding algorithm to check that the bigger part of the roots is '1'
 
Last edited:
Mathematics news on Phys.org
I'm not sure what you mean. Matlab has a good method for finding the roots numerically. It transfers the roots of polynomial to an eigvenvalue problem. It converges quite fast and will give you all the roots. It is quite accurate if the eignvalues are well separated.
 
One method to find all roots is the one of Bairstow. This gives you not only the real, but also the complex ones. Look here for some info, and google a bit to find some more:

http://en.wikipedia.org/wiki/Bairstow's_method

The implementation is not that difficult, I've done it and it works fine. The only thing to take care of is a good starting value, but even that can be solved.
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 16 ·
Replies
16
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K