Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Schur complement method
open-in-new
<p>In <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a>, the Schur complement method, named after <a href="/facts/Issai_Schur/rqn0wQaR">Issai Schur</a>, is the basic and the earliest version of non-overlapping <a href="/facts/Domain_decomposition_method/rwrQPcf2">domain decomposition method</a>, also called <a href="/facts/Iterative_substructuring/rwrQPcf2">iterative substructuring</a>. A <a href="/facts/Finite_element/eUcfP1vn">finite element</a> 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 <a href="/facts/Conjugate_gradient_method/AFwzBS4U">conjugate gradient method</a>. </p>