Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Give the incomplete partial fraction decomposition of a rational function
ResourceFunction["IncompletePFD"][num,den,x] returns the incomplete partial fraction decomposition of . |
Find the incomplete partial fraction decomposition for :
In[1]:= |
Out[1]= |
Find the incomplete partial fraction decomposition for modulo 5:
In[2]:= |
Out[2]= |
Check the result is equivalent to the rational function:
In[3]:= |
Out[3]= |
The rational function does not have a nontrivial decomposition over the rationals:
In[4]:= |
Out[4]= |
The denominator factors over the Gaussian integers, so providing that as an extension gives a decomposition over linear denominators:
In[5]:= |
Out[5]= |
Apart is similar to IncompletePFD, but it does a full decomposition over the rationals. First define a numerator and denominator:
In[6]:= |
In[7]:= |
In[8]:= |
Out[8]= |
In[9]:= |
Out[9]= |
Compute the incomplete partial fraction decomposition:
In[10]:= |
Out[10]= |
Apart gives a mathematically equivalent result :
In[11]:= |
Out[11]= |
For high degrees, IncompletePFD can be notably faster than Apart:
In[12]:= |
In[13]:= |
Out[13]= |
In[14]:= |
Out[14]= |
In[15]:= |
Out[15]= |
In[16]:= |
Out[16]= |
Check that the denominators are the expected factors to the correct powers:
In[17]:= |
Out[17]= |
Check that the result is equivalent to the rational function num/den:
In[18]:= |
Out[18]= |
IncompletePFD is intended for polynomials with exact coefficients and may give a result that is deficient due to numerical instability of the method when given input with approximate coefficients:
In[19]:= |
In[20]:= |
Out[20]= |
In[21]:= |
Out[21]= |
In[22]:= |
Out[22]= |
This work is licensed under a Creative Commons Attribution 4.0 International License