A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes

DOI10.1137/0913049zbMath0757.65121OpenAlexW1998183519MaRDI QIDQ3992224

John R. Rice, Mo Mu

Publication date: 13 August 1992

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

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

zbMATH Keywords

complexitysparse matriceshypercubesexperimental resultsparallel methodscommunication efficiencygrid-based subtree-subcube assignment strategynested dissection indexingnonsymmetric sparse solver

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (2)

Parallel implementation of finite-element/Newton method for solution of steady-state and transient nonlinear partial differential equations ⋮ An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations

This page was built for publication: A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes