A Cartesian Parallel Nested Dissection Algorithm
From MaRDI portal
Publication:4325690
DOI10.1137/S0895479892238270zbMath0815.65055OpenAlexW2043839703MaRDI QIDQ4325690
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
algorithmorderingparallel computationCholesky factorizationnested dissectionsymmetric positive definite sparse matrix
Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
An overview of graph covering and partitioning ⋮ A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers ⋮ Multiphysics simulation of flow-induced vibrations and aeroelasticity on parallel computing platforms ⋮ Dual multilevel optimization ⋮ A survey of direct methods for sparse linear systems ⋮ Automotive design applications of fluid flow simulation on parallel computing platforms
This page was built for publication: A Cartesian Parallel Nested Dissection Algorithm
