Fast Nested Dissection for Finite Element Meshes

DOI10.1137/S0895479895284282MaRDI QIDQ4339133zbMATH OpenOpenAlexFDO

Authors Shang-Hua Teng

Publication date 5 June 1997

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

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

zbMATH Keywords

3D point locationfinite element meshesgeometric samplinghierarchical computingmultilevel methodsnested dissectionseparatorssparse matrix computationsthe multigrid

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The analysis of a nested dissection algorithm
• scientific article; zbMATH DE number 432835
• Calculs de complexité relatifs à une méthode de dissection emboîtée
• Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver)

Cited in

(3)

• The analysis of a nested dissection algorithm
• Building graph separators with the recursive rotation algorithm for the nested dissection method
• Fast separator decomposition for finite element meshes

Describes a project that uses

Uses Software

• MESHPART

This page was built for publication: Fast Nested Dissection for Finite Element Meshes

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