Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
An efficient parallel triangular inversion by Gauss elimination with sweeping
Date
1998-01-01
Author
Kiper, A
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
4
views
0
downloads
A parallel computation model to invert a lower triangular matrix using Gauss elimination with sweeping technique is presented. Performance characteristics that we obtain are O(n) time and O(n(2)) processors leading to an efficiency of O(1/n). A comparative performance study with the available fastest parallel matrix inversion algorithms is given. We believe that the method presented here is superior over the existing methods in efficiency measure and in processor complexity.
Subject Keywords
Gauss Elimination
,
Lower Triangular Matrix
,
Speedup Ratio
,
Small Size Problem
,
Lower Triangular Part
URI
https://hdl.handle.net/11511/63425
Journal
EURO-PAR '98 PARALLEL PROCESSING
Collections
Department of Computer Engineering, Article