Milestone 1 Root Finding Is One Of The Most Important Topics For Several Engineering Specializations It Is Used In Au 1 (59.25 KiB) Viewed 35 times
Milestone 1 Root Finding Is One Of The Most Important Topics For Several Engineering Specializations It Is Used In Au 2 (59.25 KiB) Viewed 35 times
then the computer must check the format, make sure its in the correct order, and there is power signs, and numbers after the power signs, and no plus or minus signs with nothing after them
then the program must divide the equation using tokens, get the coeffecients and find the real AND complex roots of the equation for up to the fifth order
Milestone 1 Root Finding Is One Of The Most Important Topics For Several Engineering Specializations It Is Used In Au 3 (59.25 KiB) Viewed 35 times
Milestone (1) Root finding is one of the most important topics for several engineering specializations. It is used in automatic control design as well as in solving optimization problems for machine learning. In this project, we are going to solve the following root finding case:- f(x) = anx" + an-142-1 + an-24"-2 + .. +ajx + ao = 0 The requirements will be as follows:- 1. The user must input the polynomial as an input string. Then your program makes sure it is in correct format and hence finds the order n and the coefficients, az. Coefficients will be stored in a dynamic array. An example of the input will be a string as follows:- 5x^3 - x^2 + 2.5x + 1...this means a third order polynomial with coefficients of 5, -1, 2.5, and 1. The program will print three roots. The program will detect any error encountered with the user input. The following are error examples: 5x^3 - x^2 + 2.5x + 5x^3 - x^+ 2.5x + 1 5x^3 - x2 + 2.5x + 1 2. The program will print all the real and complex roots of the polynomial. 3. Your program must be able to work for polynomials up to the fifth order. 4. The students will demonstrate the use of pointers, strings, and different arithmetic and mathematical operations or algorithms used in their implementations. 5. Ten different testing cases must be demonstrated with validated roots to show the efficiency of the implemented program.
Milestone (1) Root finding is one of the most important topics for several engineering specializations. It is used in automatic control design as well as in solving optimization problems for machine learning. In this project, we are going to solve the following root finding case:- f(x) = anx" + an-142-1 + an-24"-2 + .. +ajx + ao = 0 The requirements will be as follows:- 1. The user must input the polynomial as an input string. Then your program makes sure it is in correct format and hence finds the order n and the coefficients, az. Coefficients will be stored in a dynamic array. An example of the input will be a string as follows:- 5x^3 - x^2 + 2.5x + 1...this means a third order polynomial with coefficients of 5, -1, 2.5, and 1. The program will print three roots. The program will detect any error encountered with the user input. The following are error examples: 5x^3 - x^2 + 2.5x + 5x^3 - x^+ 2.5x + 1 5x^3 - x2 + 2.5x + 1 2. The program will print all the real and complex roots of the polynomial. 3. Your program must be able to work for polynomials up to the fifth order. 4. The students will demonstrate the use of pointers, strings, and different arithmetic and mathematical operations or algorithms used in their implementations. 5. Ten different testing cases must be demonstrated with validated roots to show the efficiency of the implemented program.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!