Algorithms of parallel computations for linear algebra problems with irregularly structured matrices

Parallel algorithms for direct methods of analysis and solution of linear algebra problems with sparse symmetric irregularly structured matrices are considered. The performance of such algorithms is investigated. Upper estimates of the speedup and efficiency factors are obtained for a parallel algor...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Cybernetics and systems analysis Ročník 47; číslo 6; s. 973 - 985
Hlavní autori: Khimich, A. N., Popov, A. V., Polyankoa, V. V.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.11.2011
Springer
Springer Nature B.V
Predmet:
Algebra
Algorithms
Analysis
Artificial Intelligence
Computer simulation
Computers
Control
Cybernetics
Digitization
Efficiency
Eigenvalues
Estimates
Iterative methods
Linear algebra
Mathematical models
Mathematics
Mathematics and Statistics
Matrix
Parallel processing
Processor Architectures
Regularization methods
Software Engineering/Programming and Operating Systems
Software utilities
Sparse matrices
Sparsity
Structured matrices
Studies
Systems Theory
efficiency
sparse symmetric matrix
parallel algorithm
linear algebra
ISSN:1060-0396, 1573-8337
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Parallel algorithms for direct methods of analysis and solution of linear algebra problems with sparse symmetric irregularly structured matrices are considered. The performance of such algorithms is investigated. Upper estimates of the speedup and efficiency factors are obtained for a parallel algorithm for triangular decomposition of sparse matrices. Some results of numerical experiments carried out on a MIMD computer are given.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-011-9377-4