Preconditioning methods based on spanning tree algorithms

D. V. Perevozkin, G. A. Omarova

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Article number012005
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 4 Jan 2021
EventInternational Conference on Marchuk Scientific Readings 2020, MSR 2020 - Akademgorodok, Novosibirsk, Russian Federation
Duration: 19 Oct 202023 Oct 2020


Dive into the research topics of 'Preconditioning methods based on spanning tree algorithms'. Together they form a unique fingerprint.

Cite this