Fast separator decomposition for finite element meshes

DOI10.1007/3-540-61332-3_152zbMath1529.68320OpenAlexW1608272921MaRDI QIDQ6184663

No author found.

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) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• The analysis of a nested dissection algorithm
• Cutting hyperplanes for divide-and-conquer
• The Role of Elimination Trees in Sparse Factorization
• A compact row storage scheme for Cholesky factors using elimination trees
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• Probability Inequalities for Sums of Bounded Random Variables
• Condition of finite element matrices generated from nonuniform meshes.
• Nested Dissection of a Regular Finite Element Mesh
• Faster shortest-path algorithms for planar graphs

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