Let $A(t,s)$ be a matrix of any size (potentially large), whose entries are polynomials functions wrt $(t,s)$ of order $N$.
I would like to compute the inverse $X$ of $A$ up to the order $N$ that is $X$ should satisfy $$ A\ X = Id + o(t^N,s^N). $$
One way is to compute the Taylor series of the entries of Inverse[A]
, however this seems very costly and I am looking a cheaper method.
An other idea that I don't know how to code properly is to write $$ X = X_{00} + tX_{10} + sX_{01} + \ldots \\ A = A_{00} + tA_{10} + sA_{01} + \ldots $$ where $X_{ij},A_{ij}$ are constant matrix wrt $t,s$, so that $AX=Id+...$ so for instance, we would have
X00 = Inverse[A/.{t->0,s->0}]
$X_{10}$ such that $A_{10}X_{10}=0$
... but how to implement it efficiently and generically ?