Schur complement method

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Schur complement method" – news · newspapers · books · scholar · JSTOR (February 2024) (Learn how and when to remove this message)

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.

Suppose we want to solve the Poisson equation

− Δ u = f , u | ∂ Ω = 0 {\displaystyle -\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 Ω₁, Ω₂ which share an interface Γ. Let U₁, U₂ and U_Γ be the degrees of freedom associated with each subdomain and with the interface. We can then write the linear system as

[ A 11 0 A 1 Γ 0 A 22 A 2 Γ A Γ 1 A Γ 2 A Γ Γ ] [ U 1 U 2 U Γ ] = [ F 1 F 2 F Γ ] , {\displaystyle \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 F₁, F₂ 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

Σ U Γ = F Γ − A Γ 1 A 11 − 1 F 1 − A Γ 2 A 22 − 1 F 2 , {\displaystyle \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

Σ = A Γ Γ − A Γ 1 A 11 − 1 A 1 Γ − A Γ 2 A 22 − 1 A 2 Γ . {\displaystyle \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 {\displaystyle A_{11}^{-1}} or A 22 − 1 {\displaystyle 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 Γ U Γ , A 22 U 2 = F 2 − A 2 Γ U Γ , {\displaystyle 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.

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/h², 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.

When a fast function is utilized, especially in low cost parallel computers, the Schur complement method is relatively efficient.^[1]