The block WZ factorization

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:331

Article

Bylina, Beata¹ 

[1] Marie Curie Sklodowska Univ, Inst Math, Lublin, Poland

关键词: WZ factorization;    Block algorithm;    Solution of linear systems;    Quadrant interlocking factorization;    Memory hierarchy;   

DOI  :  10.1016/j.cam.2017.10.004

来源: Elsevier

【 摘 要 】

In the paper the author presents a novel kind of the WZ factorization algorithm, namely a block WZ factorization algorithm. The aim of this new algorithm is to utilize the computational power of contemporary computers with hierarchical memory. In the paper, some properties of the matrix Z are given and analyzed. Next, a version of the block WZ factorization is presented. The author shows that such a block WZ factorization exists for strictly diagonally dominant matrices. The computational cost of this block algorithm is presented. The time and the accuracy of proposed block WZ factorization algorithm for random dense square diagonally dominant matrices are reported. The block algorithm turned out to be faster even up to 300 times than the original WZ factorization. (C) 2017 Elsevier B.V. All rights reserved.

【 授权许可】

Free