The arrowhead decomposition method for a block-tridiagonal system of linear equations

Standard

The arrowhead decomposition method for a block-tridiagonal system of linear equations. / Belov, P. A.; Nugumanov, E. R.; Yakovlev, S. L.

In: Journal of Physics: Conference Series, Vol. 929, No. 1, 012035, 27.11.2017.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{3445799b10434906b34b5453ef7948d8,

title = "The arrowhead decomposition method for a block-tridiagonal system of linear equations",

abstract = "The arrowhead decomposition method (ADM) for the parallel solution of a block-tridiagonal system of linear equations is presented. The method consists in rearranging the initial linear system into an equivalent one with the {"}arrowhead{"} structure of the matrix. It is shown that such a structure provides a good opportunity for parallel solving. The computational speedup of ADM with respect to the sequential matrix Thomas algorithm is analytically estimated based on the number of elementary multiplicative operations for the parallel and serial parts of the methods. A number of parallel processors required to reach the maximum computational speedup is found. A good agreement of the analytical estimations of the computational speedup and practically obtained results is observed.",

author = "Belov, {P. A.} and Nugumanov, {E. R.} and Yakovlev, {S. L.}",

year = "2017",

month = nov,

day = "27",

doi = "10.1088/1742-6596/929/1/012035",

language = "English",

volume = "929",

journal = "Journal of Physics: Conference Series",

issn = "1742-6588",

publisher = "IOP Publishing Ltd.",

number = "1",

}

RIS

TY - JOUR

T1 - The arrowhead decomposition method for a block-tridiagonal system of linear equations

AU - Belov, P. A.

AU - Nugumanov, E. R.

AU - Yakovlev, S. L.

PY - 2017/11/27

Y1 - 2017/11/27

N2 - The arrowhead decomposition method (ADM) for the parallel solution of a block-tridiagonal system of linear equations is presented. The method consists in rearranging the initial linear system into an equivalent one with the "arrowhead" structure of the matrix. It is shown that such a structure provides a good opportunity for parallel solving. The computational speedup of ADM with respect to the sequential matrix Thomas algorithm is analytically estimated based on the number of elementary multiplicative operations for the parallel and serial parts of the methods. A number of parallel processors required to reach the maximum computational speedup is found. A good agreement of the analytical estimations of the computational speedup and practically obtained results is observed.

AB - The arrowhead decomposition method (ADM) for the parallel solution of a block-tridiagonal system of linear equations is presented. The method consists in rearranging the initial linear system into an equivalent one with the "arrowhead" structure of the matrix. It is shown that such a structure provides a good opportunity for parallel solving. The computational speedup of ADM with respect to the sequential matrix Thomas algorithm is analytically estimated based on the number of elementary multiplicative operations for the parallel and serial parts of the methods. A number of parallel processors required to reach the maximum computational speedup is found. A good agreement of the analytical estimations of the computational speedup and practically obtained results is observed.

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

U2 - 10.1088/1742-6596/929/1/012035

DO - 10.1088/1742-6596/929/1/012035

M3 - Article

AN - SCOPUS:85039063269

VL - 929

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

SN - 1742-6588

IS - 1

M1 - 012035

ER -

ID: 13946214