In recent years a number of solvers for the direct solution of large sparse symmetric linear systems of equations have been developed. These include solvers that are designed for the solution of positive definite systems as well as those that are principally intended for solving indefinite problems. In this study, we use performance profiles as a tool for evaluating and comparing the performance of serial sparse direct solvers on an extensive set of symmetric test problems taken from a range of practical applications
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sp...
In recent years, a number of new direct solvers for the solution of large sparse, symmetric linear s...
At the heart of many computations in science and engineering lies the need to efficiently and accura...
The aim of this thesis is to investigate and compare two solvers for big, sparse, complex, symmetric...
Complete results from a numerical evaluation of sparse direct solvers for the solution of large, spa...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
On many current and emerging computing architectures, single-precision calculations are at least twi...
Complete results from a numerical evaluation of sparse direct solvers for the solution of large, spa...
Symmetric positive definite equation solvers play a very important role in structural analysis. For ...
Recent advances in linear programming solution methodology have focused on interior point algorithms...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
We describe the design, implementation, and performance of a frontal code for the solution of large ...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sp...
In recent years, a number of new direct solvers for the solution of large sparse, symmetric linear s...
At the heart of many computations in science and engineering lies the need to efficiently and accura...
The aim of this thesis is to investigate and compare two solvers for big, sparse, complex, symmetric...
Complete results from a numerical evaluation of sparse direct solvers for the solution of large, spa...
We present an overview of parallel direct methods for solving sparse systems of linear equations, fo...
On many current and emerging computing architectures, single-precision calculations are at least twi...
Complete results from a numerical evaluation of sparse direct solvers for the solution of large, spa...
Symmetric positive definite equation solvers play a very important role in structural analysis. For ...
Recent advances in linear programming solution methodology have focused on interior point algorithms...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
We describe the design, implementation, and performance of a frontal code for the solution of large ...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sp...