Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Parallel Processing Architecture for Solving Large Scale Linear Systems
Details

Parallel Processing Architecture for Solving Large Scale Linear Systems

Date Issued
August 1, 2009
Author(s)
Nagari, Arun
Advisor(s)
Itamar Arel
Additional Advisor(s)
Fangxing Li, Hairong Qi
Abstract

Solving linear systems with multiple variables is at the core of many scienti…c problems. Parallel processing techniques for solving such system problems has have received much attention in recent years. A key theme in the literature pertains to the application of Lower triangular matrix and Upper triangular matrix(LU) decomposing, which factorizes an N N square matrix into two triangular matrices. The resulting linear system can be more easily solved in O(N2) work. Inher- ently, the computational complexity of LU decomposition is O(N3). Moreover, it is a challenging process to parallelize. A highly-parallel methodology for solving large-scale, dense, linear systems is proposed in this thesis by means of the novel application of Cramer’s Rule. A numerically stable scheme is described, yielding an overall computational complexity of O(N) with N2 processing units.

Disciplines
Computer Engineering
Degree
Master of Science
Major
Computer Engineering
Embargo Date
December 1, 2011
File(s)
Thumbnail Image
Name

NagariArun.pdf

Size

386.96 KB

Format

Adobe PDF

Checksum (MD5)

54149a3013cfc7efc0d6c601336194e8

Learn more about how TRACE supports reserach impact and open access here.

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify