Hybrid Algorithms for Solving the Algebraic Eigenvalue Problem with Sparse Matrices

Hybrid algorithms for solving the partial generalized eigenvalue problem for symmetric positive definite sparse matrices of different structures by hybrid computers with graphic processors are proposed, coefficients for the efficiency of the algorithms are obtained, and approbation of the developed...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Cybernetics and systems analysis Ročník 53; číslo 6; s. 937 - 949
Hlavní autoři: Khimich, A. N., Popov, A. V., Chistyakov, O. V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2017
Springer
Springer Nature B.V
Témata:
Algorithms
Analysis
Artificial Intelligence
Control
Eigenvalues
Hybrid computers
Mathematical analysis
Mathematics
Mathematics and Statistics
Matrix methods
Processor Architectures
Processors
Software Engineering/Programming and Operating Systems
Software–Hardware Systems
Sparse matrices
Sparsity
Systems Theory
computer of hybrid architecture
conjugate gradient methods
algebraic eigenvalue problem
efficiency of parallel algorithms
hybrid algorithm
subspace iteration method
ISSN:1060-0396, 1573-8337
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Hybrid algorithms for solving the partial generalized eigenvalue problem for symmetric positive definite sparse matrices of different structures by hybrid computers with graphic processors are proposed, coefficients for the efficiency of the algorithms are obtained, and approbation of the developed algorithms for test and practical problems is carried out.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-017-9996-5