Standard

Arrowhead decomposition for a block-tridiagonal system of linear equations. / Belov, Pavel; Nugumanov, Eduard; Yakovlev, Sergey.

в: CEUR Workshop Proceedings, Том 1482, 01.01.2015, стр. 447-452.

Результаты исследований: Научные публикации в периодических изданиях › статья в журнале по материалам конференции › Рецензирование

Harvard

Belov, P, Nugumanov, E & Yakovlev, S 2015, 'Arrowhead decomposition for a block-tridiagonal system of linear equations', CEUR Workshop Proceedings, Том. 1482, стр. 447-452.

APA

Belov, P., Nugumanov, E., & Yakovlev, S. (2015). Arrowhead decomposition for a block-tridiagonal system of linear equations. CEUR Workshop Proceedings, 1482, 447-452.

Vancouver

Belov P, Nugumanov E, Yakovlev S. Arrowhead decomposition for a block-tridiagonal system of linear equations. CEUR Workshop Proceedings. 2015 Янв. 1;1482:447-452.

Author

Belov, Pavel ; Nugumanov, Eduard ; Yakovlev, Sergey. / Arrowhead decomposition for a block-tridiagonal system of linear equations. в: CEUR Workshop Proceedings. 2015 ; Том 1482. стр. 447-452.

BibTeX

@article{2b5b84eeb5284cd88b5a6b45da74f0fb,
title = "Arrowhead decomposition for a block-tridiagonal system of linear equations",
abstract = "The arrowhead decomposition method which allows efficient parallel solution of a blocktridiagonal system of linear equations is presented. The computational speedup with respect to the matrix sweeping algorithm is analytically estimated by taking into account the number of elementary operations of multiplication for the parallel and serial parts of the decomposition method. It is shown that the maximal speedup is achieved for the finite number of parallel processors. For a given size of the initial system of linear equations, the parameters of the computational system which give the maximal speedup are obtained. Computational experiments confirm the analytical estimations of the computational speedup.",
keywords = "Arrowhead decomposition method, Block-tridiagonal matrix, Computational speedup, Matrix sweeping algorithm, Parallel solution, System of linear equations",
author = "Pavel Belov and Eduard Nugumanov and Sergey Yakovlev",
year = "2015",
month = jan,
day = "1",
language = "English",
volume = "1482",
pages = "447--452",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "RWTH Aahen University",
note = "1st Russian Conference on Supercomputing Days 2015, RuSCDays 2015 ; Conference date: 28-09-2015 Through 29-09-2015",

}

RIS

TY - JOUR

T1 - Arrowhead decomposition for a block-tridiagonal system of linear equations

AU - Belov, Pavel

AU - Nugumanov, Eduard

AU - Yakovlev, Sergey

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The arrowhead decomposition method which allows efficient parallel solution of a blocktridiagonal system of linear equations is presented. The computational speedup with respect to the matrix sweeping algorithm is analytically estimated by taking into account the number of elementary operations of multiplication for the parallel and serial parts of the decomposition method. It is shown that the maximal speedup is achieved for the finite number of parallel processors. For a given size of the initial system of linear equations, the parameters of the computational system which give the maximal speedup are obtained. Computational experiments confirm the analytical estimations of the computational speedup.

AB - The arrowhead decomposition method which allows efficient parallel solution of a blocktridiagonal system of linear equations is presented. The computational speedup with respect to the matrix sweeping algorithm is analytically estimated by taking into account the number of elementary operations of multiplication for the parallel and serial parts of the decomposition method. It is shown that the maximal speedup is achieved for the finite number of parallel processors. For a given size of the initial system of linear equations, the parameters of the computational system which give the maximal speedup are obtained. Computational experiments confirm the analytical estimations of the computational speedup.

KW - Arrowhead decomposition method

KW - Block-tridiagonal matrix

KW - Computational speedup

KW - Matrix sweeping algorithm

KW - Parallel solution

KW - System of linear equations

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

M3 - Conference article

AN - SCOPUS:84954512125

VL - 1482

SP - 447

EP - 452

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

T2 - 1st Russian Conference on Supercomputing Days 2015, RuSCDays 2015

Y2 - 28 September 2015 through 29 September 2015

ER -

ID: 36558691