An efficient spectral method for bisection of regular finite element meshes
From MaRDI portal
Recommendations
- Spectral partitioning works: planar graphs and finite element meshes
- Finite element mesh decomposition using complementary Laplacian matrix
- Bisection for parallel computing using Ritz and Fiedler vectors
- Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm
- Spectral methods for graph bisection problems.
Cited in
(3)
This page was built for publication: An efficient spectral method for bisection of regular finite element meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561661)