Scribd
Upload
101 views3 pages

Problem 8: Bairstow's Method

This document describes Bairstow's method for finding the roots of a polynomial. It defines a bairstow function that takes in the coefficients vector, initial guesses for r and s, the polynomial degree, and an empty roots array. It recursively calls itself, updating r and s using determinants, until the coefficients b0 and b1 are close to 0. It then extracts the roots and returns them. As an example, it finds all three roots of the polynomial x^3 - 4x^2 + 3x - 1 by calling bairstow with random initial guesses for r and s.

Uploaded by

Roseller Sumonod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views3 pages

Problem 8: Bairstow's Method

This document describes Bairstow's method for finding the roots of a polynomial. It defines a bairstow function that takes in the coefficients vector, initial guesses for r and s, the polynomial degree, and an empty roots array. It recursively calls itself, updating r and s using determinants, until the coefficients b0 and b1 are close to 0. It then extracts the roots and returns them. As an example, it finds all three roots of the polynomial x^3 - 4x^2 + 3x - 1 by calling bairstow with random initial guesses for r and s.

Uploaded by

Roseller Sumonod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

22/10/2019 Problem8BairstowMethod

Problem 8: Bairstow's Method

localhost:8891/nbconvert/html/Problem8BairstowMethod.ipynb?download=false 1/3
22/10/2019 Problem8BairstowMethod

In [2]: import cmath


import random
'''
Bairstow's Method where:
r = Initial guess
s = Initial guess
roots = Empty Array
a = Coefficient's vector with increasing powers ot the unknown
g = Polynomial's degree
'''
def bairstow(a,r,s,g,roots):
if(g<1):
return None
if(g==1):
roots.append(float(-a[0])/float(a[1]))
return None
if(g==2):
D = (a[1]**2.0)-(4.0)*(a[2])*(a[0])
X1 = (-a[1] - cmath.sqrt(D))/(2.0*a[2])
X2 = (-a[1] + cmath.sqrt(D))/(2.0*a[2])
roots.append(X1)
roots.append(X2)
return None
n = len(a)
b = [0]*len(a)
c = [0]*len(a)
b[n-1] = a[n-1]
b[n-2] = a[n-2] + r*b[n-1]
i = n - 3
while(i>=0):
b[i] = a[i] + r*b[i+1] + s*b[i+2]
i = i - 1
c[n-1] = b[n-1]
c[n-2] = b[n-2] + r*c[n-1]
i = n - 3
while(i>=0):
c[i] = b[i] + r*c[i+1] + s*c[i+2]
i = i - 1
Din = ((c[2]*c[2])-(c[3]*c[1]))**(-1.0)
r = r + (Din)*((c[2])*(-b[1])+(-c[3])*(-b[0]))
s = s + (Din)*((-c[1])*(-b[1])+(c[2])*(-b[0]))
if(abs(b[0])>1E-8 or abs(b[1])>1E-8):
return bairstow(a,r,s,g,roots)
if (g>=3):
Dis = ((-r)**(2.0))-((4.0)*(1.0)*(-s))
X1 = (r - (cmath.sqrt(Dis)))/(2.0)
X2 = (r + (cmath.sqrt(Dis)))/(2.0)
roots.append(X1)
roots.append(X2)
return bairstow(b[2:],r,s,g-2,roots)

''' We will find all the roots of


f(x) = x3 – 4x2 + 3x – 1
'''
k = 0
g = 3

localhost:8891/nbconvert/html/Problem8BairstowMethod.ipynb?download=false 2/3
22/10/2019 Problem8BairstowMethod

roots = []
a = [1,-4,3,-1]

r = random.random()
s = random.random()
bairstow(a,r,s,g,roots)

print("\nFound Roots => \n")


for r in roots:
print("R" + str(k) + " = " + str(r))
k += 1
Found Roots =>

R0 = (1.3411639019140096-1.161541399997252j)
R1 = (1.3411639019140096+1.161541399997252j)
R2 = 0.3176721955705304

localhost:8891/nbconvert/html/Problem8BairstowMethod.ipynb?download=false 3/3

You might also like