MSPAI: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
MSPAI is a preconditioner for large sparse and ill-conditioned systems of linear equations. We extended the basic SPAI minimization | MSPAI is a preconditioner for large sparse and ill-conditioned systems of linear equations. We extended the basic SPAI minimization | ||
[[Image: | [[Image:]] | ||
to target form and further generalized it in order to add additional ''probing constraints'': | to target form and further generalized it in order to add additional ''probing constraints'': | ||
Revision as of 12:03, 13 August 2008
Modified Sparse Approximate Inverses -- UNDER CONSTRUCTION!!!
Based upon the well-known sparse approximate inverse preconditioner SPAI, we developed the modified sparse approximate inverse (MSPAI) preconditioner.
Theory
MSPAI is a preconditioner for large sparse and ill-conditioned systems of linear equations. We extended the basic SPAI minimization
[[Image:]]
to target form and further generalized it in order to add additional probing constraints:
[[Image:_]]
Implementation and Features
Download
- Ph.D. thesis about MSPAI, both theory and implementation: mediatum
- Details about sparse QR methods in SPAI applications (german only): []
- Further details about implementation (german only): pdf
MSPAI References
<pubsccs>nocaption=1&persid=53&utypid=1020&datum=2007&lang=en</pubsccs><pubsccs>nocaption=1&persid=53&utypid=2030&datum=2008&lang=en</pubsccs>
under construction -- more information about MSPAI implementation and download will be available soon.