Data transport in Wang's partition method

DOI10.1016/0167-8191(88)90099-3zbMath0638.65021OpenAlexW2006184207MaRDI QIDQ1099581

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

zbMATH Keywords

computational complexityparallel solutiontridiagonal linear systemspartition methodbidiagonal systemdata transport

Mathematics Subject Classification ID

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

Related Items (7)

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

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