Sparse QR direct solver (distributed memory version)
Sparse QR direct solver (distributed memory version)
qr_mumps is a software package for the solution of sparse, linear systems on multicore computers based on the QR factorization of the input matrix. Therefore, it is suited to solving sparse least-squares problems and to computing the minimum-norm solution of sparse,underdetermined problems. It can obviously be used for solving square problems in which case the stability provided by the use of orthogonal transformations comes at the cost of a higher operation count with respect to solvers based on, e.g., the LU factorization. qr_mumps supports real and complex, single or double precision arithmetic. This is an experimental version of the package for distributed memory.
| Package | qr-mumps 3.1 |
| Channel | guix-science |
| Definition | |
| Build status | view 🚧 |
| Home page | https://gitlab.com/qr_mumps/qr_mumps |
| Source |
