Topological decomposition algorithm for optimized solution of a system of linear equations

Authors:
Hiroaki Yui;Satoshi Nishimura
Affiliations:
The University of Aizu, Aizu-wakamatsu City, Fukushima, Japan;The University of Aizu, Aizu-wakamatsu City, Fukushima, Japan
Venue:
Proceedings of the 2012 Joint International Conference on Human-Centered Computer Environments
Year:
2012

Citing 4
Cited 0

Parallel sparse LU decomposition on a mesh network of transputers

SIAM Journal on Matrix Analysis and Applications
The Reverse Bordering Method

SIAM Journal on Matrix Analysis and Applications
Data Structures and Algorithms

Data Structures and Algorithms
Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of techniques for the direct solution of large systems of linear equations have been developed. Some of them are widely known and used for non-sparse systems of linear equations: LU decomposition and Cholesky decomposition. On the other hand, for sparse matrices, there are different types of algorithms, which decompose a system of linear equations into a number of subsets of the system. However, in the past there is no discussion for algorithms to decompose a large system of linear equations. In this article, we propose an efficient decomposition algorithm to optimize total operation costs using graph theory.