Again to find m I will have to iterate till I see identity matrix right? So that means it is sometimes computationally intensive right?
You are viewing a single comment's thread from:
Again to find m I will have to iterate till I see identity matrix right? So that means it is sometimes computationally intensive right?
When you iterate you only have to compute D^m D is a diagonal matrix so that is pretty easy to compute. X and invX stay the same. More specifically B^m=invX D^m X
Posted using Partiko Android