LESSA: An Array to Solve a Set of Linear Equations

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A dedicated linear array of simple processors is proposed to solve a set of linear equations. Data structure and algorithm also presented for the array to solve a set of n linear equations in 0(«2+ 3n) time on an array of n processors. The given algorithm is a paralIelization of the Gaussian elimination algorithm. The data input to the array is purely sequential. The algorithm is optimal, within a constant, in its lime and area requirements.

Original languageEnglish (US)
Pages (from-to)297-309
Number of pages13
JournalInternational Journal of Computer Mathematics
Volume21
Issue number3-4
DOIs
StatePublished - Jan 1 1987
Externally publishedYes

Fingerprint

Linear equations
Linear equation
Algorithms and Data Structures
Gaussian elimination
Linear Array
Lime
Data structures
Requirements

Keywords

  • area-time performance
  • Gaussian elimination
  • parallel algorithms
  • Systolic array

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

LESSA : An Array to Solve a Set of Linear Equations. / Sarkar, Dilip.

In: International Journal of Computer Mathematics, Vol. 21, No. 3-4, 01.01.1987, p. 297-309.

Research output: Contribution to journalArticle

@article{a50e81b765f64dd1ac08fc4957ec37fd,
title = "LESSA: An Array to Solve a Set of Linear Equations",
abstract = "A dedicated linear array of simple processors is proposed to solve a set of linear equations. Data structure and algorithm also presented for the array to solve a set of n linear equations in 0(«2+ 3n) time on an array of n processors. The given algorithm is a paralIelization of the Gaussian elimination algorithm. The data input to the array is purely sequential. The algorithm is optimal, within a constant, in its lime and area requirements.",
keywords = "area-time performance, Gaussian elimination, parallel algorithms, Systolic array",
author = "Dilip Sarkar",
year = "1987",
month = "1",
day = "1",
doi = "10.1080/00207168708803572",
language = "English (US)",
volume = "21",
pages = "297--309",
journal = "International Journal of Computer Mathematics",
issn = "0020-7160",
publisher = "Taylor and Francis Ltd.",
number = "3-4",

}

TY - JOUR

T1 - LESSA

T2 - An Array to Solve a Set of Linear Equations

AU - Sarkar, Dilip

PY - 1987/1/1

Y1 - 1987/1/1

N2 - A dedicated linear array of simple processors is proposed to solve a set of linear equations. Data structure and algorithm also presented for the array to solve a set of n linear equations in 0(«2+ 3n) time on an array of n processors. The given algorithm is a paralIelization of the Gaussian elimination algorithm. The data input to the array is purely sequential. The algorithm is optimal, within a constant, in its lime and area requirements.

AB - A dedicated linear array of simple processors is proposed to solve a set of linear equations. Data structure and algorithm also presented for the array to solve a set of n linear equations in 0(«2+ 3n) time on an array of n processors. The given algorithm is a paralIelization of the Gaussian elimination algorithm. The data input to the array is purely sequential. The algorithm is optimal, within a constant, in its lime and area requirements.

KW - area-time performance

KW - Gaussian elimination

KW - parallel algorithms

KW - Systolic array

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

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

U2 - 10.1080/00207168708803572

DO - 10.1080/00207168708803572

M3 - Article

AN - SCOPUS:84943457974

VL - 21

SP - 297

EP - 309

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 3-4

ER -