Premium
Convergence of a balancing domain decomposition by constraints and energy minimization
Author(s) -
Mandel Jan,
Dohrmann Clark R.
Publication year - 2003
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.341
Subject(s) - preconditioner , mathematics , substructure , domain decomposition methods , minification , convergence (economics) , constraint (computer aided design) , domain (mathematical analysis) , mathematical optimization , decomposition method (queueing theory) , mathematical analysis , discrete mathematics , finite element method , iterative method , geometry , physics , structural engineering , engineering , economics , thermodynamics , economic growth
Abstract A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The substructure spaces consist of local functions with zero values of the constraints, while the coarse space consists of minimal energy functions with the constraint values continuous across substructure interfaces. In applications, the constraints include values at corners and optionally averages on edges and faces. The preconditioner is reformulated as an additive Schwarz method and analysed by building on existing results for balancing domain decomposition. The main result is a bound on the condition number based on inequalities involving the matrices of the preconditioner. Estimates of the form C (1+log 2 (H/h)) are obtained under the standard assumptions of substructuring theory. Computational results demonstrating the performance of method are included. Published in 2003 by John Wiley & Sons, Ltd.