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”

On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F14%3A00428296" target="_blank" >RIV/67985807:_____/14:00428296 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1137/130917582" target="_blank" >http://dx.doi.org/10.1137/130917582</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/130917582" target="_blank" >10.1137/130917582</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization

  • Original language description

    Incomplete Cholesky factorizations have long been important as preconditioners for use in solving large-scale symmetric positive-definite linear systems. In this paper, we focus on the relationship between two important positive semidefinite modificationschemes that were introduced to avoid factorization breakdown, namely, the approach of Jennings and Malik and that of Tismenetsky. We present a novel view of the relationship between the two schemes and implement them in combination with a limited memory approach. We explore their effectiveness using extensive numerical experiments involving a large set of test problems arising from a wide range of practical applications.

  • 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

    <a href="/en/project/GA13-06684S" target="_blank" >GA13-06684S: Iterative Methods in Computational Mathematics: Analysis, Preconditioning, and Applications</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2014

  • 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

    SIAM Journal on Scientific Computing

  • ISSN

    1064-8275

  • e-ISSN

  • Volume of the periodical

    36

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    25

  • Pages from-to

    "A609"-"A633"

  • UT code for WoS article

    000335817600014

  • EID of the result in the Scopus database