Solving Composite Problems with Interface Relaxation

DOI10.1137/S1064827597321180zbMath0941.65125MaRDI QIDQ4253068

Mo Mu

Publication date: 24 June 1999

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

zbMATH Keywords

algorithms; convergence; domain decomposition; numerical experiments; preconditioning; error analysis; interface relaxations; composite PDEs

Mathematics Subject Classification ID

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

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

65N15: Error bounds for boundary value problems involving PDEs

65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs

65F10: Iterative numerical methods for linear systems

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

65N06: Finite difference methods for boundary value problems involving PDEs

Related Items

Unnamed Item, A decoupling two‐grid algorithm for the mixed Stokes‐Darcy model with the Beavers‐Joseph interface condition, On accelerated convergence of nonoverlapping Schwarz methods, Finite element simulations of window Josephson junctions, A two-grid decoupling method for the mixed Stokes-Darcy model, A modified local and parallel finite element method for the mixed Stokes-Darcy model, A modified two-grid method for solving coupled Navier-Stokes/Darcy model based on Newton iteration, Analysis of an interface relaxation method for composite elliptic differential equations, An experimental study of interface relaxation methods for composite elliptic differential equations, Interface relaxation algorithms for BEM-BEM coupling and FEM-BEM coupling., Fine tuning interface relaxation methods for elliptic differential equations, Interface relaxation FEM-BEM coupling method for elasto-plastic analysis