Sunteți pe pagina 1din 12

Janssen Gerardo T.

Valbuena
Machine Problem 1
ES 204 WZZQ

BAIRSTOW’S METHOD OF FINDING


THE ROOTS OF A POLYNOMIAL

Programming Language Used: Microsoft Excel VBA (C++)


Solve the following test data using Bairstow’s Method:

1. x4 – 2x3 + 3x2 +4x + 4 = 0

A. Program Input

B. Program Output
- Solving for the first and second root (r1 and r2):
- The values of bn-1 and bn become zeroes after 7th iteration. The roots can now
be solved using quadratic formula.
- Solving for the third and fourth root (r3 and r4):
2. x9 + 2x8 -7x7 + 11x6 + 41x5 – 183x4 + 231x3 + 21x2 – 265x + 130 = 0

A. Program Input

B. Program Output
- Solving for the first and second root (r1 and r2):
- The values of bn-1 and bn become zeroes after 24th iteration. The roots can now
be solved using quadratic formula.
- Solving for the third and fourth root (r3 and r4):
- The values of bn-1 and bn become zeroes after 7th iteration. The roots can now
be solved using quadratic formula.

- Solving for the fifth and sixth root (r5 and r6):
- The values of bn-1 and bn become zeroes after 14th iteration. The roots can now
be solved using quadratic formula.
- Solving for the seventh, eighth and ninth root (r7, r8 and r9):
- The values of bn-1 and bn become zeroes after 8th iteration. The roots can now
be solved using quadratic formula.
Appendix: Microsoft VBA Program Code

S-ar putea să vă placă și