In the paper it is shown how to utilize the flexibility in native Java arrays for matrix computations. Suitable datastructures for symmetric and sparse matrices are introduced. A disadvantage of the native Java arrays is shown when used as two-dimensional array for dense matrix computation. Numerical results show that the efficiency is not lost using the more flexible datastructures compared to classical datastructure for sparse matrices. This flexibility can be utilized for high performance computing (HPC).
Technical Report, Department of Informatics, University of Bergen, Bergen, Norway, February 2002