Matrix data structures, linear solvers, least squares methods, eigenvalue,
and singular value decompositions. For larger random dense matrices (above ~ 350 x 350)
matrix-matrix multiplication C = A.B is about 50% faster than MTJ.
Newer Version Available
Licenses
| License | URL |
|---|---|
| GNU Lesser General Public License | http://www.gnu.org/licenses/lgpl.html |
Developers
| Name | Dev Id | Roles | Organization | |
|---|---|---|---|---|
| Bjørn-Ove Heimsund | | |||
| Sam Halliday | sam.halliday<at>gmail.com | fommil |