Partitioning PDE computations: Methods and performance evaluation
Cholesky factorizationcoarse grain partitioningFLEX/32 multicomputerparallel architecturespartitioning methodspline collocations
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Parallel numerical computation (65Y05) Applications to the sciences (65Z05)
The methodology of coarse grain partitioning of computations on parallel architectures is presented. The method is oriented to minimizing interprocessor communication. The methodology performance is both discussed and evaluated for the FLEX/32 implementation of some applications (Cholesky factorization, spline collocations).
- Mesh partitioning algorithms for the parallel solution of partial differential equations
- Partitioning and dynamic load balancing for the numerical solution of partial differential equations
- scientific article; zbMATH DE number 1174630
- Domain decomposition methods for solving parabolic PDEs on multiprocessors
- Partition of unity methods for heterogeneous domain decomposition
- Partitioning strategies in Runge-Kutta type methods
- The influence of partitioning on domain decomposition convergence rates
- Domain decomposition and parallel processing for the numerical solution of partial differential equations
- scientific article; zbMATH DE number 822241
- scientific article; zbMATH DE number 4209523
This page was built for publication: Partitioning PDE computations: Methods and performance evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580937)
