AbstractIn this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in terms of matrix-vector operations we reveal a close relation between the Gauss-Huard algorithm and an LU factorization as constructed in an ikj variant
AbstractWe explore the connections between the Lanczos algorithm for matrix tridiagonalization and t...
International audienceSince the cost of communication (moving data) greatly exceeds the cost of doin...
In this paper, we will describe a new factorization algorithm based on the continuous representation...
AbstractIn this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in t...
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of ...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
In this contribution, we present a formalization of the well-known Gauss-Jordan algorithm. It states...
summary:In this paper we compare the numerical performance on a set of ill conditioned problems of s...
The solution of linear systems is a recurrent operation in scientific and engineering applications, ...
Solving a set of linear equations arises in many contexts in applied mathematics. At least until rec...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
This paper considers elimination methods to solve dense linear systems, in particular a variant of G...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
this paper, we give a block algorithm for the Gauss-Huard elimination. For distributed memory system...
Abstract. Since the cost of communication (moving data) greatly exceeds the cost of doing arithmetic...
AbstractWe explore the connections between the Lanczos algorithm for matrix tridiagonalization and t...
International audienceSince the cost of communication (moving data) greatly exceeds the cost of doin...
In this paper, we will describe a new factorization algorithm based on the continuous representation...
AbstractIn this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in t...
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of ...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
In this contribution, we present a formalization of the well-known Gauss-Jordan algorithm. It states...
summary:In this paper we compare the numerical performance on a set of ill conditioned problems of s...
The solution of linear systems is a recurrent operation in scientific and engineering applications, ...
Solving a set of linear equations arises in many contexts in applied mathematics. At least until rec...
AbstractThis paper gives a classification for the triangular factorization of square matrices. These...
This paper considers elimination methods to solve dense linear systems, in particular a variant of G...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
this paper, we give a block algorithm for the Gauss-Huard elimination. For distributed memory system...
Abstract. Since the cost of communication (moving data) greatly exceeds the cost of doing arithmetic...
AbstractWe explore the connections between the Lanczos algorithm for matrix tridiagonalization and t...
International audienceSince the cost of communication (moving data) greatly exceeds the cost of doin...
In this paper, we will describe a new factorization algorithm based on the continuous representation...
DOI
Add to ORKG