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...
Abstract. We investigate several ways to improve the performance of sparse LU factorization with par...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
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...
AbstractThe use of implicit methods for numerically solving stiff systems of differential equations ...
AbstractLarge systems of linear ordinary differential equations appear in a natural way in many fiel...
The use of implicit methods for numerically solving stiff systems of differential equations requires...
Solving square linear systems of equations Ax=b is one of the primary workhorses in scientific compu...
Implicit integrators are very useful in efficiently solving stiff systems of ODEs arising from atmos...
AbstractThis paper discusses several aspects of the solution of fluid-flow problems. A model problem...
The coefficient matrix of a very large system of equations is generally very sparse, i. e., non-zero...
We consider the use of software for the direct solution of sparse linear equations within a stiff in...
Also appeared as Lapack Working Note 285We consider the solution of sparse linear systems using dire...
The research reported in this paper presents a new idea of the storage structure of sparse matrices....
Abstract. We investigate several ways to improve the performance of sparse LU factorization with par...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
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...
AbstractThe use of implicit methods for numerically solving stiff systems of differential equations ...
AbstractLarge systems of linear ordinary differential equations appear in a natural way in many fiel...
The use of implicit methods for numerically solving stiff systems of differential equations requires...
Solving square linear systems of equations Ax=b is one of the primary workhorses in scientific compu...
Implicit integrators are very useful in efficiently solving stiff systems of ODEs arising from atmos...
AbstractThis paper discusses several aspects of the solution of fluid-flow problems. A model problem...
The coefficient matrix of a very large system of equations is generally very sparse, i. e., non-zero...
We consider the use of software for the direct solution of sparse linear equations within a stiff in...
Also appeared as Lapack Working Note 285We consider the solution of sparse linear systems using dire...
The research reported in this paper presents a new idea of the storage structure of sparse matrices....
Abstract. We investigate several ways to improve the performance of sparse LU factorization with par...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...