Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors

DOI10.1137/0911032zbMath0724.65023OpenAlexW2053498166MaRDI QIDQ3212182

Ching-Tien Ho, S. Lennart Johnsson

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911032

zbMATH Keywords

numerical simulationstridiagonal linear systemcomplexity estimatescomputer experimentsalternating direction methodsfast Poisson solversBoolean cube processorschoice of algorithmsIntel iPSC/1

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (6)

Matrix transpose on meshes with wormhole and XY routing ⋮ The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub ⋮ A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm ⋮ On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver ⋮ Parallel ADI solver based on processor scheduling ⋮ A parallel alternating direction implicit preconditioning method

This page was built for publication: Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors