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

DOI10.1137/0913049MaRDI QIDQ3992224zbMATH OpenOpenAlexFDO

Authors Mo Mu, John R. Rice

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

sparse matricescomplexityhypercubesexperimental 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)

Recommendations

• scientific article; zbMATH DE number 4064410
• A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
• Communication results for parallel sparse Cholesky factorization on a hypercube
• scientific article; zbMATH DE number 4064411
• Hypercube Algorithms and Implementations

Cited in

(3)

• Parallel implementation of finite-element/Newton method for solution of steady-state and transient nonlinear partial differential equations
• scientific article; zbMATH DE number 6529800 (Why is no real title available?)
• 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

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