A Domain Decomposition Algorithm Using a Hierarchical Basis

DOI10.1137/0911069zbMath0712.65101OpenAlexW2028192944MaRDI QIDQ3197267

Olof B. Widlund, Barry F. Smith

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911069

zbMATH Keywords

finite elementfast algorithmscondition numberdomain decomposition methodsNumerical experimentspreconditioned conjugate gradient methodshierarchical basis multigrid method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Hierarchical extension operators plus smoothing in domain decomposition preconditioners, Massively parallel methods for semiconductor device modelling, Sherman-Morrison-Woodbury-formula-based algorithms for the surface smoothing problem, Preconditioning the Poincaré-Steklov operator by using Green's function, Error estimates for the three-field formulation with bubble stabilization, Barycentric interpolation of interface solution for solving stochastic partial differential equations on non-overlapping subdomains with additive multi-noises, A finite difference domain decomposition method using local corrections for the solution of Poisson's equation, The three-field formulation for elasticity problems, Solving the Signorini problem on the basis of domain decomposition techniques, Parallel adaptive subspace correction schemes with applications to elasticity, On the Origins of Iterative Substructuring Methods