Bisection for parallel computing using Ritz and Fiedler vectors
From MaRDI portal
algorithmeigenvalue problemFiedler vectorfinite element mesheslarge-scale finite element modelsnumerical examplesparallel computationpseudoperipheral nodesRitz matrixRitz vectorsshortest route treesweighted incidence graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Parallel numerical computation (65Y05)
Recommendations
- An efficient spectral method for bisection of regular finite element meshes
- Finite element mesh decomposition using complementary Laplacian matrix
- scientific article; zbMATH DE number 1526386
- Spectral trisection of finite element models
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Cited in
(5)- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration
- On the parallel Risch algorithm (III)
- An efficient spectral method for bisection of regular finite element meshes
- Finite element mesh decomposition using complementary Laplacian matrix
- Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
This page was built for publication: Bisection for parallel computing using Ritz and Fiedler vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1875856)