AbstractWe describe a set of procedures for computing and updating an LU factorization of a sparse matrix A, where A may be square (possibly singular) or rectangular. The procedures include a Markowitz factorization and a Bartels-Golub update, similar to those of Reid (1976, 1982). The updates provided are addition, deletion or replacement of a row or column of A, and rank-one modification. (Previously, column replacement has been the only update available.)Various design features of the implementation (LUSOL) are described, and computational comparisons are made with the LA05 and MA28 packages of Reid (1976) and Duff (1977)
In this thesis we will present an effective method for solving systems of linear equations with larg...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
Abstract. Variants of the p4 algorithm of Hellerman and Rarick and the p5 algorithm of Erisman, Grim...
AbstractWe describe a set of procedures for computing and updating an LU factorization of a sparse m...
The objective of this work is to compare the developed LU factorization update with results from MIN...
SIGLEBibliothek Weltwirtschaft Kiel C 150106 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tech...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
AbstractWe examine a direct method based on an LU decomposition of the rectangular coefficient matri...
Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization...
Abstract. Iterative methods are often suitable for solving least-squares problems min kAx, bk2, wher...
In this paper we present several improvements of widely used parallel LU factorization methods on sp...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we pres...
In this paper, we address the problem of preconditioning sequences of large sparse indefinite system...
Tato práce řeší LU rozklad řídkých matic a možnost jeho paralelizace. K rozkladu je využita Croutova...
In this thesis we will present an effective method for solving systems of linear equations with larg...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
Abstract. Variants of the p4 algorithm of Hellerman and Rarick and the p5 algorithm of Erisman, Grim...
AbstractWe describe a set of procedures for computing and updating an LU factorization of a sparse m...
The objective of this work is to compare the developed LU factorization update with results from MIN...
SIGLEBibliothek Weltwirtschaft Kiel C 150106 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tech...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
AbstractWe examine a direct method based on an LU decomposition of the rectangular coefficient matri...
Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization...
Abstract. Iterative methods are often suitable for solving least-squares problems min kAx, bk2, wher...
In this paper we present several improvements of widely used parallel LU factorization methods on sp...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we pres...
In this paper, we address the problem of preconditioning sequences of large sparse indefinite system...
Tato práce řeší LU rozklad řídkých matic a možnost jeho paralelizace. K rozkladu je využita Croutova...
In this thesis we will present an effective method for solving systems of linear equations with larg...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
Abstract. Variants of the p4 algorithm of Hellerman and Rarick and the p5 algorithm of Erisman, Grim...