On Distributed Solution for Simultaneous Linear Symmetric Systems

Cholesky Decomposition is the primary approach which is used to solve Symmetric and Positive Definite (SPD) systems but is inherently iterative making it very difficult to parallelize as calculations at each partition require elements from other partitions. In this paper, we present two distributed...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2020 IEEE International Conference on Big Data (Big Data) s. 5780 - 5782
Hlavní autoři: Misra, Chandan, Parasrampuria, Utkarsh, Bhattacharya, Sourangshu, Ghosh, Soumya K.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 10.12.2020
Témata:
Apache Spark
Big Data
Cholesky Decomposition
Distributed Algorithm
Iterative methods
Linear Algebra
Matrix decomposition
Matrix Inversion
Partitioning algorithms
Scalability
Sparks
Symmetric matrices
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Cholesky Decomposition is the primary approach which is used to solve Symmetric and Positive Definite (SPD) systems but is inherently iterative making it very difficult to parallelize as calculations at each partition require elements from other partitions. In this paper, we present two distributed block-recursive approaches to solve large SPD systems - the symmetric version of the state-of-the-art Strassen's algorithm and Cholesky based inversion algorithm. We show experimentally that both the approaches have good scalability and Cholesky based approach is more efficient as it uses fewer matrix multiplications in each recursion level than Strassen based algorithm.
DOI:10.1109/BigData50022.2020.9377840