BSP linear solvers for dense matrices-Reference-Cited by-同舟云学术

BSP linear solvers for dense matrices

Published:1998-06 Issue:5-6 Volume:24 Page:777-795
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Evans D.J,Barulli M

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference13 articles.

1. A bridging model for parallel computation;Valiant;Commun. ACM,1990

2. Implicit matrix elimination (IME) schemes;Evans;Int. J. Comput. Math.,1993

3. Implicit Gauss–Jordan scheme for the solution of linear systems;Barulli;Parallel Algorithms Applicat.,1996

4. R. Miller, J. Reed, The Oxford BSP Library User Guide, version 1.0, Oxford Parallel, Oxford University Computing Laboratory, 1993.

5. G. Golub, C. Van Loan, Matrix Computations, Johns Hopkins Press, 1983.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The block WZ factorization;Journal of Computational and Applied Mathematics;2018-03

2. Quadrant interlocking factorization of hourglass matrix;AIP Conference Proceedings;2018

3. Influence of Preconditioning and Blocking on Accuracy in Solving Markovian Models;International Journal of Applied Mathematics and Computer Science;2009-06-01

4. Analysis and Comparison of Reordering for Two Factorization Methods (LU and WZ) for Sparse Matrices;Computational Science – ICCS 2008;2008

5. An overlapped two-way method for solving tridiagonal linear systems in a BSP computer;Applied Mathematics and Computation;2005-02