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/~geirg/Gundersen2004.pdf. |
| Συλλογή: | CiteSeerX |
| Θεματικοί όροι: | KEY WORDS, Java, linear algebra, data structures, sparse matrices |
| Περιγραφή: | In this paper we show how to utilize Java’s native arrays for matrix computations. The disadvantages of Java arrays used as a 2D array for dense matrix computation are discussed and ways to improve the performance are examined. We show how to create efficient dynamic data structures for sparse matrix computations using Java’s native arrays. This data structure is unique for Java and shown to be more dynamic and efficient than the traditional storage schemes for large sparse matrices. Numerical testing indicates that this new data structure, called Java Sparse Array, is competitive with the traditional Compressed Row Storage scheme on matrix computation routines. Java gives increased flexibility without losing efficiency. Compared with other object-oriented data structures Java Sparse Array is shown to have the same flexibility. Copyright c © 2004 John Wiley & Sons, Ltd. |
| Τύπος εγγράφου: | text |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.6920; http://www.ii.uib.no/~geirg/Gundersen2004.pdf |
| Διαθεσιμότητα: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.6920 http://www.ii.uib.no/~geirg/Gundersen2004.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Αριθμός Καταχώρησης: | edsbas.9F4444 |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.6920# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.9F4444 RelevancyScore: 750 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 750 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Data Structures in Java for Matrix Computations – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Geir+Gundersen%22">Geir Gundersen</searchLink><br /><searchLink fieldCode="AR" term="%22Trond+Steihaug%22">Trond Steihaug</searchLink> – Name: Author Label: Contributors Group: Au Data: The Pennsylvania State University CiteSeerX Archives – Name: TitleSource Label: Source Group: Src Data: <i>http://www.ii.uib.no/~geirg/Gundersen2004.pdf</i>. – Name: Subset Label: Collection Group: HoldingsInfo Data: CiteSeerX – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22KEY+WORDS%22">KEY WORDS</searchLink><br /><searchLink fieldCode="DE" term="%22Java%22">Java</searchLink><br /><searchLink fieldCode="DE" term="%22linear+algebra%22">linear algebra</searchLink><br /><searchLink fieldCode="DE" term="%22data+structures%22">data structures</searchLink><br /><searchLink fieldCode="DE" term="%22sparse+matrices%22">sparse matrices</searchLink> – Name: Abstract Label: Description Group: Ab Data: In this paper we show how to utilize Java’s native arrays for matrix computations. The disadvantages of Java arrays used as a 2D array for dense matrix computation are discussed and ways to improve the performance are examined. We show how to create efficient dynamic data structures for sparse matrix computations using Java’s native arrays. This data structure is unique for Java and shown to be more dynamic and efficient than the traditional storage schemes for large sparse matrices. Numerical testing indicates that this new data structure, called Java Sparse Array, is competitive with the traditional Compressed Row Storage scheme on matrix computation routines. Java gives increased flexibility without losing efficiency. Compared with other object-oriented data structures Java Sparse Array is shown to have the same flexibility. Copyright c © 2004 John Wiley & Sons, Ltd. – Name: TypeDocument Label: Document Type Group: TypDoc Data: text – Name: Format Label: File Description Group: SrcInfo Data: application/pdf – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.6920; http://www.ii.uib.no/~geirg/Gundersen2004.pdf – Name: URL Label: Availability Group: URL Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.6920<br />http://www.ii.uib.no/~geirg/Gundersen2004.pdf – Name: Copyright Label: Rights Group: Cpyrght Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it. – Name: AN Label: Accession Number Group: ID Data: edsbas.9F4444 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.9F4444 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: KEY WORDS Type: general – SubjectFull: Java Type: general – SubjectFull: linear algebra Type: general – SubjectFull: data structures Type: general – SubjectFull: sparse matrices Type: general Titles: – TitleFull: Data Structures in Java for Matrix Computations Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Geir Gundersen – PersonEntity: Name: NameFull: Trond Steihaug – PersonEntity: Name: NameFull: The Pennsylvania State University CiteSeerX Archives IsPartOfRelationships: – BibEntity: Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa Titles: – TitleFull: http://www.ii.uib.no/~geirg/Gundersen2004.pdf Type: main |
| ResultId | 1 |