Students will be prepared in the design and use of algorithms and numerical methods for modelling and for solving real problems. The numerical solution to any degree of approximation of a polynomial of degree n by constructing algorithms based on algebraic procedures, for example the two methods cited above, would be studied under Computer Science and Numerical Analysis by specialists in these fields.The Bachelor’s Degree in Applied Mathematics and Computing seeks to train professionals who are capable of applying mathematics in those areas of science, engineering, economics, and other social sciences where computation plays a key role. There are exact solutions in terms of radicals, but only for particular cases of the polynomial coefficients. In general, there are no exact solutions for solving polynomials in terms of radicals, that is in terms of square roots, cube roots, etc., for polynomials of degree five or greater, and the solutions are approximations. Knowing to where to find the solution is an answer to the question cited.

The question was: How to solve a polynomial of degree n. These two numerical solutions, the Durand-Kerner and the Jenkins-Traub method are to be found in Wikipedia. This method is studied under Numerical Analysis and is explained for polynomials of degree four, but generalized to polynomials of higher degree.Īnother advanced method is due to Jenkins-Traub.

To understand this method requires a knowledge of several branches of advanced algebra. This is the Weierstrass method also known as the Durand-Kerner method.

There is a very advanced way of solving polynomial equations approximately.

Mathematica degree