Skip to main content

Parallel direct algorithms for solution of sparse linear systems

  • Posters
  • Conference paper
  • First Online:
  • 227 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1277))

Abstract

Parallel direct algorithms for solving the scalar tridiagonal and five-diagonal systems of equations and vector systems of equations with block tridiagonal matrix coefficients are considered and their numerical stability is investigated.

This is a preview of subscription content, log in via an institution.

References

  1. Yanenko, N.N., Konovalov, A.N., Bugrov, A.N., Shustov, G.V.: About organization of parallel calculations and parallelizing of Gauss algorithm for tridiagonal systems. Num. Methods Mech. Cont. Medium. Novosibirsk 9(7) (1978) 139–146 (in Russian)

    Google Scholar 

  2. Akimova, E.N.: Parallel Gauss algorithm for vector systems with block tridiagonal matrices. Mathem. Modeling 6(9) (1994) 61–67 (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akimova, E.N. (1997). Parallel direct algorithms for solution of sparse linear systems. 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_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-63371-5_42

  • 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

Publish with us

Policies and ethics