Preconditioned iterative methods for elliptic problems on decomposed domains

DOI10.1080/00207169208804091zbMath0763.65090OpenAlexW2005295558MaRDI QIDQ4021052

Timothy N. Phillips

Publication date: 17 January 1993

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804091

zbMATH Keywords

rate of convergencedomain decompositionconjugate gradient methodSchwarz alternating methodPoisson problemparallel computersSchur complement methodpreconditioned iterative method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Parallel numerical computation (65Y05)

Related Items (1)

Parallelized characteristic basis finite element method (CBFEM-MPI)-a non-iterative domain decomposition algorithm for electromagnetic scattering problems

Cites Work

• A preconditioning technique for the efficient solution of problems with local grid refinement
• A capacitance matrix method for Dirichlet problem on polygon region
• Analysis of Preconditioners for Domain Decomposition
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Parallel Performance of Domain-Decomposed Preconditioned Krylov Methods for PDE<scp>s</scp>with Locally Uniform Refinement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preconditioned iterative methods for elliptic problems on decomposed domains