I am a green-hand in calculating the time complexity. Given a calculation as follows:\begin{equation}\mathbf{x}=\mathbf{A^T}(\mathbf{AA^T}+\lambda\mathbf{I}_n)^{-1}\mathbf{b}\end{equation}where $\mathbf{A}\in R^{n\times p}$, $\mathbf{I}_n\in R^{n\times n}$, $\mathbf{b}\in R^{n}$ and $\lambda\in R$.Could some one kindly give me the complexity of the above formula in details? Thanks a lot. 
How to calculate a specific time complexity of inverse calculation of matrix?
algorithm analysis;runtime analysis;matrices