Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning

doi:10.1016/j.jpdc.2018.04.017

Title: Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning

Full Record
Other Related Research

Authors:: Chow, Edmond; Anzt, Hartwig; Scott, Jennifer; Dongarra, Jack

Publication Date:: 2018-09-01

Sponsoring Org.:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)

OSTI Identifier:: 1582723

Grant/Contract Number:: SC-0016564; SC-0016513

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Journal of Parallel and Distributed Computing

Additional Journal Information:: Journal Name: Journal of Parallel and Distributed Computing Journal Volume: 119 Journal Issue: C; Journal ID: ISSN 0743-7315

Publisher:: Elsevier

Country of Publication:: United States

Language:: English

Citation Formats


                    Chow, Edmond, Anzt, Hartwig, Scott, Jennifer, and Dongarra, Jack. Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning.  United States: N. p., 2018. 
        Web.  doi:10.1016/j.jpdc.2018.04.017.

Copy to clipboard


                    Chow, Edmond, Anzt, Hartwig, Scott, Jennifer, & Dongarra, Jack. Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning.  United States.  doi:10.1016/j.jpdc.2018.04.017.

Copy to clipboard


                    Chow, Edmond, Anzt, Hartwig, Scott, Jennifer, and Dongarra, Jack. Sat .  
        "Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning".  United States.  doi:10.1016/j.jpdc.2018.04.017.

Copy to clipboard


                    
@article{osti_1582723,

  title        = {Using Jacobi iterations and blocking for solving sparse triangular systems in incomplete factorization preconditioning},

  author       = {Chow, Edmond and Anzt, Hartwig and Scott, Jennifer and Dongarra, Jack},

  abstractNote = {},

  doi          = {10.1016/j.jpdc.2018.04.017},

  journal      = {Journal of Parallel and Distributed Computing},

  number       = C,

  volume       = 119,

  place        = {United States},

  year         = {2018},

  month        = {9}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
DOI: 10.1016/j.jpdc.2018.04.017

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Experience with the incomplete Cholesky conjugate gradient method in a diffusion code

Journal Article Hoebel, W. - Nucl. Sci. Eng.; (United States)

For the numerical solution of sparse systems of linear equations arising from the finite difference approximation of the multidimensional neutron diffusion equation, fast methods are needed. Effective algorithms for scalar computers may not be likewise suitable on vector computers. In the improved version (DIXY2) of the Karlsruhe two-dimensional neutron diffusion code for rectangular geometries, an incomplete Cholesky conjugate gradient (ICCG) algorithm has been combined with the originally implemented cyclically reduced four-line successive overrelaxation (CR4LSOR) inner iteration method. The combined procedure is automatically activated for slowly converging applications, thus leading to a drastic reduction of iterations as well as CPU timesmore »« less
Incomplete Sparse Approximate Inverses for Parallel Preconditioning

Journal Article Anzt, Hartwig ; Huckle, Thomas K. ; Bräckle, Jürgen ; ... - Parallel Computing

In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as anmore »« less
Cited by 1
DOI: 10.1016/j.parco.2017.10.003

Full Text Available
Parallel iterative linear solvers for oil reservoir models

Journal Article Efrat, I. ; Tismenetsky, M. - IBM J. Res. Dev.; (United States)

This paper suggests a new algorithm for solving sparse linear systems which is readily parallelized and is very efficient for matrices arising in such domains as reservoir modeling. The algorithm is, in fact, a variant of the incomplete block factorization technique, accelerated by Biconjugate Gradient iterations or by another acceleration method. Implementation on a vector computer such as the IBM 3090 Vector Facility is described. We also suggest some refinements of known preconditioning methods enabling their parallel computation. Numerical experiments are presented to display the performance of the suggested methods. Special attention is given to fully implicit, multiphase models whichmore » yield asymmetrical systems.« less
DOI: 10.1147/rd.302.0184
High-order sparse factorization methods for elliptic boundary value problems

Conference Hyman, J.M. ; Manteuffel, T.A.

We are interested in solving the sparse linear systems, Av = b, that arise from finite difference or finite element approximations to partial differential equations. May iterative methods require solving an easier approximate equation, Pv = b, on each iteration. This is often called preconditioning or operator splitting (1,2,4,6-9,12-14). The methods we consider factor A approximately into the product of an upper and lower triangular matrix P is identical to LU approx. = A. These methods are called incomplete LU factorization methods and their convergence rate depends on how well P approximates A. We describe some new algorithms to generatemore »« less
Full Text Available
Performance analysis of high quality parallel preconditioners applied to 3D finite element structural analysis

Conference Kolotilina, L. ; Nikishin, A. ; Yeremin, A.

The solution of large systems of linear equations is a crucial bottleneck when performing 3D finite element analysis of structures. Also, in many cases the reliability and robustness of iterative solution strategies, and their efficiency when exploiting hardware resources, fully determine the scope of industrial applications which can be solved on a particular computer platform. This is especially true for modern vector/parallel supercomputers with large vector length and for modern massively parallel supercomputers. Preconditioned iterative methods have been successfully applied to industrial class finite element analysis of structures. The construction and application of high quality preconditioners constitutes a high percentagemore »« less
Full Text Available

Similar Records