160 likes | 289 Views
Iterative Sectioning of High Dimensional Banded Matrices. Dmytro Fedasyuk, Pavlo Serdyuk, Yuriy Semchyshyn Software Department Lviv Polytechnic National University. Problem Statement: SLE. Problem Statement: Sectioning. Problem Statement: Example. Quality Criteria: Sectioning Smallness.
E N D
Iterative Sectioning of High Dimensional Banded Matrices Dmytro Fedasyuk, Pavlo Serdyuk, Yuriy Semchyshyn Software Department Lviv Polytechnic National University
Iterative (IT) Sectioning Algorithm • Get the initial sectioning using Bidirectional (BD) or Adjustable (AD) algorithm. • Iterate through all sections, from the first to the last, in case if one of them can be split into two separate sections — split this section. • Iterate through all pairs of consecutive sections from the first to the last, in case if some sections can be balanced by detaching some elements from larger of them and attaching to smaller — balance these sections. • If there is at least one splitting or balancing done while performing previous two steps — go to step IT2. • Return the result.
Experiment: Results (Charts) Sectioning Smallness Sectioning Accuracy
Application: Results Bidirectional (BD) Sectioning Algorithm Iterative (IT) Sectioning Algorithm