Name
Title | ||
|---|---|---|
Three versions of a minimal storage Cholesky algorithm using new data structures gives high performance speeds as verified on many computers |
Abstract | ||
|---|---|---|
Three versions of a High Performance Minimal Storage Cholesky Algorithm which uses New Data Structures are briefly described. The formats are Recursive Packed (RP), Rectangular Full Packed (RFP), and Block Packed Hybrid Formats. They all exhibited high performance on many computers on which we have done timing studies. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-68111-3_65 | PPAM |
Keywords | Field | DocType |
rectangular full packed,new data structures,cholesky algorithm,recursive packed,timing study,high performance minimal storage,block packed hybrid formats,minimal storage cholesky algorithm,new data structure,high performance,data structure | Data structure,Computer science,Parallel computing,Algorithm,Theoretical computer science,Recursion,Cholesky decomposition | Conference |
Volume | ISSN | ISBN |
4967 | 0302-9743 | 3-540-68105-1 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jerzy Waśniewski | 1 | 239 | 36.64 |
| Fred G. Gustavson | 2 | 1185 | 223.40 |