Parallel algorithms for solving tridiagonal network equations by encountering runs method

zbMATH Open1095.65021MaRDI QIDQ5480130FDOQ5480130

Authors: D. I. Golovashkin 

Publication date: 26 July 2006

Full work available at URL: http://mathnet.ru/eng/mm/v17/i11/p118

Recommendations

• scientific article; zbMATH DE number 4003350
• scientific article; zbMATH DE number 624932
• Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations
• Parallel minimal norm method for tridiagonal linear systems
• Analysis of a parallel solution method for tridiagonal linear systems

zbMATH Keywords

parallel algorithmsmethod of encountering runs

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Cited In (1)

• Параллельный алгоритм метода циклической редукции для периодической краевой задачи

This page was built for publication: Parallel algorithms for solving tridiagonal network equations by encountering runs method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480130)