资 源 简 介
A templated parallel C++ implementation of the minres algorithm.
MINRES is a Krylov subspace iterative method for the solution of large sparse symmetric (possibly indefinite) linear systems.
The MINRES algorithm was first proposed by C.C. Paige and M.A. Saunders in 1975.
It is based on Lanczos tridiagonalization and it allows for a symmetric positive definite preconditioner.
Umberto Villa (now at Lawrence Livermore National Laboratory) is the main author of the tminres project. Santiago Akle contributed to the project by providing the CUDA wrappers.
For more information regarding the MINRES algorithm, please visit Prof M. Saunders webpage at
http://www.stanford.edu/group/SOL/software/minres.html
The aim of tminres is to provide an e
