All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Decomposition into subspaces preconditioning: abstract framework

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10422207" target="_blank" >RIV/00216208:11320/20:10422207 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21110/20:00328157

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=rEDmWuY-Fg" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=rEDmWuY-Fg</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11075-019-00671-4" target="_blank" >10.1007/s11075-019-00671-4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Decomposition into subspaces preconditioning: abstract framework

  • Original language description

    Operator preconditioning based on decomposition into subspaces has been developed in early 90&apos;s in the works of Nepomnyaschikh, Matsokin, Oswald, Griebel, Dahmen, Kunoth, Rude, Xu, and others, with inspiration from particular applications, e.g., to fictitious domains, additive Schwarz methods, multilevel methods etc. Our paper presents a revisited general additive splitting-based preconditioning scheme which is not connected to any particular preconditioning method. We primarily work with infinite-dimensional spaces. Motivated by the work of Faber, Manteuffel, and Parter published in 1990, we derive spectral and norm lower and upper bounds for the resulting preconditioned operator. The bounds depend on three pairs of constants which can be estimated independently in practice. We subsequently describe a nontrivial general relationship between the infinite-dimensional results and their finite-dimensional analogs valid for the Galerkin discretization. The presented abstract framework is universal and easily applicable to specific approaches, which is illustrated on several examples.

  • Czech name

  • Czech description

Classification

  • 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

Result continuities

  • Project

    <a href="/en/project/GC17-04150J" target="_blank" >GC17-04150J: Reliable two-scale Fourier/finite element-based simulations: Error-control, model reduction, and stochastics</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • 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

    Numerical Algorithms

  • ISSN

    1017-1398

  • e-ISSN

  • Volume of the periodical

    83

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    42

  • Pages from-to

    57-98

  • UT code for WoS article

    000511898000003

  • EID of the result in the Scopus database

    2-s2.0-85061185815