scientific article; zbMATH DE number 1526386
algorithmcombinatorial graph theorydomain decompositioneigenvalueeigenvectorfinite elementhybrid methodLanczos methodLaplacian matrixnumerical examplesparallel computingspectral bisection
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
A hybrid method for domain decomposition, employing combinatorial and algebraic graph theoretical algorithms, is presented. The approach uses the combinatorial graph theory for partial decomposition and then the spectral bisection approach. The spectral bisection is an algebraic graph method by which the associate graph of a finite element model is decomposed into two subgraphs. The optimality conditions consist of the equality of the numbers of nodes in the two subgraphs and minimality of the number of interface nodes. The Laplacian matrix is used to select a minimal cut set. The second eigenvalue and eigenvector of the Laplacian matrix are iteratively computed by the Lanczos method. For graph partitioning a hybrid method is proposed. In this algorithm the pseudo-peripheral nodes of the associate graph are first obtained. Four examples of partitioning illustrate the computational results.
- Finite element mesh decomposition using complementary Laplacian matrix
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis
- Min-max-boundary domain decomposition
- Min-max-boundary domain decomposition
- A parallel grid modification and domain decomposition algorithm for local phenomena capturing and load balancing
- Non-uniform and dynamic domain decompositions for hypercomputing
- Bisection for parallel computing using Ritz and Fiedler vectors
- Spectral trisection of finite element models
- scientific article; zbMATH DE number 37759 (Why is no real title available?)
- Strategies of domain decomposition for the design of parallel algorithms
- Finite element mesh decomposition using complementary Laplacian matrix
- scientific article; zbMATH DE number 218077 (Why is no real title available?)
- scientific article; zbMATH DE number 218084 (Why is no real title available?)
- scientific article; zbMATH DE number 218294 (Why is no real title available?)
- A new algorithm for domain decomposition of finite element models
- A study of domain decomposition and parallel computation
- A new era in scientific computing: domain decomposition methods in hybrid CPU-GPU architectures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513041)