The Ginkgo team is proud to announce the first release of Ginkgo, the
next-generation high-performance on-node sparse linear algebra library. Ginkgo
leverages the features of modern C++ to give you a tool for the iterative
solution of linear systems that is:

* Easy to use. Interfaces with cryptic naming schemes and dozens of parameters
  are a thing of the past. Ginkgo was built with good software design in mind,
  making simple things simple to express.
* High performance. Our optimized CUDA kernels ensure you are reaching the
  potential of today's GPU-accelerated high-end systems, while Ginkgo's open
  design allows extension to future hardware architectures.
* Controllable.  While Ginkgo can automatically move your data when needed, you
  remain in control by optionally specifying when the data is moved and what is
  its ownership scheme.
* Composable. Iterative solution of linear systems is an extremely versatile
  field, where effective methods are built by mixing and matching various
  components. Need a GMRES solver preconditioned with a block-Jacobi enhanced
  BiCGSTAB? Thanks to its novel linear operator abstraction, Ginkgo can do it!
* Extensible. Did not find a component you were looking for? Ginkgo is designed
  to be easily extended in various ways. You can provide your own loggers,
  stopping criteria, matrix formats, preconditioners and solvers to Ginkgo and
  have them integrate as well as the natively supported ones, without the need
  to modify or recompile the library.

For more details, access the release notes on Github:
https://github.com/ginkgo-project/ginkgo/releases