What is the general way to find a basis for the intersection of two sub spaces?
There's the method that use the fact that if we take some vector $v\in V$ and $v\in U$ then every linear combination of one subspaces will be equal to the other and we can do: $a_1v_1+a_2v_2... = x_1u_1+x_2u_2... \Rightarrow a_1v_1+a_2v_2... - ( x_1u_1+x_2u_2...) =0$ and find all the $a_i$ in terms of $x_i$ but this method doesn't always work.
Like in this example: Losing a dimension when finding intersection between subspaces
Or this example: $B_U=\{(-1,1,0,0),(-1,0,1,0),(-1,0,0,1)\} \\ B_V=\{(0,0,1,2),(0,1,0,-1),(-1,0,0,1)$
Where we have $(-c,b,a,2a-b+c)=(-x-y-z,x,y, z)$ so $b=x \\a=y\\ c=x+y+z \\ 2a-b+c=z$
Then $2y=z+x-y \Rightarrow z = -x+3y \Rightarrow c=4y \Rightarrow c=4a$ and now what?
Is there an even more general method to find the intersection?