A Domain Decomposition Algorithm Using a Hierarchical Basis

DOI10.1137/0911069zbMath0712.65101MaRDI 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 element; fast algorithms; condition number; domain decomposition methods; Numerical experiments; preconditioned conjugate gradient methods; hierarchical basis multigrid method

Mathematics Subject Classification ID

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

35J25: Boundary value problems for second-order elliptic equations

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

Related Items

Preconditioning the Poincaré-Steklov operator by using Green's function, A finite difference domain decomposition method using local corrections for the solution of Poisson's equation, Solving the Signorini problem on the basis of domain decomposition techniques, Hierarchical extension operators plus smoothing in domain decomposition preconditioners, Sherman-Morrison-Woodbury-formula-based algorithms for the surface smoothing problem, Parallel adaptive subspace correction schemes with applications to elasticity, Massively parallel methods for semiconductor device modelling, Error estimates for the three-field formulation with bubble stabilization, The three-field formulation for elasticity problems