However the story behind equations is quite interesting, so I’m going to take you back to 2000 BC - 600 BC to the Babylonian civilization in Mesopotamia. I am of course talking about equations on the form 2x + 3 = 7, and the simple equation is called linear equations, as they can be represented by lines when graphed (or drawn). This is fairly easy to solve mathematically so if you are experiencing trouble here, you should probably not download the code. It should be mentioned that the Jenkins-Traub algorithm generally uses explicit formulas for 1st and 2nd degree, while using the numerical approximation on 3rd degree and above. I won’t give any explanations of how these formulas were derived, as the formulas get quite lengthy, so long that in fact that even Tartaglia (one of the people that had a part in solving the cubic equation) had problems in remembering all the rules he had discovered.Īs for the numerical algoritm Jenkins-Traub, it has been completely translated from a C++and C version into VB.NET and C# by me, and as far as I have tested it, it seems to be working fine. The title of the book refers to the story of the insolvability of the 5th degree polynomial equation, but it also goes through the historical development of the solutions to lower degree polynomial equations. I also have a rather lengthy story to follow it, as I have read "The equation that couldn’t be solved" by Mario Livio. I made some corrections in the formula thanks to the comment below by BenoitAndrieu. The explicid algebraic formulas that is also implemented are nasty, and would definitely clog up your day if you ever had a need for one, so I decided to share it with you. For rearch and personal use there is no issue. NB: There might be a licence attached to the Jerkins-Traub algorithm for commercial use, please check this before you use it in a program that you want to sell to others. It is both of these application that are converted from C++ and C into C # and VB code by me. The C++ I relied on for complex coefficients was written by Henrik Vestermark. Please accept my sincere apology for this mistake. The ones that I did use is one C++ algorithm translated by David Binner for the real coefficients only. In my defense I did translate the one written by Laurent Bartholdi too but that was not included in the article. I did however manage to mix up on of the implementations done in C++ that I translated to C# and VB.NET. (I did, however, find several translations of the Jenkins-Traub algorithm written by Jenkins himelf in FORTRAN (Can still be downloaded here Netlib). NET that contained either the explicit algebraic formulas, or the numerical algorithm Jenkins-Traub. NET, and to my surprise I couldn't find any code written in C# or VB. Recently I came across a situation where I needed to solve a 4th degree polynomial equation in. Download source code and demo for using explicit formulas VB.NET (VS 2013).Download source code for using explicit formulas VB.NET (VS 2013).Download original source code and demo for Jenkins-Traub algorithm in C++ for complex coefficients.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |