summaryrefslogtreecommitdiff
path: root/content/know/concept/partial-fraction-decomposition/index.pdc
blob: 1f4207f315310e03c82658b5315b7d4a93812749 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
---
title: "Partial fraction decomposition"
firstLetter: "P"
publishDate: 2021-02-22
categories:
- Mathematics

date: 2021-02-22T21:36:56+01:00
draft: false
markup: pandoc
---

# Partial fraction decomposition

**Partial fraction decomposition** or **expansion** is a method to rewrite a
quotient of two polynomials $g(x)$ and $h(x)$, where the numerator
$g(x)$ is of lower order than $h(x)$, as a sum of fractions with $x$ in
the denominator:

$$\begin{aligned}
    f(x) = \frac{g(x)}{h(x)} = \frac{c_1}{x - h_1} + \frac{c_2}{x - h_2} + ...
\end{aligned}$$

Where $h_n$ etc. are the roots of the denominator $h(x)$. If all $N$ of
these roots are distinct, then it is sufficient to simply posit:

$$\begin{aligned}
    \boxed{
        f(x) = \frac{c_1}{x - h_1} + \frac{c_2}{x - h_2} + ... + \frac{c_N}{x - h_N}
    }
\end{aligned}$$

The constants $c_n$ can either be found the hard way,
by multiplying the denominators around and solving a system of $N$
equations, or the easy way by using this trick:

$$\begin{aligned}
    \boxed{
        c_n = \lim_{x \to h_n} \big( f(x) (x - h_n) \big)
    }
\end{aligned}$$

If $h_1$ is a root with multiplicity $m > 1$, then the sum takes the form of:

$$\begin{aligned}
    \boxed{
        f(x)
        = \frac{c_{1,1}}{x - h_1} + \frac{c_{1,2}}{(x - h_1)^2} + ...
    }
\end{aligned}$$

Where $c_{1,j}$ are found by putting the terms on a common denominator, e.g.

$$\begin{aligned}
    \frac{c_{1,1}}{x - h_1} + \frac{c_{1,2}}{(x - h_1)^2}
    = \frac{c_{1,1} (x - h_1) + c_{1,2}}{(x - h_1)^2}
\end{aligned}$$

And then, using the linear independence of $x^0, x^1, x^2, ...$, solving
a system of $m$ equations to find all $c_{1,1}, ..., c_{1,m}$.