This is a development snapshot of the batched sparse iterative solver capability in the Ginkgo numerical linear algebra library (https://github.com/ginkgo-project/ginkgo). It can be used to solve a batch of many small sparse linear systems sharing a common sparsity pattern. Benchmarking facilities are included so that comparisons among the different batched solvers can be made, as well as comparison against a vendor-provided batched dense direct solver
In this chapter we will present an overview of a number of related iterative methods for the solutio...
LINSOL is an iterative linear solver package for sparse matrices that contains presently eight diffe...
Solvers for large sparse linear systems come in two categories: di-rect and iterative. Amesos2, a pa...
Source code and data for "Batched sparse iterative solvers on GPU for the collision operator for fus...
Ginkgo is a production-ready sparse linear algebra library for high performance computing on GPU-cen...
This artifact archives the repository used for our paper on implementing batched iterative solvers f...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--167) / BLDSC - Briti...
revision 2001/06/01 We present a benchmark of iterative solvers for sparse matrices. The benchmark c...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
We present a benchmark of iterative solvers for sparse matrices. The benchmark contains several comm...
Computational efficiencies of seven different algorithms for the solution of sparse linear equation ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
In geometry processing, numerical optimization methods often involve solving sparse linear systems o...
ABSTRACT. The solution of large sparse linear systems is an important kernel in scientific computing...
In this chapter we will present an overview of a number of related iterative methods for the solutio...
LINSOL is an iterative linear solver package for sparse matrices that contains presently eight diffe...
Solvers for large sparse linear systems come in two categories: di-rect and iterative. Amesos2, a pa...
Source code and data for "Batched sparse iterative solvers on GPU for the collision operator for fus...
Ginkgo is a production-ready sparse linear algebra library for high performance computing on GPU-cen...
This artifact archives the repository used for our paper on implementing batched iterative solvers f...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--167) / BLDSC - Briti...
revision 2001/06/01 We present a benchmark of iterative solvers for sparse matrices. The benchmark c...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
We present a benchmark of iterative solvers for sparse matrices. The benchmark contains several comm...
Computational efficiencies of seven different algorithms for the solution of sparse linear equation ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
In geometry processing, numerical optimization methods often involve solving sparse linear systems o...
ABSTRACT. The solution of large sparse linear systems is an important kernel in scientific computing...
In this chapter we will present an overview of a number of related iterative methods for the solutio...
LINSOL is an iterative linear solver package for sparse matrices that contains presently eight diffe...
Solvers for large sparse linear systems come in two categories: di-rect and iterative. Amesos2, a pa...