Add to ORKGWe present a new method for the a priori approximation of the order of magnitude of the entries in the LU factors of a matrix A �¢���� Cn��â��n. We are also able to predict which permutation matrices will be chosen by partial pivoting or complete pivoting Gaussian elimination. Our method uses max- plus algebra and is based purely on the moduli of the entries in the matrix. This approximation can be used in the construction of ILU preconditioners, where the max-plus LU approximation can be used to quickly determine the positions of the largest entries in the LU factors. These positions can subsequently be used as the sparsity pattern for an ILU preconditioner
AbstractIncomplete LU factorization preconditioners have been surprisingly successful for many cases...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates it...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
We present a new method for constructing incomplete Cholesky factorization preconditioners for use i...
In this article, we present several new permutations for I-matrices making these more suitable for i...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
In the first part of this dissertation, we explore a novel randomized pivoting strategy to efficient...
In this article, we present several new permutations for I-matrices making these more suitable for i...
Abstract. This paper gives sensitivity analyses by two approaches for L and U in the factor-ization ...
We derive an algorithm for estimating the largest p �¢â�°�¥ 1 values a ij or |a ij | for an m...
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) di...
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates it...
AbstractIncomplete LU factorization preconditioners have been surprisingly successful for many cases...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates it...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
We present a new method for constructing incomplete Cholesky factorization preconditioners for use i...
In this article, we present several new permutations for I-matrices making these more suitable for i...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
In the first part of this dissertation, we explore a novel randomized pivoting strategy to efficient...
In this article, we present several new permutations for I-matrices making these more suitable for i...
Abstract. This paper gives sensitivity analyses by two approaches for L and U in the factor-ization ...
We derive an algorithm for estimating the largest p �¢â�°�¥ 1 values a ij or |a ij | for an m...
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) di...
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates it...
AbstractIncomplete LU factorization preconditioners have been surprisingly successful for many cases...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates it...