AbstractThis paper considers the effect of partial pivoting in automatic ordinary differential equation solvers that utilize sparse matrix techniques. Two solvers are considered, the well-known LSODES solver and a derivate LSOD28. LSODES uses the Yale Sparse Matrix Package which does not perform partial pivoting. LSOD28 uses the MA28 Sparse Matrix Package which does perform partial pivoting. Results are presented for a benchmark problem that contains several features typically present in realistic problems. The results demonstrate that both solvers perform satisfactorily. At the same time, they illustrate that the lack of partial pivoting does not necessarily degrade the efficiency or the reliability of a solver such as LSODES for such prob...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
Existing sparse partial pivoting algorithms can spend asymptomatically more time manipulating data ...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...
AbstractThis paper considers the effect of partial pivoting in automatic ordinary differential equat...
Out-of-core sparse direct solvers reduce the amount of main memory needed to factorize and solve lar...
The use of implicit methods for numerically solving stiff systems of differential equations requires...
AbstractThe use of implicit methods for numerically solving stiff systems of differential equations ...
Abstract. We investigate several ways to improve the performance of sparse LU factorization with par...
We consider the use of 1 x 1 and 2x2 pivots for direct solution of sets of linear equations whose ma...
The coefficient matrix of a very large system of equations is generally very sparse, i. e., non-zero...
In this paper it is investigated which pivots may be processed simultaneously when solving a set of ...
Solving square linear systems of equations Ax=b is one of the primary workhorses in scientific compu...
The research reported in this paper presents a new idea of the storage structure of sparse matrices....
AbstractLarge systems of linear ordinary differential equations appear in a natural way in many fiel...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
Existing sparse partial pivoting algorithms can spend asymptomatically more time manipulating data ...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...
AbstractThis paper considers the effect of partial pivoting in automatic ordinary differential equat...
Out-of-core sparse direct solvers reduce the amount of main memory needed to factorize and solve lar...
The use of implicit methods for numerically solving stiff systems of differential equations requires...
AbstractThe use of implicit methods for numerically solving stiff systems of differential equations ...
Abstract. We investigate several ways to improve the performance of sparse LU factorization with par...
We consider the use of 1 x 1 and 2x2 pivots for direct solution of sets of linear equations whose ma...
The coefficient matrix of a very large system of equations is generally very sparse, i. e., non-zero...
In this paper it is investigated which pivots may be processed simultaneously when solving a set of ...
Solving square linear systems of equations Ax=b is one of the primary workhorses in scientific compu...
The research reported in this paper presents a new idea of the storage structure of sparse matrices....
AbstractLarge systems of linear ordinary differential equations appear in a natural way in many fiel...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
Existing sparse partial pivoting algorithms can spend asymptomatically more time manipulating data ...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...