Precedence relationship minimization in numerically asymmetric matrix inverse factor calculations

Daniel Tylavsky, J. Ranganath, N. Shyam, S. X. Chen

Research output: Contribution to journalArticle

Abstract

A parallel algorithm for obtaining the inverse of the U triangular force of a non-numerically symmetric matrix A of dimension n × n is presented in this paper. The method proposed eliminates the precedence relationships involved with the backward substitution process, which is conventionally used to obtain the U-1 factors. The inverse factors are obtained by performing the factorization on an extended matrix AE, which is of dimension 2n × 2n. The method exploits the inherent parallelism in calculating the inverse factors during the forward sweep of the factorization process. Thus, a parallel factorization routine can be easily modified to calculate U-1 in parallel. Unlike traditional methods involving precedence relations, which require 2p sequential steps (where p is the length of the longest factor path), the proposed method involves only p + 1 precedence relationships.

Original languageEnglish (US)
Pages (from-to)27-33
Number of pages7
JournalElectric Power Systems Research
Volume28
Issue number1
DOIs
StatePublished - 1993

Fingerprint

Factorization
Parallel algorithms
Substitution reactions

Keywords

  • Elementary task
  • Extended matrix
  • Factorization path
  • Parallel factorization
  • Precedence relationships

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

Precedence relationship minimization in numerically asymmetric matrix inverse factor calculations. / Tylavsky, Daniel; Ranganath, J.; Shyam, N.; Chen, S. X.

In: Electric Power Systems Research, Vol. 28, No. 1, 1993, p. 27-33.

Research output: Contribution to journalArticle

@article{59a3cfe815024b678b1696b7d2165a32,
title = "Precedence relationship minimization in numerically asymmetric matrix inverse factor calculations",
abstract = "A parallel algorithm for obtaining the inverse of the U triangular force of a non-numerically symmetric matrix A of dimension n × n is presented in this paper. The method proposed eliminates the precedence relationships involved with the backward substitution process, which is conventionally used to obtain the U-1 factors. The inverse factors are obtained by performing the factorization on an extended matrix AE, which is of dimension 2n × 2n. The method exploits the inherent parallelism in calculating the inverse factors during the forward sweep of the factorization process. Thus, a parallel factorization routine can be easily modified to calculate U-1 in parallel. Unlike traditional methods involving precedence relations, which require 2p sequential steps (where p is the length of the longest factor path), the proposed method involves only p + 1 precedence relationships.",
keywords = "Elementary task, Extended matrix, Factorization path, Parallel factorization, Precedence relationships",
author = "Daniel Tylavsky and J. Ranganath and N. Shyam and Chen, {S. X.}",
year = "1993",
doi = "10.1016/0378-7796(93)90076-Q",
language = "English (US)",
volume = "28",
pages = "27--33",
journal = "Electric Power Systems Research",
issn = "0378-7796",
publisher = "Elsevier BV",
number = "1",

}

TY - JOUR

T1 - Precedence relationship minimization in numerically asymmetric matrix inverse factor calculations

AU - Tylavsky, Daniel

AU - Ranganath, J.

AU - Shyam, N.

AU - Chen, S. X.

PY - 1993

Y1 - 1993

N2 - A parallel algorithm for obtaining the inverse of the U triangular force of a non-numerically symmetric matrix A of dimension n × n is presented in this paper. The method proposed eliminates the precedence relationships involved with the backward substitution process, which is conventionally used to obtain the U-1 factors. The inverse factors are obtained by performing the factorization on an extended matrix AE, which is of dimension 2n × 2n. The method exploits the inherent parallelism in calculating the inverse factors during the forward sweep of the factorization process. Thus, a parallel factorization routine can be easily modified to calculate U-1 in parallel. Unlike traditional methods involving precedence relations, which require 2p sequential steps (where p is the length of the longest factor path), the proposed method involves only p + 1 precedence relationships.

AB - A parallel algorithm for obtaining the inverse of the U triangular force of a non-numerically symmetric matrix A of dimension n × n is presented in this paper. The method proposed eliminates the precedence relationships involved with the backward substitution process, which is conventionally used to obtain the U-1 factors. The inverse factors are obtained by performing the factorization on an extended matrix AE, which is of dimension 2n × 2n. The method exploits the inherent parallelism in calculating the inverse factors during the forward sweep of the factorization process. Thus, a parallel factorization routine can be easily modified to calculate U-1 in parallel. Unlike traditional methods involving precedence relations, which require 2p sequential steps (where p is the length of the longest factor path), the proposed method involves only p + 1 precedence relationships.

KW - Elementary task

KW - Extended matrix

KW - Factorization path

KW - Parallel factorization

KW - Precedence relationships

UR - http://www.scopus.com/inward/record.url?scp=43949166248&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43949166248&partnerID=8YFLogxK

U2 - 10.1016/0378-7796(93)90076-Q

DO - 10.1016/0378-7796(93)90076-Q

M3 - Article

AN - SCOPUS:43949166248

VL - 28

SP - 27

EP - 33

JO - Electric Power Systems Research

JF - Electric Power Systems Research

SN - 0378-7796

IS - 1

ER -