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”

The Importance of Structure in Incomplete Factorization Preconditioners

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F11%3A00351679" target="_blank" >RIV/67985807:_____/11:00351679 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/s10543-010-0299-8" target="_blank" >http://dx.doi.org/10.1007/s10543-010-0299-8</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10543-010-0299-8" target="_blank" >10.1007/s10543-010-0299-8</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Importance of Structure in Incomplete Factorization Preconditioners

  • Original language description

    In this paper, we consider level-based preconditioning, which is one of the basic approaches to incomplete factorization preconditioning of iterative methods. It is well-known that while structure-based preconditioners can be very useful, excessive memory demands can limit their usefulness. Here we present an improved strategy that considers the individual entries of the system matrix and restricts small entries to contributing to fewer levels of fill than the largest entries. Using symmetric positive-definite problems arising from a wide range of practical applications, we show that the use of variable levels of fill can yield incomplete Cholesky factorization preconditioners that are more efficient than those resulting from the standard level-based approach. Further numerical results demonstrate that our level-based approach can lead to much sparser but efficient incomplete factorization preconditioners.

  • 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

    2011

  • 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

    Bit

  • ISSN

    0006-3835

  • e-ISSN

  • Volume of the periodical

    51

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    SE - SWEDEN

  • Number of pages

    20

  • Pages from-to

    385-404

  • UT code for WoS article

    000291482000008

  • EID of the result in the Scopus database