How does one solve this recurrence relation?

Observe that

$$a_{n+1}+b_{n+1}=2a_n+2b_n=2(a_n+b_n)\;,$$

and $a_0+b_0=1$, so in general $a_n+b_n=2^n$.

Quickly calculating a few values, we see that the numbers $b_n$ are a little nicer than the numbers $a_n$:

$$\begin{array}{rcc} n:&0&1&2&3&4\\ a_n:&1&-2&-12&-40&-112\\ b_n:&0&4&16&48&128\\ \end{array}$$

Concentrating on the $b_n$, we see that

$$b_{n+1}=4(a_n+b_n)+2b_n=2^{n+2}+2b_n\;,$$

so that

$$\begin{align*} b_n&=2b_{n-1}+2^{n+1}\\ &=2(2b_{n-2}+2^n)+2^{n+1}\\ &=2^2b_{n-2}+2\cdot2^{n+1}\\ &=2^2(2b_{n-3}+2^{n-1})+2\cdot 2^{n+1}\\ &=2^3b_{n-3}+3\cdot 2^{n+1}\\ &\;\;\vdots\\ &=2^kb_{n-k}+k2^{n+1}\\ &\;\;\vdots\\ &=2^nb_0+n2^{n+1}\\ &=n2^{n+1}\;, \end{align*}$$

so $a_n=2^n-n2^{n+1}=2^n(1-2n)$, and

$$\frac{a_n}{a_n+b_n}=\frac{2^n(1-2n)}{2^n}=1-2n\;.$$

(There are other ways to solve that first-order recurrence for $b_n$; I just picked the most elementary one.)

A trick that is standard in my little world is this: the matrix $$ M = \left( \begin{array}{rr} -2 & -4 \\ 4 & 6 \end{array} \right) $$ has trace $4$ and determinant $4.$ The characteristic roots satisfy $\lambda^2 - 4 \lambda + 4 = 0.$ The Cayley-Hamilton Theorem (if this is not familiar, see the ADDENDUM) says that $$ a_{n+2} = 4 a_{n+1} - 4 a_n, $$ $$ b_{n+2} = 4 b_{n+1} - 4 b_n. $$ It is easy enough to confirm these with direct calculations.

Because of the repeated characteristic value $2,$ we get $a_n = A 2^n + B n 2^n,$ with $b_n = C 2^n + D n 2^n.$

Calculating the first few of each to solve for the coefficients, we get $$ a_n = 2^n - 2n 2^n, \; \; \; \; b_n = 2n 2^n. $$

ADDENDUM:

Not everyone has seen Cayley-Hamilton. I did say it could be confirmed by straightforward calculation:

Suppose we have the system $$ \color{blue}{ a_{n+1} = \alpha a_n + \beta b_n,}$$ $$ \color{blue}{ b_{n+1} = \gamma a_n + \delta b_n.} $$

We will find $a_{n+2}$ in two slightly different ways.

$$ a_{n+2} = \alpha a_{n +1} + \beta b_{n +1} = \alpha(\alpha a_n + \beta b_n) + \beta ( \gamma a_n + \delta b_n) = (\alpha^2 + \beta \gamma) a_n +(\alpha \beta + \beta \delta) b_n $$

Let me go straight to this, define $$ \Psi = (\alpha + \delta) a_{n+1} - (\alpha \delta - \beta \gamma) a_n, $$ $$ \Psi = (\alpha + \delta)( \alpha a_n + \beta b_n) - (\alpha \delta - \beta \gamma) a_n, $$ $$ \Psi = (\alpha^2 + \alpha \delta) a_n + (\alpha \beta + \beta \delta)b_n - (\alpha \delta - \beta \gamma) a_n, $$ $$ \Psi = (\alpha^2 + \beta \gamma) a_n + (\alpha \beta + \beta \delta)b_n. $$ From $$ a_{n+2} = (\alpha^2 + \beta \gamma) a_n +(\alpha \beta + \beta \delta) b_n $$ we find $$ a_{n+2} = \Psi, $$ or $$ \color{blue}{ a_{n+2} = (\alpha + \delta) a_{n+1} - (\alpha \delta - \beta \gamma) a_n.} $$ An analogous calculation works for $b_{n+2}= (\alpha + \delta) b_{n+1} - (\alpha \delta - \beta \gamma) b_n .$

By adding the two equations you get

$a_{n+1}+b_{n+1}=2(a_n+b_n)$,

so that $a_n+b_n=2^{n}$.

Plugging this into the first equation one gets $$ a_{n+1}=−4(a_n+b_n)+2a_n=-4\cdot2^n+2a_n, $$ that is, dividing by $2^{n+1}$ $$ {a_{n+1}\over 2^{n+1}}=-2+{a_n\over2^n}. $$ It follows that $a_n/2^n$ is an arithmetic progression and $$ {a_n\over2^n}=-2n+1. $$