bump i still need help with this. right now i'm using an iterative (trial and error) method of finding roots.
|
|
10-17-2015, 12:57 AM
I am working on a algebra calculator, I haven't started the GUI yet because I'm still working on the algorithms for solving algebra equations. I did some research and realised the Newton-Raphson process can be used to find a root for any given polynomial. Is it possible to use the Newton-Raphson process to find more than one root of a polynomial (e.g. finding the other 3 roots of a quartic) or should I implement algebraic long division for normal cases?
bump i still need help with this. right now i'm using an iterative (trial and error) method of finding roots.
Took me a few seconds to google: [Only registered and activated users can see links. ]
But yeah, I don't know what would be the best method. I've never created any solver like this, the closest thing to this I've done is writing a numerically stable 4x4 matrix inverse function using the gauss-jordan elimination routine aand that isn't close to this at all. Other method they're discussing in that link is building a companion matrix and finding the eigenvalues of that matrix which would be precisely the roots of your poly.
| « Ipboards Picture link help | Recreating a Social Media site like Twitter » |
| Thread Information |
Users Browsing this ThreadThere are currently 1 users browsing this thread. (0 members and 1 guests) |
Harha