AbstractWe review the influence of the advent of high-performance computing on the solution of linear equations. We will concentrate on direct methods of solution and consider both the case when the coefficient matrix is dense and when it is sparse. We will examine the current performance of software in this area and speculate on what advances we might expect in the early years of the next century
In this review paper, we consider some important developments and trends in algorithm design for t...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
AbstractWe review the influence of the advent of high-performance computing on the solution of linea...
Manufacturers of computer hardware are able to continuously sustain an unprecedented pace of progres...
42 pages, available as LIP research report RR-2009-15Numerical linear algebra and combinatorial opti...
This report has been developed over the work done in the deliverable [Nava94] There it was shown tha...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
The computational aspects of the simplex algorithm are investigated, and high performance computing ...
Abstract. On many high-speed computers the dense matrix technique is preferable to sparse matrix tec...
It is well established that reduced precision arithmetic can be exploited to accelerate the solution...
AbstractThe increasing availability of advanced-architecture computers has a significant effect on a...
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. ...
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. ...
Abstract: Few realize that, for large matrices, many dense matrix computations achieve nearly the sa...
In this review paper, we consider some important developments and trends in algorithm design for t...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
AbstractWe review the influence of the advent of high-performance computing on the solution of linea...
Manufacturers of computer hardware are able to continuously sustain an unprecedented pace of progres...
42 pages, available as LIP research report RR-2009-15Numerical linear algebra and combinatorial opti...
This report has been developed over the work done in the deliverable [Nava94] There it was shown tha...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
The computational aspects of the simplex algorithm are investigated, and high performance computing ...
Abstract. On many high-speed computers the dense matrix technique is preferable to sparse matrix tec...
It is well established that reduced precision arithmetic can be exploited to accelerate the solution...
AbstractThe increasing availability of advanced-architecture computers has a significant effect on a...
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. ...
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. ...
Abstract: Few realize that, for large matrices, many dense matrix computations achieve nearly the sa...
In this review paper, we consider some important developments and trends in algorithm design for t...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...