Coarse problems of balanced domain decomposition methods by constraints
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F10%3A00178148" target="_blank" >RIV/68407700:21110/10:00178148 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Coarse problems of balanced domain decomposition methods by constraints
Original language description
We show that the coarse problem solved within the balanced decomposition method by constraints can be preconditioned using the algebraic multilevel techniques. Some basic types of coarse degrees of freedom are considered and appropriate multilevel splittings are proposed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP201%2F09%2FP500" target="_blank" >GP201/09/P500: nnn</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Article name in the collection
Seminar on Numerical Analysis 2010
ISBN
978-80-87136-07-2
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
—
Publisher name
Ústav Informatiky AV ČR, v.v.i.
Place of publication
Praha
Event location
Nové Hrady
Event date
Jan 18, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—