A parallel preconditioned conjugate gradient method using domain decomposition and inexact solvers on each subdomain
domain decompositionfinite elementmultiprocessor system with message passing architecturepreconditioned conjugate gradient solution strategyspectral condition number
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) 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) Parallel numerical computation (65Y05)
This paper describes a preconditioned conjugate gradient solution strategy for a multiprocessor system with message passing architecture. The preconditioner combines two techniques, a Schur-complement preconditioning over ``coupling boundaries between the subdomains and an arbitrary choice of classic preconditioning for the inner degrees of freedom of each subdomain. All computational work on the single subdomains is carried out in parallel by distributing the subdomain data over the processor network before starting the finite element solution process (including generating the element matrices and assembling the local subdomain stiffness matrix). The resulting spectral condition number of the entire preconditioner is estimated. For the important example of choosing \(MIC(0)\)-\({}^*\)- preconditioning on the subdomains, the condition number obtained is essentially the product of the two condition numbers involved.
- A finite element - capacitance method for elliptic problems on regions partitioned into subregions
- A generalized SSOR method
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Complexity of Parallel Implementation of Domain Decomposition Techniques for Elliptic Partial Differential Equations
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- The Neumann-Dirichlet domain decomposition method with inexact solvers on the subdomains
- The approximate Dirichlet domain decomposition method. I: An algebraic approach
- The hierarchial preconditioning on unstructured grids
- Hierarchical extension operators plus smoothing in domain decomposition preconditioners
- The efficient parallel solution of PDEs
- Parallel solution techniques in computational structural mechanics
- A parallel mixed finite element implementation of fourth-order plate bending problems in distributed memory environments
- A hierarchical iterative procedure for the analysis of composite laminates
- scientific article; zbMATH DE number 4213376 (Why is no real title available?)
- Damped Jacobi Preconditioning and Coarse Grid Deflation for Conjugate Gradient Iteration on Parallel Computers
- The non-overlapping domain decomposition multiplicative schwarz method
- scientific article; zbMATH DE number 549877 (Why is no real title available?)
- scientific article; zbMATH DE number 554528 (Why is no real title available?)
- scientific article; zbMATH DE number 1138073 (Why is no real title available?)
- scientific article; zbMATH DE number 1875373 (Why is no real title available?)
- A parallel version of the preconditioned conjugate gradient method for boundary element equations
- A brief history of the parallel dawn in Karl-Marx-Stadt/Chemnitz
- scientific article; zbMATH DE number 270063 (Why is no real title available?)
- scientific article; zbMATH DE number 2225823 (Why is no real title available?)
This page was built for publication: A parallel preconditioned conjugate gradient method using domain decomposition and inexact solvers on each subdomain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639591)
