#### Filter Results:

#### Publication Year

2002

2009

#### Key Phrase

#### Publication Venue

Learn More

In this article, we present two new algorithms for solving given triangular systems in parallel on a shared memory architecture. Multilevel incomplete LU factorization based preconditioners, which have been very successful for solving linear systems iteratively, require these triangular solves. Hence, the algorithms presented here can be seen as… (More)

In this article, we present several new permutations for I-matrices making these more suitable for incomplete LDU-factorization preconditioners used in solving linear systems by iterative methods. A general matrix can be transformed by row permutation as well as row and columns scaling into an I-matrix, i.e. a matrix having elements of modulus 1 on the… (More)

Recent advances in multilevel LU factorizations and novel preprocessing techniques have led to an extremely large number of possibilities for preconditioning sparse, unsymmetric linear systems for solving with iterative methods. However, not all combinations work well for all systems, so making the right choices is essential for obtaining an efficient… (More)

- ‹
- 1
- ›