No, I am not looking for a code solution, I am looking for where to go to get a "tutorial" on how to solve the attached equation.
Thanks.
This is a discussion on Math question within the A Brief History of Cprogramming.com forums, part of the Community Boards category; No, I am not looking for a code solution, I am looking for where to go to get a "tutorial" ...
No, I am not looking for a code solution, I am looking for where to go to get a "tutorial" on how to solve the attached equation.
Thanks.
what has this got to do with C++ programming?
"I saw a sign that said 'Drink Canada Dry', so I started"
-- Brendan Behan
Free Compiler: Visual C++ 2005 Express
If you program in C++, you need Boost. You should also know how to use the Standard Library (STL). Want to make games? After reading this, I don't like WxWidgets anymore. Want to add some scripting to your App?
I am attempting to implement it in C++, but have not touched this level of math in at least a decade. I don't even know what to call this type of formula. I don't want to get a C++ solution. I am looking for a bord that might discuss this type of math or how discussion/tutorial on implementing such math in C++
well, I'd start by reading up on polynomial equations
"I saw a sign that said 'Drink Canada Dry', so I started"
-- Brendan Behan
Free Compiler: Visual C++ 2005 Express
If you program in C++, you need Boost. You should also know how to use the Standard Library (STL). Want to make games? After reading this, I don't like WxWidgets anymore. Want to add some scripting to your App?
Moved to General Discussions.
C + C++ Compiler: MinGW port of GCC
Version Control System: Bazaar
Look up a C++ Reference and learn How To Ask Questions The Smart Way
One common way to find the roots of an arbitrary polynominal is to construct a matrix with the desired roots as eigenvalues (search for "companion matrix"). Then use an iterative way ("power iteration" is simple, "QR algorithm" is somewhat more advanced, but popular) to find the eigenvalues.
You can also try to find a root using Newton's method and then divide the polynominal by (x-root) to reduce it to degree 4. There will always be at least one real root.
Last edited by Sang-drax : Tomorrow at 02:21 AM. Reason: Time travelling
Callou collei we'll code the way
Of prime numbers and pings!