Parallel performance of a 3D elliptic solver
From MaRDI portal
block-circulant preconditionerscirculant block-factorizationconjugate gradient methodelliptic problemsperformancesparse linear systems
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)
Recommendations
- Parallel performance of a 3D elliptic solver
- The convergence rate and parallel performance of a 3D elliptic solver
- Benchmarking performance of parallel computers using a 2D elliptic solver
- Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems
- scientific article; zbMATH DE number 1241465
Cited in
(7)- Parallel complexity of conjugate gradient method with circulant block-factorization preconditioners for 3D elliptic problems
- Benchmarking performance of parallel computers using a 2D elliptic solver
- The convergence rate and parallel performance of a 3D elliptic solver
- Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗
- scientific article; zbMATH DE number 1241465 (Why is no real title available?)
- Parallel performance of an MPI solver for 3D elasticity problems
- Parallel performance of a 3D elliptic solver
This page was built for publication: Parallel performance of a 3D elliptic solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724539)