It is demonstrated how conventional algorithms for computing the LDU decomposition of a square matrix, or Cholesky factorization for symmetric positive definite matrices, can be re-ordered into Jacobi-type algorithms. For efficient parallel implementation on a systolic array, the resulting schemes compare favorably with earlier implementations
In this paper, we study the computation of the singular value decomposition of a matrix on the ILLI...
a b s t r a c t In this paper a new ILU factorization preconditioner for solving large sparse linear...
In this article, we present several new permutations for I-matrices making these more suitable for i...
This note concerns the computation of the Cholesky factorization of a symmetric and positive defini...
We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sp...
We describe a parallel algorithm for finding the Cholesky factorization of a sparse symmetric posit...
This paper is concerned with parallel algorithms for matrix factorization on distributed-memory, mes...
In this paper we present a new parallel algorithm for computing the Cholesky decomposition (LL^T) of...
The process of factorizing a symmetric matrix using the Cholesky (LLT ) or indefinite (LDLT ) factor...
We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and fo...
Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm comp...
In this paper we consider the data distribution and data movement issues related to the solution of ...
This article, aimed at a general audience of computational scientists, surveys the Cholesky factoriz...
. Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm co...
A common approach to solve problems in numerical linear algebra eciently on modern high speed comput...
In this paper, we study the computation of the singular value decomposition of a matrix on the ILLI...
a b s t r a c t In this paper a new ILU factorization preconditioner for solving large sparse linear...
In this article, we present several new permutations for I-matrices making these more suitable for i...
This note concerns the computation of the Cholesky factorization of a symmetric and positive defini...
We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sp...
We describe a parallel algorithm for finding the Cholesky factorization of a sparse symmetric posit...
This paper is concerned with parallel algorithms for matrix factorization on distributed-memory, mes...
In this paper we present a new parallel algorithm for computing the Cholesky decomposition (LL^T) of...
The process of factorizing a symmetric matrix using the Cholesky (LLT ) or indefinite (LDLT ) factor...
We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and fo...
Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm comp...
In this paper we consider the data distribution and data movement issues related to the solution of ...
This article, aimed at a general audience of computational scientists, surveys the Cholesky factoriz...
. Given a symmetric and not necessarily positive definite matrix A, a modified Cholesky algorithm co...
A common approach to solve problems in numerical linear algebra eciently on modern high speed comput...
In this paper, we study the computation of the singular value decomposition of a matrix on the ILLI...
a b s t r a c t In this paper a new ILU factorization preconditioner for solving large sparse linear...
In this article, we present several new permutations for I-matrices making these more suitable for i...
DOI
Add to ORKG