Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2015

Highly Cited

2015

This paper presents a new fine-grained parallel algorithm for computing an incomplete LU factorization. All nonzeros in the…

2015

2015

In this technical report we study dierent parallel graph coloring algorithms and their application to the incomplete-LU…

2011

2011

We present a new supernode-based incomplete LU factorization method to construct a preconditioner for solving sparse linear…

2010

2010

This paper addresses the problem of computing preconditioners for solving linear systems of equations with a sequence of slowly…

Review

2006

Review

2006

Productive strategies for evaluating outcomes are becoming increasingly important for the improvement, and even the survival, of…

2002

2002

A graph theoretic process that models level-based, incomplete LU factorization (ILU(`)) of sparse unsymmetric matrices is…

Highly Cited

2000

Highly Cited

2000

We consider solving three-dimensional electromagnetic problems in parameter regimes where the quasi-static approximation applies…

Highly Cited

1998

Highly Cited

1998

This paper is concerned with a new approach to preconditioning for large, sparse linear systems. A procedure for computing an…

Highly Cited

1996

Highly Cited

1996

A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix $A$ is developed…

Highly Cited

1994

Highly Cited

1994

In this paper we describe an Incomplete LU factorization technique based on a strategy which combines two heuristics. This ILUT…