Preconditioning methods based on spanning tree algorithms

Abstract

Abstract The work continues the research performed by Chen and Toledo as a follow-up to Vaidya’s talk. The preconditioners being discussed are based on spanning tree algorithms where the input is the graph arising from the matrix of the system of linear algebraic equations (SLAE). The methods are considered in application to solving various SLAEs with real symmetric and non-symmetric matrices. The research shows that the application area of the preconditioners in question may significantly differ from the domain indicated in the literature.