Fast separator decomposition for finite element meshes

DOI10.1007/3-540-61332-3_152MaRDI QIDQ6184663zbMATH OpenOpenAlexFDO

Authors

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61332-3_152

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Fast Nested Dissection for Finite Element Meshes
• scientific article; zbMATH DE number 432835
• Geometric Separators for Finite-Element Meshes
• A dynamic separator algorithm
• Planar separators and parallel polygon triangulation.

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3555381 (Why is no real title available?)
• scientific article; zbMATH DE number 554764 (Why is no real title available?)
• scientific article; zbMATH DE number 741113 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• A compact row storage scheme for Cholesky factors using elimination trees
• A guided tour of Chernoff bounds
• Condition of finite element matrices generated from nonuniform meshes.
• Cutting hyperplanes for divide-and-conquer
• Faster shortest-path algorithms for planar graphs
• Generalized Nested Dissection
• Nested Dissection of a Regular Finite Element Mesh
• Probability Inequalities for Sums of Bounded Random Variables
• The Role of Elimination Trees in Sparse Factorization
• The analysis of a nested dissection algorithm

This page was built for publication: Fast separator decomposition for finite element meshes

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