A Cartesian Parallel Nested Dissection Algorithm

DOI10.1137/S0895479892238270MaRDI QIDQ4325690zbMATH OpenOpenAlexFDO

Authors Michael T. Heath, Padma Raghavan

Publication date 13 March 1995

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

algorithmCholesky factorizationnested dissectionorderingparallel computationsymmetric positive definite sparse matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Recommendations

• Parallel nested dissection
• scientific article; zbMATH DE number 4030966
• scientific article; zbMATH DE number 434528
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• Parallel ordering using edge contraction

Cited in

(10)

• Automotive design applications of fluid flow simulation on parallel computing platforms
• Multiphysics simulation of flow-induced vibrations and aeroelasticity on parallel computing platforms
• An overview of graph covering and partitioning
• Dual multilevel optimization
• A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
• scientific article; zbMATH DE number 434528 (Why is no real title available?)
• scientific article; zbMATH DE number 4030966 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• Hybrid Sparse Linear Solutions with Substituted Factorization
• Parallel nested dissection

This page was built for publication: A Cartesian Parallel Nested Dissection Algorithm

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