×

zbMATH — the first resource for mathematics

Solving 3D block bidiagonal linear systems on vector computers. (English) Zbl 0679.65021
Different techniques are described for the vectorization of the solution of 3D-block bidiagonal systems. The proposed methods are directly applicable to ETA-10 family of supercomputers and can be adapted to other vector computers. Preconditioning techniques are discussed and examples are given showing the efficiency of the proposed methods.
Reviewer: R.P.Tewarson

MSC:
65F10 Iterative numerical methods for linear systems
65Y05 Parallel numerical computation
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ashcraft, C.C.; Grimes, R.G., On vectorizing incomplete factorizations and SSOR preconditioners, SIAM J. sci. statist. comput., 9, 1, 122-151, (1988) · Zbl 0641.65028
[2] Eisenstat, S.C., Efficient implementation of a class of preconditioned conjugate gradient methods, SIAM J. sci. statist. comput., 2, 1-4, (1981) · Zbl 0474.65020
[3] Meijerink, J.A.; van der Vorst, H.A., Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems, J. comput. phys., 44, 1, 134-155, (1981) · Zbl 0472.65028
[4] van der Vorst, H.A., The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers, Parallel comput., 3, 49-58, (1986) · Zbl 0608.65021
[5] van der Vorst, H.A., (M)ICCG for 2D problems on vector computers, () · Zbl 0608.65021
[6] H.A. van der Vorst, High performance preconditioning, SIAM J. Sci. Statist. Comput., to appear. · Zbl 0693.65027
[7] van der Vorst, H.A., ICCG and related methods for 3D problems on vector computers, Comput. phys. comm., 53, 223-235, (1989) · Zbl 0798.65036
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.