Name
Title | ||
|---|---|---|
Novel data formats and algorithms for dense linear algebra computations: minisymposium abstract |
Abstract | ||
|---|---|---|
Recently, recursion was introduced into the area of Dense Linear Algebra with the intent of producing new algorithms as well
as improving its existing algorithms. Recursion, via the divide-and-conquer paradigm, introduced variable blocking to complement
the standard fixed block algorithms. In particular, new data structures for dense linear algebra became an active research
area. This minisymposium focuses on both new data structures and/or new or existing algorithms for high performing dense linear
algebra algorithms.
|
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-75755-9_63 | PARA |
Keywords | Field | DocType |
novel data format,dense linear algebra computation,divide and conquer,data structure | Linear algebra,Data structure,Computer science,Parallel computing,Algorithm,Theoretical computer science,Fixed Block,Computational science,Numerical linear algebra,Recursion,Computation | Conference |
Volume | ISSN | ISBN |
4699 | 0302-9743 | 3-540-75754-6 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fred G. Gustavson | 1 | 1185 | 223.40 |
| Jerzy Waśniewski | 2 | 239 | 36.64 |