 |  |  |  |  |  |  |  |
How to carry out partial fraction decomposition
Please support our C advertiser: Programming Forums - DaniWeb Sister Site
 |
•
•
Join Date: Jul 2005
Posts: 1,736
Reputation: 
Solved Threads: 281
A well developed sense of humor is not one of my strengths!
I wish the OP good luck and my hat goes off with a respectful bow to all of you who can factor polynomials, by whatever mechanism you use!
I wish the OP good luck and my hat goes off with a respectful bow to all of you who can factor polynomials, by whatever mechanism you use!
•
•
Join Date: Jul 2006
Posts: 88
Reputation:
Solved Threads: 2
Junior Poster in Training
Do you know some conditions ahead of time? For example, will the denominator always be a linear term, such as (x- a)? If so, it would make the program a lot simpler.
You might find something by doing a search on the term "synthetic division".
It is often used for solving the roots of polynomials (deflating them).
Say you have the polynomial P(x) = 0 and you know one root is x = a. You then know P(x) = (x-a)*Q(x) = 0. Q(x) is found by synthetic division, removing the root you already know so that the remaining equation, Q(x), is simpler to solve.
For example, check out sub-routine quadsd on the following page:
http://www.crbond.com/download/misc/rpoly.cpp
You may not be solving for the roots of polynomials, but the synthetic division procedure, itself, might be applicable to your problem. "Numerical Recipes" also provides some code.
Hope this gives you some ideas.
David
You might find something by doing a search on the term "synthetic division".
It is often used for solving the roots of polynomials (deflating them).
Say you have the polynomial P(x) = 0 and you know one root is x = a. You then know P(x) = (x-a)*Q(x) = 0. Q(x) is found by synthetic division, removing the root you already know so that the remaining equation, Q(x), is simpler to solve.
For example, check out sub-routine quadsd on the following page:
http://www.crbond.com/download/misc/rpoly.cpp
You may not be solving for the roots of polynomials, but the synthetic division procedure, itself, might be applicable to your problem. "Numerical Recipes" also provides some code.
Hope this gives you some ideas.
David
|
Other Threads in the C Forum
- Previous Thread: C Quest 2
- Next Thread: what is different between hIconSm and hIcon?
| Thread Tools | Search this Thread |
Latest C Posts
- Today's Posts
- Unanswered Threads
Related Forum Features
Tag cloud for C
#include adobe ansi array arrays asterisks binarysearch calculate centimeter changingto char convert copyimagefile cprogramme creafecopyofanytypeoffileinc database directory dynamic fflush file fork forloop framework getlasterror givemetehcodez grade graphics gtkgcurlcompiling hacking hardware highest histogram inches include incrementoperators input iso kernel km lazy linked linkedlist linux linuxsegmentationfault list lists locate logical_drives looping loopinsideloop. lowest match matrix microsoft motherboard multi mysql number opendocumentformat opensource owf pattern pdf performance pointer posix problem probleminc process program programming radix recursion recv repetition research reversing scanf scripting segmentationfault sequential shape socket socketprograming stack standard string strings structures systemcall testing threads turboc unix user variable voidmain() wab windows.h windowsapi
