A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
We propose a new preconditioned global conjugate gradient (PGL-CG) method for the solution of matrix equation AXB = C, where A and B are sparse Stieltjes matrices. The preconditioner is based on the support graph preconditioners. By using Vaidya’s maximum spanning tree precon ditioner and BFS algori...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ferdowsi University of Mashhad
2019-10-01
|
| Series: | Iranian Journal of Numerical Analysis and Optimization |
| Subjects: | |
| Online Access: | https://ijnao.um.ac.ir/article_24842_e22c32b5a5cb091fd78c57bee9ba2c50.pdf |