On finding approximate supernodes for an efficient block-ILU(k) factorization-Reference-Cited by-同舟云学术

On finding approximate supernodes for an efficient block-ILU(k) factorization

Published:2008-07 Issue:6-8 Volume:34 Page:345-362
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Hénon Pascal,Ramet Pierre,Roman Jean

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference28 articles.

1. Hybrid scheduling for the parallel solution of linear systems;Amestoy;Parallel Computing,2006

2. A fast and high-quality multi-level scheme for partitioning irregular graphs;Karypis;SIAM Journal on Scientific Computing,1998

3. Direct Methods for Sparse Matrices;Duff,1986

4. Computer Solution of Large Sparse Positive Definite Systems;George,1981

5. An approximate minimum degree ordering algorithm;Amestoy;SIAM Journal on Matrix Analysis and Applications,1996

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Incomplete Factorizations;Nečas Center Series;2023

2. A generalised formulation of G-continuous Bezier elements applied to non-linear MHD simulations;Journal of Computational Physics;2022-09

3. Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12

4. A high performance level-block approximate LU factorization preconditioner algorithm;Applied Numerical Mathematics;2021-04

5. Extended full-MHD simulation of non-linear instabilities in tokamak plasmas;Physics of Plasmas;2020-10