World Library  
Flag as Inappropriate
Email this Article

Schur complement method

Article Id: WHEBN0016269477
Reproduction Date:

Title: Schur complement method  
Author: World Heritage Encyclopedia
Language: English
Subject: Neumann–Neumann methods, Domain decomposition methods, Poincaré–Steklov operator, FETI-DP, Abstract additive Schwarz method
Collection: Domain Decomposition Methods
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Schur complement method

In numerical analysis, the Schur complement method, named after Issai Schur, is the basic and the earliest version of non-overlapping domain decomposition method, also called iterative substructuring. A finite element problem is split into non-overlapping subdomains, and the unknowns in the interiors of the subdomains are eliminated. The remaining Schur complement system on the unknowns associated with subdomain interfaces is solved by the conjugate gradient method.

The method and implementation

Suppose we want to solve the Poisson equation

-\Delta u = f, \qquad u|_{\partial\Omega} = 0

on some domain Ω. When we discretize this problem we get an N-dimensional linear system AU = F. The Schur complement method splits up the linear system into sub-problems. To do so, divide Ω into two subdomains Ω1, Ω2 which share an interface Γ. Let U1, U2 and UΓ be the degrees of freedom associated with each subdomain and with the interface. We can then write the linear system as

\left[\begin{matrix} A_{11} & 0 & A_{1\Gamma} \\ 0 & A_{22} & A_{2\Gamma} \\ A_{\Gamma 1} & A_{\Gamma 2} & A_{\Gamma\Gamma}\end{matrix}\right]\left[\begin{matrix} U_1 \\ U_2 \\ U_\Gamma\end{matrix}\right] = \left[\begin{matrix} F_1 \\ F_2 \\ F_\Gamma\end{matrix}\right],

where F1, F2 and FΓ are the components of the load vector in each region.

The Schur complement method proceeds by noting that we can find the values on the interface by solving the smaller system

\Sigma U_\Gamma = F_\Gamma - A_{\Gamma 1}A_{11}^{-1}F_1 - A_{\Gamma 2}A_{22}^{-1}F_2,

for the interface values UΓ, where we define the Schur complement matrix

\Sigma = A_{\Gamma\Gamma} - A_{\Gamma 1}A_{11}^{-1}A_{1\Gamma} - A_{\Gamma 2}A_{22}^{-1}A_{2\Gamma}.

The important thing to note is that the computation of any quantities involving A_{11}^{-1} or A_{22}^{-1} involves solving decoupled Dirichlet problems on each domain, and these can be done in parallel. Consequently, we need not store the Schur complement matrix explicitly; it is sufficient to know how to multiply a vector by it.

Once we know the values on the interface, we can find the interior values using the two relations

A_{11}U_1 = F_1 - A_{1\Gamma}U_\Gamma, \qquad A_{22}U_2 = F_2 - A_{2\Gamma}U_\Gamma,

which can both be done in parallel.

The multiplication of a vector by the Schur complement is a discrete version of the Poincaré–Steklov operator, also called the Dirichlet to Neumann mapping.

Advantages

There are two benefits of this method. First, the elimination of the interior unknowns on the subdomains, that is the solution of the Dirichlet problems, can be done in parallel. Second, passing to the Schur complement reduces condition number and thus tends to decrease the number of iterations. For second-order problems, such as the Laplace equation or linear elasticity, the matrix of the system has condition number of the order 1/h2, where h is the characteristic element size. The Schur complement, however, has condition number only of the order 1/h.

For performances, the Schur complement method is combined with preconditioning, at least a diagonal preconditioner. The Neumann–Neumann method and the Neumann–Dirichlet method are the Schur complement method with particular kinds of preconditioners.

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.