Academic Journal
Data Structures in Java for Matrix Computations
| Τίτλος: | Data Structures in Java for Matrix Computations |
|---|---|
| Συγγραφείς: | Geir Gundersen, Trond Steihaug |
| Συνεισφορές: | The Pennsylvania State University CiteSeerX Archives |
| Πηγή: | http://www.ii.uib.no/forskningsgrupper/opt/forskning/papers/NIK2002.ps. |
| Έτος έκδοσης: | 2002 |
| Συλλογή: | CiteSeerX |
| Περιγραφή: | In this paper it is shown how to utilize Java arrays for matrix computations. We discuss the disadvantages of Java arrays when used as two-dimensional array for dense matrix computation, and how to improve the performance. We show how to create efficient dynamic data structure for sparse matrix computation using Java's native arrays. We construct a data structure for large sparse matrices that is unique for Java. This datastructure is shown to be more dynamic and efficient than the traditional storage schemes for large sparse matrices. Numerical results show that this new data structure, called Java Sparse Array (JSA), is competitive with the traditionally Compressed Row Storage scheme (CRS) on matrix computation routines. Java gives exibility without loosing efficiency. Compared to other object oriented data structures it is shown that JSA has the same flexibility. |
| Τύπος εγγράφου: | text |
| Περιγραφή αρχείου: | application/postscript |
| Γλώσσα: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7544; http://www.ii.uib.no/forskningsgrupper/opt/forskning/papers/NIK2002.ps |
| Διαθεσιμότητα: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7544 http://www.ii.uib.no/forskningsgrupper/opt/forskning/papers/NIK2002.ps |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: | edsbas.F67151A5 |
| Βάση Δεδομένων: | BASE |
| Η περιγραφή δεν είναι διαθέσιμη |