Fast separator decomposition for finite element meshes
DOI10.1007/3-540-61332-3_152zbMATH Open1529.68320OpenAlexW1608272921MaRDI QIDQ6184663FDOQ6184663
Author name not available (Why is that?)
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
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)
Cites Work
- Title not available (Why is that?)
- The analysis of a nested dissection algorithm
- Generalized Nested Dissection
- Probability Inequalities for Sums of Bounded Random Variables
- Nested Dissection of a Regular Finite Element Mesh
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- A guided tour of Chernoff bounds
- Title not available (Why is that?)
- The Role of Elimination Trees in Sparse Factorization
- Title not available (Why is that?)
- Condition of finite element matrices generated from nonuniform meshes.
- Faster shortest-path algorithms for planar graphs
- Cutting hyperplanes for divide-and-conquer
- A compact row storage scheme for Cholesky factors using elimination trees
- Title not available (Why is that?)
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)
