Name
Abstract | ||
|---|---|---|
We present the way in which we have constructed an implementation of a sparse Cholesky factorization based on a hypermatrix data structure. This data structure is a storage scheme which produces a recursive 2D partitioning of a sparse matrix. It can be useful on some large sparse matrices. Subblocks are stored as dense matrices. Thus, efficient BLAS3 routines can be used. However, since we are dealing with sparse matrices some zeros may be stored in those dense blocks. The overhead introduced by the operations on zeros can become large and considerably degrade performance. We present the ways in which we deal with this overhead. Using matrices from different areas (Interior Point Methods of linear programming and Finite Element Methods), we evaluate our sequential in-core hypermatrix sparse Cholesky implementation. We compare its performance with several other codes and analyze the results. In spite of using a simple fixed-size partitioning of the matrix our code obtains competitive performance. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00200-007-0039-8 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
Sparse Cholesky,Hypermatrix structure,2D partitioning,Windows in submatrices,Small Matrix Library | Data structure,Discrete mathematics,Incomplete Cholesky factorization,Matrix (mathematics),Minimum degree algorithm,Sparse approximation,Algorithm,Theoretical computer science,Linear programming,Sparse matrix,Mathematics,Cholesky decomposition | Journal |
Volume | Issue | ISSN |
18 | 3 | 0938-1279 |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José R. Herrero | 1 | 94 | 16.90 |
| Juan J. Navarro | 2 | 323 | 42.90 |