Parallel methods for tridiagonal equations (Q1106618)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4062470
Language Label Description Also known as
default for all languages
No label defined
    English
    Parallel methods for tridiagonal equations
    scientific article; zbMATH DE number 4062470

      Statements

      Parallel methods for tridiagonal equations (English)
      0 references
      0 references
      0 references
      1988
      0 references
      The authors present parallel adaptations of the Gauss-Seidel iterative method for solving tridiagonal systems of linear algebraic equations. Two of them possess a similarity to the marching principle developed previously for solving block-tridiagonal systems arising in the numerical solution of partial differential equations while the third one is based on the red-black ordering of the unknowns. The computational work is distributed proportionally among slave processors of the parallel system considered, yielding almost optimal speed-up values. The methods are compared from a point of view of the number of arithmetic and communication operations required. Through the parallelization a convergence property of the original methods is preserved. The experience achieved by the simulation can be applied also to other parallel MIMD-type computer configurations.
      0 references
      parallel methods
      0 references
      Gauss-Seidel iterative method
      0 references
      tridiagonal systems
      0 references
      red-black ordering
      0 references
      convergence
      0 references

      Identifiers