I came up with a method for a $n$-ellipse. The 2D case is a particular one and the same method can be applied.
It supposes that you know the center of the ellipses and the axis.
- Refer to this question if you know the coeffs
$$ax^2 + bxy + cy^2 +dx + ey + f = 0$$
- To compute the matrix $A$ by using major axis $a$, minor axis $b$ and angle $\varphi$:
$$A = \begin{bmatrix}a \cdot \cos \varphi & a \cdot \sin \varphi \\ -b \cdot \sin \varphi & b \cdot \cos \varphi\end{bmatrix}$$
General method
Let $E_1$ and $E_2$ be ellipses of center $\alpha$ and $\beta$ and axis the matrices $\left[A\right]$ and $\left[B\right]$:
$$E_1: \left\{\left(\alpha + A \cdot p\right) \in \mathbb{R}^{n} : \|p\| \le 1\right\}$$
$$E_2: \left\{\left(\beta + B \cdot q\right) \in \mathbb{R}^{n} : \|q\| \le 1\right\}$$
I use the notation $a_i = \left[A\right]_i$, $b_i = \left[B\right]_{i}$, and $\langle u, \ v\rangle = u^{T} \cdot v$ refers to the inner product between $u$ and $v$.
To know if a point $P \in E_1$, it must satisfy
$$\sum_{i=1}^{n} \left(\dfrac{\langle P - \alpha, \ a_i\rangle}{\langle a_i, \ a_i \rangle}\right)^2 \le 1 \tag{3}\label{3}$$
So, to $E_2 \subset E_1$, then \eqref{3} must be satisfied by every point of $E_2$, which leads to \eqref{4}
$$\sum_{i=1}^{n} \left(\dfrac{\left\langle \left(\beta - \alpha + \sum_{j=1}^{n} q_j \cdot b_j\right) , \ a_i\right\rangle}{\langle a_i, \ a_i \rangle}\right)^2 \le 1 \ \ \ \forall \ \|q\| \le 1 \tag{4}\label{4}$$
Expanding \eqref{4} and setting new variables to get \eqref{5}
$$
\sum_{i=1}^{n} \left(C_i + \sum_{j=1}^{n} M_{ij} \cdot q_j \right)^2 \le 1 \ \ \ \ \forall \ \|q\| \le 1 \tag{5}\label{5}
$$
$$C_{i} = \dfrac{\left\langle a_i, \ \beta - \alpha \right\rangle}{\left\langle a_i, \ a_i \right\rangle} \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ M_{ij} = \dfrac{\left\langle a_i, \ b_i \right\rangle}{\left\langle a_i, \ a_i \right\rangle}$$
Or also using matrix notation
$$C = \left(A \cdot A^{T} \right)^{-1} \cdot A \cdot \left(\beta - \alpha\right)$$
$$M = \left(A \cdot A^{T} \right)^{-1} \cdot A \cdot B^{T}$$
\eqref{5} can be rewrote as \eqref{6} by using matrix notation
$$\left(C + Mq\right)^{T} \cdot \left(C + Mq\right) \le 1 \ \ \ \ \ \ \ \forall \|q\| \le 1 $$
$$q^T \cdot X \cdot q + 2 \cdot Y \cdot q + Z \le 1 \ \ \ \ \ \ \ \forall \|q\| \le 1 \tag{6}\label{6}$$
$$X = M^{T} \cdot M \ \ \ \ \ \ \ \ \ \ Y = C^{T} \cdot M \ \ \ \ \ \ \ \ \ \ Z = C^{T} \cdot C $$
I tried to find $q$ such maximizes the left side of \eqref{6} by using lagrange multiplier (to apply the constraint). Which involves solving
$$\begin{cases}X\cdot q + Y + \mu q = 0 \\ q^T \cdot q - 1 =0\end{cases}$$
Unfortunatelly it was harder than I thought to find a solution. So I used a different approach which is true for most cases, for 'almost' centered ellipses.
Completing squares to isolate $q$ we get \eqref{7}
$$w^T \cdot X \cdot w \le W \ \ \ \ \ \ \ \forall \|w - N\| \le 1 \tag{7}\label{7}$$
$$w = q + N \ \ \ \ \ \ \ \ \ \ \ N = X^{-1} Y \ \ \ \ \ \ \ \ \ \ \ W = 1 + Y^{T} \cdot X^{-1} \cdot Y - Z$$
Since $X$ is a positive defined matrix, the left side is always positive. Finding the maximum of the left side happens when the vector $w$ is parallel to the eigenvector $v$ that gives the maximum eigenvalue $\lambda$.
This hypothesis works only when $N^T \cdot N < 1 + \left(V^T N\right)^2$. This doesn't happen when the centers $\alpha$ and $\beta$ are distant.
$$q + N = \mu \cdot v$$
$$\underbrace{q^T \cdot q}_{1} = \mu^2 \cdot \underbrace{v^T \cdot v}_1 - 2 v^T \cdot N + N^T \cdot N$$
$$\mu = v^T \cdot N \pm \sqrt{1 + \left(v^T N\right)^2 - N^T \cdot N}\tag{8}\label{8}$$
Applying \eqref{8} in \eqref{7} we obtain the final verification
$$\boxed{\mu^2 \cdot \lambda \le W}$$
Algorithm
I made a python algorithm that works with the hypothesis made above.
import numpy as np
from matplotlib import pyplot as plt
A = [[ 2.74630871, -3.17694060], [-2.22172112, -1.92056851]]
B = [[ 1.62742095, -2.34414119], [-1.97924175, -1.37408937]]
alpha = (0, 0)
beta = (0, 0)
AAT = np.dot(A, np.transpose(A))
ABT = np.dot(A, np.transpose(B))
AdC = np.dot(A, np.array(alpha)-beta)
C = np.linalg.solve(AAT, AdC)
M = np.linalg.solve(AAT, ABT)
X = np.dot(np.transpose(M), M)
Y = np.dot(C, M)
Z = np.dot(C, C)
N = np.linalg.solve(X, Y)
W = 1 + np.dot(Y, N) - Z
eigvals, eigvecs = np.linalg.eigh(X)
index = tuple(eigvals).index(max(eigvals))
lamda, v = eigvals[index], eigvecs[:, index]
b = np.dot(v, N)
c = np.dot(N, N) - 1
mu1 = b + np.sqrt(b**2 - c)
mu2 = b - np.sqrt(b**2 - c)
print("X = ")
print(X)
print(f"Y = {Y}")
print(f"Z = {Z}")
print(f"N = {N}")
print(f"W = {W}")
print(f"mu1 = {mu1}")
print(f"mu2 = {mu2}")
print(mu1**2 * lamda <= W)
print(mu2**2 * lamda <= W)
theta = np.linspace(0, 2*np.pi, 129)
points = np.tensordot(np.cos(theta), A[0], axes=0)
points += np.tensordot(np.sin(theta), A[1], axes=0)
xvals, yvals = np.transpose(points)
plt.plot(xvals, yvals, label="A")
points = np.tensordot(np.cos(theta), B[0], axes=0)
points += np.tensordot(np.sin(theta), B[1], axes=0)
xvals, yvals = np.transpose(points)
plt.plot(xvals, yvals, label="B")
plt.legend()
plt.show()
```