Algorithm for Elimination of Systems with Sparse Asymmetric Reducible Matrices.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24510%2F12%3A%230000796" target="_blank" >RIV/46747885:24510/12:#0000796 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Algorithm for Elimination of Systems with Sparse Asymmetric Reducible Matrices.
Original language description
In the paper, an algorithm for finding an optimal or almost optimal permutation for an ordering of elements of a matrix, which is sparse, asymmetric and reducible, is suggested. Using this algorithm we can solve large sparse systems of linear equations more efficiently. The algorithm is a modification of the known algorithm for symmetric irreducible matrices.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
O - Projekt operacniho programu
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ACC Journal
ISSN
1803-9782
e-ISSN
—
Volume of the periodical
XVIII
Issue of the periodical within the volume
4/2012/Issue D
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
7
Pages from-to
15-21
UT code for WoS article
—
EID of the result in the Scopus database
—