Data transport in Wang's partition method

DOI10.1016/0167-8191(88)90099-3zbMATH Open0638.65021OpenAlexW2006184207MaRDI QIDQ1099581FDOQ1099581

Authors: Peter H. Michielse, Henk A. van der Vorst 

Publication date: 1988

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90099-3

Recommendations

• A method to parallelize tridiagonal solvers
• A parallel partition method for solving banded systems of linear equations
• A parallel implementation of Wang's method for solving tridiagonal systems
• scientific article; zbMATH DE number 2051109
• Publication:4945785

zbMATH Keywords

computational complexityparallel solutiontridiagonal linear systemspartition methodbidiagonal systemdata transport

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• Stabilization and experience with the partitioning method for tridiagonal systems
• Application of the parallel diagonal dominant algorithm for the incompressible Navier-Stokes equations
• A parallel algorithm for circulant tridiagonal linear systems
• Geometric multigrid with applications to computational fluid dynamics
• An explicit-implicit method for a class of time-dependent partial differential equations
• On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization
• On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
• Parallel factorizations and parallel solvers for tridiagonal linear systems

This page was built for publication: Data transport in Wang's partition method

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