This document describes a collection of three related ANSI C subroutine libraries for solving sparse linear systems of equations AX = B: Here A is a square, nonsingular, n x n sparse matrix, and X and B are dense n x nrhs matrices, where nrhs is the number of right-hand sides and solution vectors. Matrix A need not be symmetric or definite; indeed, SuperLU is particularly appropriate for matrices with very unsymmetric structure. All three libraries use variations of Gaussian elimination optimized to take advantage both of sparsity and the computer architecture, in particular memory hierarchies (caches) and parallelism
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
SuperLU_DIST is a distributed memory parallel solver for sparse linear systems. The solver makes sev...
BlockSolve95 is a software library for solving large, sparse systems of linear equations on massivel...
We give an overview of the algorithms, design philosophy, and implementation techniques in the soft...
In this paper, we present the main algorithmic features in the software package SuperLU DIST, a dis...
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a di...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
We describe an object oriented sparse matrix library in C++ designed for portability and performance...
It is important to have a fast, robust and scalable algorithm to solve a sparse linear system AX=B. ...
The paper deals with parallel approach for the numerical solution of large, sparse, non-symmetric sy...
We investigate parallel Gauss elimination for sparse matrices, especially those arising from the dis...
KLU is a set of routines for solving sparse linear systems of equations. It is particularly well-sui...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
SuperLU_DIST is a distributed memory parallel solver for sparse linear systems. The solver makes sev...
BlockSolve95 is a software library for solving large, sparse systems of linear equations on massivel...
We give an overview of the algorithms, design philosophy, and implementation techniques in the soft...
In this paper, we present the main algorithmic features in the software package SuperLU DIST, a dis...
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a di...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
We describe an object oriented sparse matrix library in C++ designed for portability and performance...
It is important to have a fast, robust and scalable algorithm to solve a sparse linear system AX=B. ...
The paper deals with parallel approach for the numerical solution of large, sparse, non-symmetric sy...
We investigate parallel Gauss elimination for sparse matrices, especially those arising from the dis...
KLU is a set of routines for solving sparse linear systems of equations. It is particularly well-sui...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
SuperLU_DIST is a distributed memory parallel solver for sparse linear systems. The solver makes sev...
BlockSolve95 is a software library for solving large, sparse systems of linear equations on massivel...