On multipoint constraints in FETI methods

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F25%3A10256925" target="_blank" >RIV/61989100:27240/25:10256925 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/25:10256925
Result on the web
<a href="https://ampapers.math.cas.cz/full/oa/70/1/am70_1_3.pdf" target="_blank" >https://ampapers.math.cas.cz/full/oa/70/1/am70_1_3.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.21136/AM.2025.0114-24" target="_blank" >10.21136/AM.2025.0114-24</a>

Result language
angličtina
Original language name
On multipoint constraints in FETI methods
Original language description
FETI (finite element tearing and interconnecting) based domain decomposition methods are well-established massively parallel methods for solving huge linear systems arising from discretizing partial differential equations. The first steps of FETI decompose the domain into nonoverlapping subdomains, discretize the subdomains using matching grids, and interconnect the adjacent variables by multipoint constraints. However, the multipoint constraints enforcing identification of the corners' variables do not have a unique representation and their proper choice and modification can improve the performance of FETI. Here, we briefly review the main options, including orthogonal, fully redundant, or localized constraints, and use the basic linear algebra and spectral graph theory to examine the quantitative effect of their choice on the effective control of the feasibility error and rate of convergence of FETI.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)