Abstract
Two methods which allow to solve non-symmetric sparsed systems of linear equations (SLEs) — Biconjugative Gradients (BiCG) and General Minimal Residuals (GMRES) methods — are described in this paper. Analysis of requirements to memory and computational speed is given; some results of application to finite- differences and finiteelements SLEs are shown. Some features of these methods connected with ABS-class presented by Abaffi and Spedicato are also discussed.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aspects of Computational Science. Stichting Nationale Computer Faciliteiten, The Netherlands, 1995.
V.P. IFyin. The incomplete factorization methods for solving linear systems. Moscow, Fizmatlit, 1995. [In Russian]
J. Orthega. Introduction to Parallel and Vector Solution of Linear Systems. Plenum Press, New York, 1988.
M.Balandin, O.Chernyshev, E.Shurina, A.Vazhenin. On parallelization of new method for solving systems of linear equations. Bulletin of Novosibirsk Computer Center, Vo1.2, pp.36–45. Novosibirsk, 1996.
Balandin M.J., Shurina E.P., Chernyshev O.V. Analysis of parallel algorithms for solving ill-conditioned SLEs. Proceedings of Third International Scientific-Technical Conference “Actual Problems of Electronic Instrument Engineering” (APEIE-96), Novosibirsk, 1996. Vol.6, part l.pp.74–77. [In Russian]
J.Abaffi, E.Spedicato. ABS Projections Algorithms: Mathematical Techniques for Linear and Non-linear Equations. Ellis Horwood Ltd Publishers, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balandin, M., Chernyshev, O., Shurina, E. (1997). Analysis of methods for solving large-scale non-symmetric linear systems with sparsed matrices. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_34
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive