Subspace RPM Generalization

Hi. RPM or 'Recursive Projection Method,' is a method that uses projections to deflate out parts of a matrix that causes an iteration to diverge when trying to solve a linear system. There are different ways to do this, and this writeup is a description of how to generalize these methods via use of Kronecker product methods.

I have tried to publish this once, but given how I don't understand the publication process, I got nowhere with this. So, here it is. Unlike other works here, I don't really have a good idea as to why. So, like the rest of my life, it's placed here in this dumpsterfire of a website. Enjoy.

If you are interested in more of what this method even is, please see the RPM section of this dissertation.

2013-15 Work
  • Writeup (pdf warning)