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”

A posteriori error estimates based on multilevel decompositions with an iterative solver on the coarsest level

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F25%3A00644209" target="_blank" >RIV/67985840:_____/25:00644209 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216208:11320/25:10511086

  • Result on the web

    <a href="https://doi.org/10.1553/etna_vol63s566" target="_blank" >https://doi.org/10.1553/etna_vol63s566</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1553/etna_vol63s566" target="_blank" >10.1553/etna_vol63s566</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A posteriori error estimates based on multilevel decompositions with an iterative solver on the coarsest level

  • Original language description

    Multilevel methods represent a powerful approach to the numerical solution of partial differential equations. The multilevel structure can also be used to construct estimates for the total and algebraic errors of the computed approximations. This paper deals with residual-based error estimates that rely on properties of quasi-interpolation operators, stable splittings, or frames. We focus on the settings where the system matrix on the coarsest level is still large and the associated terms in the estimates can only be approximated. We show that the way in which the error term associated with the coarsest level is approximated is crucial. It can significantly affect both the efficiency (accuracy) of the overall error estimates and their robustness with respect to the size of the coarsest-level problem. We propose a new approximation of the coarsest-level term based on using the conjugate gradient method with an appropriate stopping criterion. We prove that the resulting estimates are efficient and robust with respect to the size of the coarsest-level problem. Numerical experiments illustrate the theoretical findings.

  • 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

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/GA23-06159S" target="_blank" >GA23-06159S: Vortical structures: advanced identification and efficient numerical simulation</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • 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

    Electronic Transactions on Numerical Analysis

  • ISSN

    1068-9613

  • e-ISSN

    1068-9613

  • Volume of the periodical

    63

  • Issue of the periodical within the volume

    December

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    43

  • Pages from-to

    566-608

  • UT code for WoS article

    001677407600013

  • EID of the result in the Scopus database

    2-s2.0-105028260586