Preconditioning of boundary value problems using elementwise Schur complements
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F09%3A00333165" target="_blank" >RIV/68145535:_____/09:00333165 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Preconditioning of boundary value problems using elementwise Schur complements
Original language description
This paper deals with an efficient technique for computing high-quality approximations of Schur complement matrices to be used in various preconditioners for the iterative solution of finite element discretizations of elliptic boundary value problems. The Schur complements are based on a two-by-two block decomposition of the matrix, and their approximations are computed by assembly of local (macroelement) Schur complements. The block partitioning is done by imposing a particular node ordering followingthe grid refinement hierarchy in the discretization mesh. For the theoretical derivation of condition number bounds, but not for the actual application of the method, we assume that the corresponding differential operator is self-adjoint and positive definite.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
SIAM Journal on Matrix Analysis and Applications
ISSN
0895-4798
e-ISSN
—
Volume of the periodical
31
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
—
UT code for WoS article
000267745500029
EID of the result in the Scopus database
—