Loading...
Please wait, while we are loading the content...
Similar Documents
Analysis, Implementation, and Evaluation of Vaidya's Preconditioners
| Content Provider | CiteSeerX |
|---|---|
| Author | Chen, Doron |
| Abstract | A decade ago Pravin Vaidya proposed a new class of preconditioners and a new technique for analyzing preconditioners. Preconditioners are essentially easy-to-compute approximate inverses of matrices that are used to speed up iterative linear solvers. Vaidya proposed several families of preconditioners. The simplest one is based on maximum spanning trees (MST) of the underlying graph of the matrix. The second one augments the MST with extra edges to speed up convergence. A third, which Vaidya only mentions briefly, is based on a maximumweight basis (MWB) of the matroid associated with the graph of the matrix. The first two families apply only to M-matrices, the third to diagonally-dominant symmetric matrices. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Pravin Vaidya Diagonally-dominant Symmetric Matrix Several Family Extra Edge Iterative Linear Solver New Technique Easy-to-compute Approximate Inverse Maximumweight Basis |
| Content Type | Text |
