About: HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • This paper focuses on the design and development of a new robust and efficient general-purpose incomplete Cholesky factorization package HSL MI28, which is available within the HSL mathematical software library. It implements a limited memory approach that exploits ideas from the positive semidefinite Tismenetsky-Kaporin modification scheme and, through the incorporation of intermediate memory, is a generalization of the widely-used ICFS algorithm of Lin and Moré. Both the density of the incomplete factor and the amount of memory used in its computation are under the user’s control. The performance of HSL MI28 is demonstrated using extensive numerical experiments involving a large set of test problems arising from a wide range of real-world applications. The numerical experiments are used to isolate the effects of scaling, ordering and dropping strategies so as to assess their usefulness in the development of robust algebraic incomplete factorization preconditioners and to select default settings for HSL MI28. They also illustrate the significant advantage of employing a modest amount of intermediate memory. Furthermore, the results demonstrate that, with limited memory, high quality yet sparse general-purpose preconditioners are obtained. Comparisons are made with ICFS, with a level-based incomplete factorization code and, finally, with a state-of-the-art direct solver.
  • This paper focuses on the design and development of a new robust and efficient general-purpose incomplete Cholesky factorization package HSL MI28, which is available within the HSL mathematical software library. It implements a limited memory approach that exploits ideas from the positive semidefinite Tismenetsky-Kaporin modification scheme and, through the incorporation of intermediate memory, is a generalization of the widely-used ICFS algorithm of Lin and Moré. Both the density of the incomplete factor and the amount of memory used in its computation are under the user’s control. The performance of HSL MI28 is demonstrated using extensive numerical experiments involving a large set of test problems arising from a wide range of real-world applications. The numerical experiments are used to isolate the effects of scaling, ordering and dropping strategies so as to assess their usefulness in the development of robust algebraic incomplete factorization preconditioners and to select default settings for HSL MI28. They also illustrate the significant advantage of employing a modest amount of intermediate memory. Furthermore, the results demonstrate that, with limited memory, high quality yet sparse general-purpose preconditioners are obtained. Comparisons are made with ICFS, with a level-based incomplete factorization code and, finally, with a state-of-the-art direct solver. (en)
Title
  • HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code
  • HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code (en)
skos:prefLabel
  • HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code
  • HSL MI28: An Efficient and Robust Limited-Memory Incomplete Cholesky Factorization Code (en)
skos:notation
  • RIV/67985807:_____/14:00422618!RIV15-GA0-67985807
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I, P(GA13-06684S)
http://linked.open...iv/cisloPeriodika
  • 4
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 19903
http://linked.open...ai/riv/idVysledku
  • RIV/67985807:_____/14:00422618
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • preconditioning; sparse linear systems; incomplete decompositions; preconditioned iterative methods (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [3EFE69A987B9]
http://linked.open...i/riv/nazevZdroje
  • ACM Transactions on Mathematical Software
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 40
http://linked.open...iv/tvurceVysledku
  • Scott, J.
  • Tůma, Miroslav
http://linked.open...ain/vavai/riv/wos
  • 000339622700001
issn
  • 0098-3500
number of pages
http://bibframe.org/vocab/doi
  • 10.1145/2617555
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software