Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor

It is shown that in sparse matrices arising from electronic circuits, it is possible to do computations on many diagonal elements simultaneously. A technique for obtaining an ordered compatible set directly from the ordered incompatible table is given. The ordering is based on the Markowitz number o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computers 1989-11, Vol.38 (11), p.1539-1557
Hauptverfasser:	Alaghband, G., Jordan, H.F.
Format:	Artikel
Sprache:	eng
Schlagworte:	990200 - Mathematics & Computers Algorithmics. Computability. Computer arithmetics ALGORITHMS Applied sciences ARRAY PROCESSORS Binary trees Chemical analysis Circuit simulation Computer science control theory systems Computer Systems Exact sciences and technology GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE Linear systems MATHEMATICAL LOGIC Matrix decomposition NASA Nonlinear equations PARALLEL PROCESSING PARAMETRIC ANALYSIS PROGRAMMING Sparse matrices Theoretical computing Very large scale integration
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!